./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:50:46,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:50:46,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:50:46,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:50:46,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:50:46,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:50:46,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:50:46,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:50:46,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:50:46,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:50:46,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:50:46,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:50:46,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:50:46,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:50:46,880 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:50:46,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:50:46,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:50:46,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:50:46,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:50:46,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:50:46,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:50:46,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:50:46,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:50:46,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:50:46,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:50:46,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:50:46,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:50:46,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:50:46,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:50:46,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:50:46,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:50:46,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:50:46,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:50:46,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:50:46,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:50:46,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:50:46,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:50:46,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:50:46,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:50:46,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:50:46,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:50:46,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:50:46,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c [2024-11-22 13:50:47,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:50:47,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:50:47,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:50:47,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:50:47,158 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:50:47,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2024-11-22 13:50:48,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:50:48,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:50:48,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2024-11-22 13:50:48,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a0d3c0b/54382d9092b841e286ba5d1e033fdaa6/FLAG32314512e [2024-11-22 13:50:48,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a0d3c0b/54382d9092b841e286ba5d1e033fdaa6 [2024-11-22 13:50:48,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:50:48,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:50:48,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:50:48,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:50:48,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:50:48,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:50:48" (1/1) ... [2024-11-22 13:50:48,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1af493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:48, skipping insertion in model container [2024-11-22 13:50:48,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:50:48" (1/1) ... [2024-11-22 13:50:48,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:50:49,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4403,4416] [2024-11-22 13:50:49,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:50:49,050 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:50:49,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4403,4416] [2024-11-22 13:50:49,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:50:49,101 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:50:49,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49 WrapperNode [2024-11-22 13:50:49,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:50:49,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:50:49,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:50:49,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:50:49,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,151 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 340 [2024-11-22 13:50:49,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:50:49,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:50:49,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:50:49,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:50:49,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,211 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-22 13:50:49,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:50:49,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:50:49,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:50:49,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:50:49,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (1/1) ... [2024-11-22 13:50:49,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:50:49,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:50:49,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:50:49,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:50:49,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:50:49,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 13:50:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 13:50:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 13:50:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 13:50:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 13:50:49,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 13:50:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 13:50:49,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 13:50:49,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 13:50:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 13:50:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-22 13:50:49,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-22 13:50:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:50:49,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 13:50:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 13:50:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 13:50:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 13:50:49,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:50:49,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:50:49,357 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:50:49,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:50:49,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:50:50,010 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:50:50,011 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:50:50,363 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:50:50,364 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-22 13:50:50,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:50:50 BoogieIcfgContainer [2024-11-22 13:50:50,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:50:50,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:50:50,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:50:50,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:50:50,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:50:48" (1/3) ... [2024-11-22 13:50:50,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed0fd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:50:50, skipping insertion in model container [2024-11-22 13:50:50,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:49" (2/3) ... [2024-11-22 13:50:50,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed0fd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:50:50, skipping insertion in model container [2024-11-22 13:50:50,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:50:50" (3/3) ... [2024-11-22 13:50:50,403 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2024-11-22 13:50:50,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:50:50,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:50:50,432 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:50:50,528 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-22 13:50:50,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 132 flow [2024-11-22 13:50:50,609 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2024-11-22 13:50:50,609 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 13:50:50,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 7/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-22 13:50:50,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 132 flow [2024-11-22 13:50:50,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 47 transitions, 118 flow [2024-11-22 13:50:50,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:50:50,637 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=LoopHeads, 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;@63a5c608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:50:50,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-22 13:50:50,656 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:50:50,656 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2024-11-22 13:50:50,657 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 13:50:50,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:50:50,658 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:50:50,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:50:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:50:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1756639892, now seen corresponding path program 1 times [2024-11-22 13:50:50,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:50:50,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413737225] [2024-11-22 13:50:50,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:50,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:50:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:50:51,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:50:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413737225] [2024-11-22 13:50:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413737225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:50:51,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:50:51,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:50:51,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130253145] [2024-11-22 13:50:51,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:50:51,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:50:51,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:50:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:50:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:50:51,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:50:51,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:51,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:50:51,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:50:51,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:50:51,761 INFO L124 PetriNetUnfolderBase]: 2408/3712 cut-off events. [2024-11-22 13:50:51,762 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-11-22 13:50:51,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6983 conditions, 3712 events. 2408/3712 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21371 event pairs, 472 based on Foata normal form. 1/3493 useless extension candidates. Maximal degree in co-relation 6291. Up to 2067 conditions per place. [2024-11-22 13:50:51,799 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 43 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2024-11-22 13:50:51,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 261 flow [2024-11-22 13:50:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:50:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:50:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-22 13:50:51,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2024-11-22 13:50:51,813 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 118 flow. Second operand 3 states and 111 transitions. [2024-11-22 13:50:51,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 261 flow [2024-11-22 13:50:51,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-22 13:50:51,828 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 121 flow [2024-11-22 13:50:51,830 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2024-11-22 13:50:51,835 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-11-22 13:50:51,835 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 121 flow [2024-11-22 13:50:51,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:51,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:50:51,835 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:50:51,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:50:51,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:50:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:50:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -891124569, now seen corresponding path program 1 times [2024-11-22 13:50:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:50:51,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19979747] [2024-11-22 13:50:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:50:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:50:52,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:50:52,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19979747] [2024-11-22 13:50:52,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19979747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:50:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:50:52,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:50:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084062445] [2024-11-22 13:50:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:50:52,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:50:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:50:52,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:50:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:50:52,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:50:52,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:52,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:50:52,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:50:52,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:50:52,529 INFO L124 PetriNetUnfolderBase]: 2398/3648 cut-off events. [2024-11-22 13:50:52,529 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2024-11-22 13:50:52,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7581 conditions, 3648 events. 2398/3648 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20905 event pairs, 549 based on Foata normal form. 76/3563 useless extension candidates. Maximal degree in co-relation 2649. Up to 2321 conditions per place. [2024-11-22 13:50:52,556 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 51 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-11-22 13:50:52,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 283 flow [2024-11-22 13:50:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:50:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:50:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-22 13:50:52,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2024-11-22 13:50:52,558 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 121 flow. Second operand 3 states and 114 transitions. [2024-11-22 13:50:52,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 283 flow [2024-11-22 13:50:52,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:50:52,560 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 132 flow [2024-11-22 13:50:52,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2024-11-22 13:50:52,564 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-11-22 13:50:52,564 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 132 flow [2024-11-22 13:50:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:52,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:50:52,564 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:50:52,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:50:52,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:50:52,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:50:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1628986663, now seen corresponding path program 1 times [2024-11-22 13:50:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:50:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62322557] [2024-11-22 13:50:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:50:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:50:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:50:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62322557] [2024-11-22 13:50:52,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62322557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:50:52,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:50:52,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:50:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140541447] [2024-11-22 13:50:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:50:52,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:50:52,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:50:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:50:52,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:50:52,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:50:52,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:52,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:50:52,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:50:52,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:50:53,130 INFO L124 PetriNetUnfolderBase]: 2363/3739 cut-off events. [2024-11-22 13:50:53,130 INFO L125 PetriNetUnfolderBase]: For 1405/1405 co-relation queries the response was YES. [2024-11-22 13:50:53,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8147 conditions, 3739 events. 2363/3739 cut-off events. For 1405/1405 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 22719 event pairs, 571 based on Foata normal form. 35/3600 useless extension candidates. Maximal degree in co-relation 5952. Up to 2334 conditions per place. [2024-11-22 13:50:53,152 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 51 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-11-22 13:50:53,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 299 flow [2024-11-22 13:50:53,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:50:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:50:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-22 13:50:53,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2024-11-22 13:50:53,156 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 132 flow. Second operand 3 states and 112 transitions. [2024-11-22 13:50:53,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 299 flow [2024-11-22 13:50:53,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:50:53,161 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 144 flow [2024-11-22 13:50:53,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=130, 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=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2024-11-22 13:50:53,162 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-11-22 13:50:53,163 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 144 flow [2024-11-22 13:50:53,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:53,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:50:53,163 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:50:53,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:50:53,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:50:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:50:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1573378156, now seen corresponding path program 1 times [2024-11-22 13:50:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:50:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862653316] [2024-11-22 13:50:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:50:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:50:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:50:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862653316] [2024-11-22 13:50:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862653316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:50:53,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:50:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:50:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662676857] [2024-11-22 13:50:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:50:53,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:50:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:50:53,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:50:53,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:50:53,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:50:53,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:53,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:50:53,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:50:53,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:50:53,835 INFO L124 PetriNetUnfolderBase]: 2795/4444 cut-off events. [2024-11-22 13:50:53,836 INFO L125 PetriNetUnfolderBase]: For 2274/2274 co-relation queries the response was YES. [2024-11-22 13:50:53,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10251 conditions, 4444 events. 2795/4444 cut-off events. For 2274/2274 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29407 event pairs, 2080 based on Foata normal form. 94/4053 useless extension candidates. Maximal degree in co-relation 4768. Up to 3079 conditions per place. [2024-11-22 13:50:53,868 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 58 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-22 13:50:53,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 347 flow [2024-11-22 13:50:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:50:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:50:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-11-22 13:50:53,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2024-11-22 13:50:53,874 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 144 flow. Second operand 5 states and 162 transitions. [2024-11-22 13:50:53,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 347 flow [2024-11-22 13:50:53,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:50:53,878 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 170 flow [2024-11-22 13:50:53,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-11-22 13:50:53,879 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-11-22 13:50:53,880 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 170 flow [2024-11-22 13:50:53,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:53,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:50:53,881 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:50:53,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:50:53,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:50:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:50:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 29395084, now seen corresponding path program 1 times [2024-11-22 13:50:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:50:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536110319] [2024-11-22 13:50:53,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:50:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:50:54,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:50:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536110319] [2024-11-22 13:50:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536110319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:50:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:50:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:50:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160941771] [2024-11-22 13:50:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:50:54,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:50:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:50:54,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:50:54,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:50:54,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:50:54,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:54,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:50:54,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:50:54,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:50:54,680 INFO L124 PetriNetUnfolderBase]: 3459/5671 cut-off events. [2024-11-22 13:50:54,681 INFO L125 PetriNetUnfolderBase]: For 2903/2903 co-relation queries the response was YES. [2024-11-22 13:50:54,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12804 conditions, 5671 events. 3459/5671 cut-off events. For 2903/2903 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 40579 event pairs, 2644 based on Foata normal form. 131/5188 useless extension candidates. Maximal degree in co-relation 10447. Up to 3845 conditions per place. [2024-11-22 13:50:54,719 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 59 selfloop transitions, 6 changer transitions 2/84 dead transitions. [2024-11-22 13:50:54,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 400 flow [2024-11-22 13:50:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:50:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:50:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-11-22 13:50:54,721 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2024-11-22 13:50:54,722 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 170 flow. Second operand 5 states and 162 transitions. [2024-11-22 13:50:54,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 400 flow [2024-11-22 13:50:54,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 396 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-22 13:50:54,728 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 209 flow [2024-11-22 13:50:54,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-11-22 13:50:54,729 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-11-22 13:50:54,731 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 209 flow [2024-11-22 13:50:54,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:54,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:50:54,732 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:50:54,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:50:54,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:50:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:50:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1852658935, now seen corresponding path program 1 times [2024-11-22 13:50:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:50:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705793419] [2024-11-22 13:50:54,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:50:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:50:55,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:50:55,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705793419] [2024-11-22 13:50:55,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705793419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:50:55,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:50:55,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:50:55,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658726319] [2024-11-22 13:50:55,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:50:55,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:50:55,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:50:55,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:50:55,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:50:55,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-11-22 13:50:55,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:55,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:50:55,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-11-22 13:50:55,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:50:56,810 INFO L124 PetriNetUnfolderBase]: 8319/13428 cut-off events. [2024-11-22 13:50:56,810 INFO L125 PetriNetUnfolderBase]: For 5838/5855 co-relation queries the response was YES. [2024-11-22 13:50:56,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30064 conditions, 13428 events. 8319/13428 cut-off events. For 5838/5855 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 101177 event pairs, 3756 based on Foata normal form. 0/12312 useless extension candidates. Maximal degree in co-relation 22628. Up to 4773 conditions per place. [2024-11-22 13:50:56,884 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 100 selfloop transitions, 9 changer transitions 1/124 dead transitions. [2024-11-22 13:50:56,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 124 transitions, 645 flow [2024-11-22 13:50:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:50:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:50:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-11-22 13:50:56,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2024-11-22 13:50:56,886 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 209 flow. Second operand 6 states and 201 transitions. [2024-11-22 13:50:56,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 124 transitions, 645 flow [2024-11-22 13:50:56,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 638 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-22 13:50:56,891 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 262 flow [2024-11-22 13:50:56,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-11-22 13:50:56,892 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-11-22 13:50:56,892 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 262 flow [2024-11-22 13:50:56,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:56,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:50:56,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:50:56,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:50:56,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:50:56,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:50:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash -655930463, now seen corresponding path program 1 times [2024-11-22 13:50:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:50:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707488482] [2024-11-22 13:50:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:56,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:50:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:50:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:50:57,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707488482] [2024-11-22 13:50:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707488482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:50:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:50:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:50:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974478670] [2024-11-22 13:50:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:50:57,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:50:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:50:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:50:57,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:50:57,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-11-22 13:50:57,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:57,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:50:57,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-11-22 13:50:57,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:50:58,816 INFO L124 PetriNetUnfolderBase]: 8713/13222 cut-off events. [2024-11-22 13:50:58,816 INFO L125 PetriNetUnfolderBase]: For 6911/7127 co-relation queries the response was YES. [2024-11-22 13:50:58,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31780 conditions, 13222 events. 8713/13222 cut-off events. For 6911/7127 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 92573 event pairs, 3825 based on Foata normal form. 0/11912 useless extension candidates. Maximal degree in co-relation 26763. Up to 5905 conditions per place. [2024-11-22 13:50:58,900 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 63 selfloop transitions, 6 changer transitions 29/112 dead transitions. [2024-11-22 13:50:58,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 602 flow [2024-11-22 13:50:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:50:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:50:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-11-22 13:50:58,902 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6121794871794872 [2024-11-22 13:50:58,902 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 262 flow. Second operand 6 states and 191 transitions. [2024-11-22 13:50:58,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 602 flow [2024-11-22 13:50:58,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 591 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-22 13:50:58,907 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 250 flow [2024-11-22 13:50:58,907 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-11-22 13:50:58,908 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-11-22 13:50:58,908 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 250 flow [2024-11-22 13:50:58,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:58,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:50:58,908 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:50:58,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:50:58,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:50:58,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:50:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1960680660, now seen corresponding path program 1 times [2024-11-22 13:50:58,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:50:58,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293628171] [2024-11-22 13:50:58,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:58,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:50:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:50:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:50:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293628171] [2024-11-22 13:50:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293628171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:50:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669470457] [2024-11-22 13:50:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:50:59,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:50:59,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:50:59,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:50:59,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:50:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:50:59,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 13:50:59,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:50:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:50:59,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:50:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:50:59,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669470457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:50:59,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:50:59,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2024-11-22 13:50:59,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130186347] [2024-11-22 13:50:59,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:50:59,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 13:50:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:50:59,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 13:50:59,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-22 13:50:59,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-11-22 13:50:59,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 250 flow. Second operand has 17 states, 17 states have (on average 21.529411764705884) internal successors, (366), 17 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:50:59,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:50:59,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-11-22 13:50:59,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:02,036 INFO L124 PetriNetUnfolderBase]: 11916/17554 cut-off events. [2024-11-22 13:51:02,036 INFO L125 PetriNetUnfolderBase]: For 9682/9682 co-relation queries the response was YES. [2024-11-22 13:51:02,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44269 conditions, 17554 events. 11916/17554 cut-off events. For 9682/9682 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 121240 event pairs, 949 based on Foata normal form. 0/17013 useless extension candidates. Maximal degree in co-relation 39905. Up to 4001 conditions per place. [2024-11-22 13:51:02,158 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 142 selfloop transitions, 18 changer transitions 8/182 dead transitions. [2024-11-22 13:51:02,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 182 transitions, 1022 flow [2024-11-22 13:51:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:51:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 13:51:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 354 transitions. [2024-11-22 13:51:02,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2024-11-22 13:51:02,161 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 250 flow. Second operand 12 states and 354 transitions. [2024-11-22 13:51:02,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 182 transitions, 1022 flow [2024-11-22 13:51:02,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 182 transitions, 1001 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-22 13:51:02,186 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 305 flow [2024-11-22 13:51:02,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=305, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2024-11-22 13:51:02,187 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2024-11-22 13:51:02,187 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 305 flow [2024-11-22 13:51:02,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.529411764705884) internal successors, (366), 17 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:02,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:02,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:02,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 13:51:02,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:51:02,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:51:02,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash -833904744, now seen corresponding path program 2 times [2024-11-22 13:51:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:02,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709076709] [2024-11-22 13:51:02,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:51:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:02,425 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:51:02,428 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:51:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 13:51:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:02,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709076709] [2024-11-22 13:51:02,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709076709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:02,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:02,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:51:02,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505421987] [2024-11-22 13:51:02,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:51:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:02,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:51:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:51:02,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 52 [2024-11-22 13:51:02,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:02,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:02,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 52 [2024-11-22 13:51:02,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:04,610 INFO L124 PetriNetUnfolderBase]: 12454/17738 cut-off events. [2024-11-22 13:51:04,611 INFO L125 PetriNetUnfolderBase]: For 15831/16165 co-relation queries the response was YES. [2024-11-22 13:51:04,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49737 conditions, 17738 events. 12454/17738 cut-off events. For 15831/16165 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 114319 event pairs, 2100 based on Foata normal form. 0/16243 useless extension candidates. Maximal degree in co-relation 49702. Up to 15719 conditions per place. [2024-11-22 13:51:04,751 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 89 selfloop transitions, 10 changer transitions 17/133 dead transitions. [2024-11-22 13:51:04,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 133 transitions, 785 flow [2024-11-22 13:51:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:51:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:51:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-11-22 13:51:04,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2024-11-22 13:51:04,754 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 305 flow. Second operand 6 states and 188 transitions. [2024-11-22 13:51:04,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 133 transitions, 785 flow [2024-11-22 13:51:04,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 133 transitions, 734 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-11-22 13:51:04,793 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 365 flow [2024-11-22 13:51:04,794 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2024-11-22 13:51:04,795 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2024-11-22 13:51:04,796 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 365 flow [2024-11-22 13:51:04,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:04,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:04,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:04,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:51:04,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:51:04,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1226631370, now seen corresponding path program 3 times [2024-11-22 13:51:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:04,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656416002] [2024-11-22 13:51:04,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:51:04,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:04,880 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 13:51:04,880 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:51:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:51:05,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656416002] [2024-11-22 13:51:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656416002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:51:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636854984] [2024-11-22 13:51:05,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:51:05,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:51:05,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:51:05,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:51:05,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:51:05,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 13:51:05,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:51:05,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 13:51:05,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:51:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:51:05,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:51:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:51:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636854984] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:51:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:51:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 6] total 17 [2024-11-22 13:51:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069244871] [2024-11-22 13:51:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:05,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:51:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:05,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:51:05,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-22 13:51:05,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-11-22 13:51:05,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 365 flow. Second operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:05,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:05,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-11-22 13:51:05,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:10,448 INFO L124 PetriNetUnfolderBase]: 32993/48804 cut-off events. [2024-11-22 13:51:10,448 INFO L125 PetriNetUnfolderBase]: For 48828/49284 co-relation queries the response was YES. [2024-11-22 13:51:10,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139189 conditions, 48804 events. 32993/48804 cut-off events. For 48828/49284 co-relation queries the response was YES. Maximal size of possible extension queue 2003. Compared 361554 event pairs, 3311 based on Foata normal form. 660/46420 useless extension candidates. Maximal degree in co-relation 139153. Up to 13638 conditions per place. [2024-11-22 13:51:10,832 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 235 selfloop transitions, 41 changer transitions 0/288 dead transitions. [2024-11-22 13:51:10,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 288 transitions, 1843 flow [2024-11-22 13:51:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 13:51:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 13:51:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 353 transitions. [2024-11-22 13:51:10,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6171328671328671 [2024-11-22 13:51:10,834 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 365 flow. Second operand 11 states and 353 transitions. [2024-11-22 13:51:10,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 288 transitions, 1843 flow [2024-11-22 13:51:10,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 288 transitions, 1841 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-22 13:51:10,907 INFO L231 Difference]: Finished difference. Result has 99 places, 110 transitions, 724 flow [2024-11-22 13:51:10,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=724, PETRI_PLACES=99, PETRI_TRANSITIONS=110} [2024-11-22 13:51:10,908 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-11-22 13:51:10,908 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 110 transitions, 724 flow [2024-11-22 13:51:10,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:10,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:10,909 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:10,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 13:51:11,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 13:51:11,114 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:51:11,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:11,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1775729686, now seen corresponding path program 4 times [2024-11-22 13:51:11,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:11,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21414008] [2024-11-22 13:51:11,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:51:11,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:11,150 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:51:11,151 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:51:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 13:51:11,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21414008] [2024-11-22 13:51:11,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21414008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:11,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:11,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:51:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468238946] [2024-11-22 13:51:11,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:11,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:51:11,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:51:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:51:11,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 52 [2024-11-22 13:51:11,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 110 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:11,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:11,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 52 [2024-11-22 13:51:11,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:16,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), 44#L148-4true, Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L63true, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:16,762 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:51:16,762 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 13:51:16,762 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 13:51:16,762 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-22 13:51:17,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), 44#L148-4true, Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9#thread1EXITtrue, Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,047 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:51:17,047 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,047 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,047 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), 44#L148-4true, Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, 6#L52true, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,149 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:51:17,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L63true, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, 17#L149true, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,303 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:51:17,303 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,303 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,303 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,303 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L63true, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, 17#L149true, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,303 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:51:17,303 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,303 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,303 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:51:17,304 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:51:17,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9#thread1EXITtrue, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, 17#L149true, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,339 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,339 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,339 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,339 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,363 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9#thread1EXITtrue, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, 17#L149true, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,363 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,363 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,363 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,363 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,363 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, 6#L52true, 17#L149true, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,443 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,443 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,443 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,443 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 49#L86true, 656#true, 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, 17#L149true, Black: 105#(= ~j~0 0), Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 28#L57true]) [2024-11-22 13:51:17,514 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,514 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,514 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,514 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,517 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, 6#L52true, 17#L149true, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,517 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,517 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,517 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,517 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:51:17,517 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:17,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 46#L149-1true, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,857 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:51:17,857 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:51:17,857 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:51:17,857 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:51:17,884 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][121], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, 373#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), 105#(= ~j~0 0), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 46#L149-1true, Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, Black: 114#true, 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 663#(and (or (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1))) (<= ~j~0 ~i~0))]) [2024-11-22 13:51:17,885 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:51:17,885 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:51:17,885 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:17,885 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:51:17,885 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:51:18,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 49#L86true, Black: 85#(<= ~n2~0 0), 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 656#true, Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9#thread1EXITtrue, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, Black: 105#(= ~j~0 0), 17#L149true, Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,024 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-22 13:51:18,025 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:51:18,025 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:51:18,025 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:51:18,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 49#L86true, 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 656#true, Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, 6#L52true, Black: 105#(= ~j~0 0), 17#L149true, Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,026 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-22 13:51:18,026 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:51:18,026 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:51:18,026 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:51:18,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 656#true, Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, 40#thread2EXITtrue, 17#L149true, Black: 105#(= ~j~0 0), Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 28#L57true]) [2024-11-22 13:51:18,048 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,048 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,048 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,048 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 656#true, 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9#thread1EXITtrue, Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, Black: 105#(= ~j~0 0), 17#L149true, 40#thread2EXITtrue, Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,273 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-22 13:51:18,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), 656#true, 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, 6#L52true, Black: 105#(= ~j~0 0), 17#L149true, 40#thread2EXITtrue, Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,274 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-22 13:51:18,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 49#L86true, Black: 85#(<= ~n2~0 0), 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 656#true, Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 46#L149-1true, Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, Black: 105#(= ~j~0 0), Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,275 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-22 13:51:18,275 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,275 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,275 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:51:18,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 656#true, 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, 17#L149true, Black: 105#(= ~j~0 0), Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 28#L57true]) [2024-11-22 13:51:18,278 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,278 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,278 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,278 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), 656#true, 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 9#thread1EXITtrue, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, Black: 105#(= ~j~0 0), 17#L149true, Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,437 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-22 13:51:18,437 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,437 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,437 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 656#true, Black: 85#(<= ~n2~0 0), 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, 6#L52true, Black: 105#(= ~j~0 0), 17#L149true, Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,439 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-22 13:51:18,439 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,439 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,439 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), 656#true, Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 46#L149-1true, Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, Black: 105#(= ~j~0 0), 40#thread2EXITtrue, Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,440 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-22 13:51:18,440 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,440 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,440 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:51:18,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), 30#L80true, Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), 656#true, 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 85#(<= ~n2~0 0), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 46#L149-1true, Black: 93#(= ~i~0 0), 29#L115true, Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 16#thread3EXITtrue, Black: 105#(= ~j~0 0), Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,528 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-11-22 13:51:18,528 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,528 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,528 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([995] L104-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_1| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_1| 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_1|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_5|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base][222], [Black: 63#(= ~total~0 0), Black: 381#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 67#(<= ~q1_back~0 ~q1_front~0), Black: 383#(and (= ~j~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (= ~i~0 0) (<= ~N~0 0)), Black: 375#(and (= ~j~0 0) (= ~i~0 0)), Black: 645#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 71#(= ~q2_back~0 ~q2_front~0), Black: 390#true, Black: 585#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 373#true, Black: 555#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 643#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 559#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), Black: 641#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0)), Black: 75#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 85#(<= ~n2~0 0), 656#true, 647#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~j~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)))), Black: 84#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 22#L150true, Black: 87#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 93#(= ~i~0 0), Black: 94#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 29#L115true, 16#thread3EXITtrue, Black: 105#(= ~j~0 0), Black: 114#true, 303#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))]) [2024-11-22 13:51:18,529 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-11-22 13:51:18,529 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,529 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,530 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-22 13:51:18,633 INFO L124 PetriNetUnfolderBase]: 42270/62200 cut-off events. [2024-11-22 13:51:18,633 INFO L125 PetriNetUnfolderBase]: For 207642/213514 co-relation queries the response was YES. [2024-11-22 13:51:19,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232884 conditions, 62200 events. 42270/62200 cut-off events. For 207642/213514 co-relation queries the response was YES. Maximal size of possible extension queue 3096. Compared 479972 event pairs, 3266 based on Foata normal form. 2742/60655 useless extension candidates. Maximal degree in co-relation 232839. Up to 23412 conditions per place. [2024-11-22 13:51:19,449 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 216 selfloop transitions, 31 changer transitions 2/273 dead transitions. [2024-11-22 13:51:19,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 273 transitions, 2224 flow [2024-11-22 13:51:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:51:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 13:51:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 267 transitions. [2024-11-22 13:51:19,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6418269230769231 [2024-11-22 13:51:19,451 INFO L175 Difference]: Start difference. First operand has 99 places, 110 transitions, 724 flow. Second operand 8 states and 267 transitions. [2024-11-22 13:51:19,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 273 transitions, 2224 flow [2024-11-22 13:51:20,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 273 transitions, 2184 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-22 13:51:20,176 INFO L231 Difference]: Finished difference. Result has 108 places, 132 transitions, 987 flow [2024-11-22 13:51:20,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=987, PETRI_PLACES=108, PETRI_TRANSITIONS=132} [2024-11-22 13:51:20,177 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 55 predicate places. [2024-11-22 13:51:20,177 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 132 transitions, 987 flow [2024-11-22 13:51:20,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:20,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:20,177 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:20,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:51:20,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:51:20,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1748471998, now seen corresponding path program 5 times [2024-11-22 13:51:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803783855] [2024-11-22 13:51:20,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 13:51:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:20,214 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-22 13:51:20,214 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:51:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:51:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803783855] [2024-11-22 13:51:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803783855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:51:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706584774] [2024-11-22 13:51:20,375 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 13:51:20,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:51:20,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:51:20,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:51:20,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:51:20,490 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-22 13:51:20,490 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:51:20,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 13:51:20,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:51:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:51:20,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:51:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:51:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706584774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:51:20,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:51:20,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2024-11-22 13:51:20,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347351590] [2024-11-22 13:51:20,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:51:20,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 13:51:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:20,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 13:51:20,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-22 13:51:20,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 52 [2024-11-22 13:51:20,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 132 transitions, 987 flow. Second operand has 15 states, 15 states have (on average 19.266666666666666) internal successors, (289), 15 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:20,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:20,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 52 [2024-11-22 13:51:20,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:33,476 INFO L124 PetriNetUnfolderBase]: 75168/110008 cut-off events. [2024-11-22 13:51:33,476 INFO L125 PetriNetUnfolderBase]: For 366774/372061 co-relation queries the response was YES. [2024-11-22 13:51:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441383 conditions, 110008 events. 75168/110008 cut-off events. For 366774/372061 co-relation queries the response was YES. Maximal size of possible extension queue 4883. Compared 884708 event pairs, 9045 based on Foata normal form. 9892/118038 useless extension candidates. Maximal degree in co-relation 441333. Up to 24506 conditions per place. [2024-11-22 13:51:34,854 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 287 selfloop transitions, 100 changer transitions 34/436 dead transitions. [2024-11-22 13:51:34,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 436 transitions, 3917 flow [2024-11-22 13:51:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 13:51:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-22 13:51:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2024-11-22 13:51:34,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2024-11-22 13:51:34,856 INFO L175 Difference]: Start difference. First operand has 108 places, 132 transitions, 987 flow. Second operand 15 states and 425 transitions. [2024-11-22 13:51:34,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 436 transitions, 3917 flow [2024-11-22 13:51:36,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 436 transitions, 3783 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-11-22 13:51:36,689 INFO L231 Difference]: Finished difference. Result has 128 places, 198 transitions, 1952 flow [2024-11-22 13:51:36,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1952, PETRI_PLACES=128, PETRI_TRANSITIONS=198} [2024-11-22 13:51:36,690 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 75 predicate places. [2024-11-22 13:51:36,690 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 198 transitions, 1952 flow [2024-11-22 13:51:36,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.266666666666666) internal successors, (289), 15 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:36,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:36,691 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:36,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 13:51:36,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:51:36,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 13:51:36,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:36,896 INFO L85 PathProgramCache]: Analyzing trace with hash 420449030, now seen corresponding path program 1 times [2024-11-22 13:51:36,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898403441] [2024-11-22 13:51:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 13:51:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898403441] [2024-11-22 13:51:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898403441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:51:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782249712] [2024-11-22 13:51:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:37,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:51:37,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:37,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:51:37,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:51:37,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2024-11-22 13:51:37,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 198 transitions, 1952 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:37,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:37,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2024-11-22 13:51:37,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand