./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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 ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:43:36,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:43:36,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:43:36,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:43:36,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:43:36,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:43:36,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:43:36,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:43:36,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:43:36,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:43:36,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:43:36,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:43:36,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:43:36,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:43:36,739 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:43:36,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:43:36,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:43:36,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:43:36,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:43:36,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:43:36,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:43:36,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:43:36,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:43:36,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:43:36,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:43:36,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:43:36,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:43:36,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:43:36,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:43:36,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:43:36,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:43:36,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:43:36,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:43:36,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:43:36,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:43:36,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:43:36,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:43:36,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:43:36,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:43:36,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:43:36,746 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:43:36,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:43:36,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:43:36,746 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2024-01-27 15:43:36,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:43:36,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:43:36,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:43:36,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:43:36,977 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:43:36,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-01-27 15:43:38,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:43:38,202 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:43:38,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-01-27 15:43:38,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21634b42d/ff3bdd4535464abc8d83a52bb064ab02/FLAG98c7794fc [2024-01-27 15:43:38,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21634b42d/ff3bdd4535464abc8d83a52bb064ab02 [2024-01-27 15:43:38,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:43:38,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:43:38,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:43:38,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:43:38,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:43:38,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b319a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38, skipping insertion in model container [2024-01-27 15:43:38,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,245 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:43:38,382 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-01-27 15:43:38,389 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:43:38,395 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:43:38,414 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-01-27 15:43:38,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:43:38,433 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:43:38,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38 WrapperNode [2024-01-27 15:43:38,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:43:38,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:43:38,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:43:38,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:43:38,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,475 INFO L138 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 360 [2024-01-27 15:43:38,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:43:38,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:43:38,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:43:38,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:43:38,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,508 INFO L175 MemorySlicer]: Split 20 memory accesses to 6 slices as follows [2, 2, 2, 2, 10, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 1, 1, 3, 1]. [2024-01-27 15:43:38,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:43:38,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:43:38,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:43:38,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:43:38,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (1/1) ... [2024-01-27 15:43:38,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:43:38,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:38,585 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-01-27 15:43:38,602 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-01-27 15:43:38,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:43:38,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:43:38,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:43:38,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:43:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:43:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:43:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:43:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 15:43:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:43:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:43:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:43:38,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:43:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:43:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 15:43:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:43:38,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:43:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:43:38,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:43:38,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:43:38,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:43:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-27 15:43:38,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-27 15:43:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:43:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:43:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:43:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:43:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:43:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 15:43:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:43:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:43:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:43:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:43:38,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:43:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:43:38,633 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:43:38,730 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:43:38,732 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:43:39,048 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:43:39,048 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:43:39,363 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:43:39,364 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-01-27 15:43:39,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:43:39 BoogieIcfgContainer [2024-01-27 15:43:39,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:43:39,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:43:39,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:43:39,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:43:39,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:43:38" (1/3) ... [2024-01-27 15:43:39,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f770e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:43:39, skipping insertion in model container [2024-01-27 15:43:39,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:38" (2/3) ... [2024-01-27 15:43:39,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f770e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:43:39, skipping insertion in model container [2024-01-27 15:43:39,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:43:39" (3/3) ... [2024-01-27 15:43:39,371 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-01-27 15:43:39,378 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:43:39,386 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:43:39,386 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:43:39,386 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:43:39,435 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 15:43:39,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 134 flow [2024-01-27 15:43:39,505 INFO L124 PetriNetUnfolderBase]: 7/49 cut-off events. [2024-01-27 15:43:39,505 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:43:39,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 49 events. 7/49 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-01-27 15:43:39,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 53 transitions, 134 flow [2024-01-27 15:43:39,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 48 transitions, 120 flow [2024-01-27 15:43:39,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:43:39,524 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@1b40cac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:43:39,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-27 15:43:39,540 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:43:39,540 INFO L124 PetriNetUnfolderBase]: 7/47 cut-off events. [2024-01-27 15:43:39,541 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:43:39,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:39,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:39,542 INFO L420 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-01-27 15:43:39,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash -48283842, now seen corresponding path program 1 times [2024-01-27 15:43:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:39,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462722403] [2024-01-27 15:43:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:39,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:39,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:39,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462722403] [2024-01-27 15:43:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462722403] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:39,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:39,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:43:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555111537] [2024-01-27 15:43:39,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:39,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:43:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:40,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:43:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:43:40,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:43:40,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-01-27 15:43:40,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:40,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:43:40,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:40,369 INFO L124 PetriNetUnfolderBase]: 1172/1991 cut-off events. [2024-01-27 15:43:40,369 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-01-27 15:43:40,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 1991 events. 1172/1991 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 12040 event pairs, 277 based on Foata normal form. 1/1888 useless extension candidates. Maximal degree in co-relation 2793. Up to 1141 conditions per place. [2024-01-27 15:43:40,386 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 45 selfloop transitions, 3 changer transitions 1/66 dead transitions. [2024-01-27 15:43:40,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 269 flow [2024-01-27 15:43:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:43:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:43:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-01-27 15:43:40,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2024-01-27 15:43:40,399 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 120 flow. Second operand 3 states and 113 transitions. [2024-01-27 15:43:40,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 269 flow [2024-01-27 15:43:40,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-27 15:43:40,410 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 123 flow [2024-01-27 15:43:40,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2024-01-27 15:43:40,416 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2024-01-27 15:43:40,417 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 123 flow [2024-01-27 15:43:40,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-01-27 15:43:40,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:40,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:40,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:43:40,418 INFO L420 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-01-27 15:43:40,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -380142321, now seen corresponding path program 1 times [2024-01-27 15:43:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526830027] [2024-01-27 15:43:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526830027] [2024-01-27 15:43:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526830027] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:43:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186389104] [2024-01-27 15:43:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:40,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:43:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:43:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:43:40,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:43:40,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-27 15:43:40,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:40,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:43:40,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:40,877 INFO L124 PetriNetUnfolderBase]: 1414/2255 cut-off events. [2024-01-27 15:43:40,877 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2024-01-27 15:43:40,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4789 conditions, 2255 events. 1414/2255 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13100 event pairs, 441 based on Foata normal form. 80/2227 useless extension candidates. Maximal degree in co-relation 1628. Up to 1326 conditions per place. [2024-01-27 15:43:40,893 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 54 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-01-27 15:43:40,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 295 flow [2024-01-27 15:43:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:43:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:43:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-01-27 15:43:40,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7358490566037735 [2024-01-27 15:43:40,900 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 123 flow. Second operand 3 states and 117 transitions. [2024-01-27 15:43:40,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 295 flow [2024-01-27 15:43:40,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:43:40,904 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 134 flow [2024-01-27 15:43:40,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=134, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2024-01-27 15:43:40,905 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2024-01-27 15:43:40,911 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 134 flow [2024-01-27 15:43:40,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-27 15:43:40,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:40,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:40,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:43:40,912 INFO L420 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-01-27 15:43:40,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash 639341897, now seen corresponding path program 1 times [2024-01-27 15:43:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:40,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810478061] [2024-01-27 15:43:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:41,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:41,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810478061] [2024-01-27 15:43:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810478061] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:43:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282056180] [2024-01-27 15:43:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:41,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:43:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:41,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:43:41,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:43:41,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:43:41,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-27 15:43:41,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:41,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:43:41,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:41,277 INFO L124 PetriNetUnfolderBase]: 1670/2734 cut-off events. [2024-01-27 15:43:41,277 INFO L125 PetriNetUnfolderBase]: For 1018/1018 co-relation queries the response was YES. [2024-01-27 15:43:41,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5917 conditions, 2734 events. 1670/2734 cut-off events. For 1018/1018 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16179 event pairs, 475 based on Foata normal form. 42/2668 useless extension candidates. Maximal degree in co-relation 3944. Up to 1541 conditions per place. [2024-01-27 15:43:41,291 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 54 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-01-27 15:43:41,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 311 flow [2024-01-27 15:43:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:43:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:43:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-01-27 15:43:41,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7232704402515723 [2024-01-27 15:43:41,292 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 134 flow. Second operand 3 states and 115 transitions. [2024-01-27 15:43:41,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 311 flow [2024-01-27 15:43:41,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:43:41,294 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 146 flow [2024-01-27 15:43:41,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2024-01-27 15:43:41,295 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2024-01-27 15:43:41,295 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 146 flow [2024-01-27 15:43:41,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-27 15:43:41,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:41,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:41,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:43:41,296 INFO L420 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-01-27 15:43:41,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1398557744, now seen corresponding path program 1 times [2024-01-27 15:43:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:41,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86537058] [2024-01-27 15:43:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:43:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86537058] [2024-01-27 15:43:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86537058] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:41,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:41,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:43:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332426952] [2024-01-27 15:43:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:41,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:43:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:43:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:43:41,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:43:41,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:43:41,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:41,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:43:41,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:41,816 INFO L124 PetriNetUnfolderBase]: 2091/3323 cut-off events. [2024-01-27 15:43:41,816 INFO L125 PetriNetUnfolderBase]: For 1728/1728 co-relation queries the response was YES. [2024-01-27 15:43:41,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 3323 events. 2091/3323 cut-off events. For 1728/1728 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 20856 event pairs, 1508 based on Foata normal form. 71/3100 useless extension candidates. Maximal degree in co-relation 3898. Up to 2239 conditions per place. [2024-01-27 15:43:41,832 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 62 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2024-01-27 15:43:41,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 375 flow [2024-01-27 15:43:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:43:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:43:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-01-27 15:43:41,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6377358490566037 [2024-01-27 15:43:41,836 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 146 flow. Second operand 5 states and 169 transitions. [2024-01-27 15:43:41,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 375 flow [2024-01-27 15:43:41,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:43:41,839 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 196 flow [2024-01-27 15:43:41,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2024-01-27 15:43:41,841 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2024-01-27 15:43:41,841 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 196 flow [2024-01-27 15:43:41,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:43:41,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:41,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:41,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:43:41,842 INFO L420 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-01-27 15:43:41,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 821781624, now seen corresponding path program 1 times [2024-01-27 15:43:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004357174] [2024-01-27 15:43:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:43:41,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004357174] [2024-01-27 15:43:41,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004357174] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:41,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:41,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:43:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502441311] [2024-01-27 15:43:41,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:41,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:43:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:41,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:43:41,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:43:41,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:43:41,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:43:41,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:41,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:43:41,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:42,369 INFO L124 PetriNetUnfolderBase]: 2705/4455 cut-off events. [2024-01-27 15:43:42,369 INFO L125 PetriNetUnfolderBase]: For 2300/2300 co-relation queries the response was YES. [2024-01-27 15:43:42,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10211 conditions, 4455 events. 2705/4455 cut-off events. For 2300/2300 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 30430 event pairs, 2030 based on Foata normal form. 122/4199 useless extension candidates. Maximal degree in co-relation 7918. Up to 2952 conditions per place. [2024-01-27 15:43:42,388 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 64 selfloop transitions, 5 changer transitions 2/88 dead transitions. [2024-01-27 15:43:42,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 438 flow [2024-01-27 15:43:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:43:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:43:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-01-27 15:43:42,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6698113207547169 [2024-01-27 15:43:42,389 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 196 flow. Second operand 4 states and 142 transitions. [2024-01-27 15:43:42,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 438 flow [2024-01-27 15:43:42,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 434 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:43:42,392 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 222 flow [2024-01-27 15:43:42,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2024-01-27 15:43:42,393 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2024-01-27 15:43:42,393 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 222 flow [2024-01-27 15:43:42,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:43:42,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:42,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:42,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:43:42,394 INFO L420 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-01-27 15:43:42,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash 677161735, now seen corresponding path program 1 times [2024-01-27 15:43:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172501546] [2024-01-27 15:43:42,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:43:42,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:42,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172501546] [2024-01-27 15:43:42,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172501546] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:42,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:42,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:43:42,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409897200] [2024-01-27 15:43:42,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:42,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:43:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:43:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:43:42,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-01-27 15:43:42,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-01-27 15:43:42,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:42,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-01-27 15:43:42,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:43,635 INFO L124 PetriNetUnfolderBase]: 7307/11443 cut-off events. [2024-01-27 15:43:43,636 INFO L125 PetriNetUnfolderBase]: For 5198/5326 co-relation queries the response was YES. [2024-01-27 15:43:43,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26208 conditions, 11443 events. 7307/11443 cut-off events. For 5198/5326 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 82594 event pairs, 3262 based on Foata normal form. 16/10454 useless extension candidates. Maximal degree in co-relation 20710. Up to 3879 conditions per place. [2024-01-27 15:43:43,674 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 99 selfloop transitions, 9 changer transitions 1/123 dead transitions. [2024-01-27 15:43:43,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 123 transitions, 633 flow [2024-01-27 15:43:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:43:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:43:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-01-27 15:43:43,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6320754716981132 [2024-01-27 15:43:43,676 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 222 flow. Second operand 6 states and 201 transitions. [2024-01-27 15:43:43,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 123 transitions, 633 flow [2024-01-27 15:43:43,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 123 transitions, 623 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-27 15:43:43,680 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 251 flow [2024-01-27 15:43:43,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2024-01-27 15:43:43,680 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2024-01-27 15:43:43,681 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 251 flow [2024-01-27 15:43:43,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-01-27 15:43:43,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:43,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:43,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:43:43,681 INFO L420 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-01-27 15:43:43,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:43,682 INFO L85 PathProgramCache]: Analyzing trace with hash -785979323, now seen corresponding path program 1 times [2024-01-27 15:43:43,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:43,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341511948] [2024-01-27 15:43:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:43:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:43,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341511948] [2024-01-27 15:43:43,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341511948] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:43,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:43:43,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329686395] [2024-01-27 15:43:43,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:43,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:43:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:43:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:43:43,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-01-27 15:43:43,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-01-27 15:43:43,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:43,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-01-27 15:43:43,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:44,773 INFO L124 PetriNetUnfolderBase]: 5145/8215 cut-off events. [2024-01-27 15:43:44,774 INFO L125 PetriNetUnfolderBase]: For 4375/4429 co-relation queries the response was YES. [2024-01-27 15:43:44,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19072 conditions, 8215 events. 5145/8215 cut-off events. For 4375/4429 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 57454 event pairs, 2232 based on Foata normal form. 6/7322 useless extension candidates. Maximal degree in co-relation 14913. Up to 3528 conditions per place. [2024-01-27 15:43:44,802 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 63 selfloop transitions, 7 changer transitions 32/116 dead transitions. [2024-01-27 15:43:44,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 597 flow [2024-01-27 15:43:44,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:43:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:43:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-01-27 15:43:44,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2024-01-27 15:43:44,803 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 251 flow. Second operand 6 states and 198 transitions. [2024-01-27 15:43:44,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 597 flow [2024-01-27 15:43:44,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 116 transitions, 587 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 15:43:44,807 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 247 flow [2024-01-27 15:43:44,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2024-01-27 15:43:44,808 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2024-01-27 15:43:44,808 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 247 flow [2024-01-27 15:43:44,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-01-27 15:43:44,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:44,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:44,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:43:44,809 INFO L420 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-01-27 15:43:44,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:44,809 INFO L85 PathProgramCache]: Analyzing trace with hash -350185970, now seen corresponding path program 1 times [2024-01-27 15:43:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470110724] [2024-01-27 15:43:44,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:43:44,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:44,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470110724] [2024-01-27 15:43:44,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470110724] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:44,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:44,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:43:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208806808] [2024-01-27 15:43:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:44,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:43:44,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:43:44,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:43:45,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-01-27 15:43:45,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-01-27 15:43:45,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:45,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-01-27 15:43:45,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:45,443 INFO L124 PetriNetUnfolderBase]: 2901/4657 cut-off events. [2024-01-27 15:43:45,443 INFO L125 PetriNetUnfolderBase]: For 3134/3134 co-relation queries the response was YES. [2024-01-27 15:43:45,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11430 conditions, 4657 events. 2901/4657 cut-off events. For 3134/3134 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 28626 event pairs, 586 based on Foata normal form. 208/4763 useless extension candidates. Maximal degree in co-relation 9676. Up to 2830 conditions per place. [2024-01-27 15:43:45,461 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 63 selfloop transitions, 6 changer transitions 4/88 dead transitions. [2024-01-27 15:43:45,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 483 flow [2024-01-27 15:43:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:43:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:43:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-01-27 15:43:45,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5471698113207547 [2024-01-27 15:43:45,462 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 247 flow. Second operand 6 states and 174 transitions. [2024-01-27 15:43:45,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 483 flow [2024-01-27 15:43:45,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 466 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-01-27 15:43:45,467 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 214 flow [2024-01-27 15:43:45,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-01-27 15:43:45,468 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places. [2024-01-27 15:43:45,468 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 214 flow [2024-01-27 15:43:45,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 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-01-27 15:43:45,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:45,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:45,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:43:45,469 INFO L420 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-01-27 15:43:45,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2137980652, now seen corresponding path program 1 times [2024-01-27 15:43:45,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:45,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713275503] [2024-01-27 15:43:45,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:45,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:43:45,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713275503] [2024-01-27 15:43:45,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713275503] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24169271] [2024-01-27 15:43:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:45,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:45,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:45,641 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-01-27 15:43:45,642 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-01-27 15:43:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:45,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:43:45,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:43:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:43:45,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:43:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:43:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24169271] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:43:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 16 [2024-01-27 15:43:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128082672] [2024-01-27 15:43:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:46,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:43:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:43:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-01-27 15:43:46,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-01-27 15:43:46,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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-01-27 15:43:46,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:46,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-01-27 15:43:46,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:47,282 INFO L124 PetriNetUnfolderBase]: 8188/11636 cut-off events. [2024-01-27 15:43:47,282 INFO L125 PetriNetUnfolderBase]: For 7364/7378 co-relation queries the response was YES. [2024-01-27 15:43:47,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29112 conditions, 11636 events. 8188/11636 cut-off events. For 7364/7378 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 70219 event pairs, 674 based on Foata normal form. 82/10778 useless extension candidates. Maximal degree in co-relation 29083. Up to 2508 conditions per place. [2024-01-27 15:43:47,326 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 158 selfloop transitions, 19 changer transitions 0/188 dead transitions. [2024-01-27 15:43:47,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 188 transitions, 1018 flow [2024-01-27 15:43:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 15:43:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 15:43:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions. [2024-01-27 15:43:47,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5754716981132075 [2024-01-27 15:43:47,328 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 214 flow. Second operand 10 states and 305 transitions. [2024-01-27 15:43:47,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 188 transitions, 1018 flow [2024-01-27 15:43:47,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 188 transitions, 971 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-01-27 15:43:47,335 INFO L231 Difference]: Finished difference. Result has 74 places, 72 transitions, 311 flow [2024-01-27 15:43:47,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=311, PETRI_PLACES=74, PETRI_TRANSITIONS=72} [2024-01-27 15:43:47,336 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2024-01-27 15:43:47,338 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 72 transitions, 311 flow [2024-01-27 15:43:47,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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-01-27 15:43:47,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:47,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:47,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 15:43:47,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:47,551 INFO L420 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-01-27 15:43:47,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1650621196, now seen corresponding path program 2 times [2024-01-27 15:43:47,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:47,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416247307] [2024-01-27 15:43:47,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:43:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416247307] [2024-01-27 15:43:47,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416247307] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323668042] [2024-01-27 15:43:47,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:43:47,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:47,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:47,784 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-01-27 15:43:47,798 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-01-27 15:43:47,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:43:47,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:43:47,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:43:47,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:43:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:43:48,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:43:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:43:48,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323668042] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:48,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:43:48,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 14 [2024-01-27 15:43:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841897794] [2024-01-27 15:43:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:48,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:43:48,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:48,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:43:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-01-27 15:43:48,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-01-27 15:43:48,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 72 transitions, 311 flow. Second operand has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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-01-27 15:43:48,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:48,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-01-27 15:43:48,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:49,539 INFO L124 PetriNetUnfolderBase]: 8134/11880 cut-off events. [2024-01-27 15:43:49,540 INFO L125 PetriNetUnfolderBase]: For 14131/14913 co-relation queries the response was YES. [2024-01-27 15:43:49,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34565 conditions, 11880 events. 8134/11880 cut-off events. For 14131/14913 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 72596 event pairs, 446 based on Foata normal form. 1314/12458 useless extension candidates. Maximal degree in co-relation 34535. Up to 3232 conditions per place. [2024-01-27 15:43:49,585 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 176 selfloop transitions, 35 changer transitions 1/225 dead transitions. [2024-01-27 15:43:49,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 225 transitions, 1235 flow [2024-01-27 15:43:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:43:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:43:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 412 transitions. [2024-01-27 15:43:49,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182389937106918 [2024-01-27 15:43:49,587 INFO L175 Difference]: Start difference. First operand has 74 places, 72 transitions, 311 flow. Second operand 15 states and 412 transitions. [2024-01-27 15:43:49,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 225 transitions, 1235 flow [2024-01-27 15:43:49,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 225 transitions, 1208 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-27 15:43:49,623 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 513 flow [2024-01-27 15:43:49,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=513, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2024-01-27 15:43:49,623 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 40 predicate places. [2024-01-27 15:43:49,623 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 513 flow [2024-01-27 15:43:49,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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-01-27 15:43:49,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:49,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:49,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:43:49,836 WARN L477 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-01-27 15:43:49,836 INFO L420 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-01-27 15:43:49,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash -35432096, now seen corresponding path program 1 times [2024-01-27 15:43:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:49,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730825584] [2024-01-27 15:43:49,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:43:50,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730825584] [2024-01-27 15:43:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730825584] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:50,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:50,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:43:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12845724] [2024-01-27 15:43:50,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:50,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:43:50,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:50,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:43:50,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:43:50,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-01-27 15:43:50,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-01-27 15:43:50,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:50,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-01-27 15:43:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:50,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][125], [30#L144-4true, Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 86#(<= ~n2~0 0), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 117#true, 43#L58true, 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-01-27 15:43:50,503 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:43:50,503 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:50,503 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:43:50,503 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-27 15:43:50,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][125], [30#L144-4true, Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 86#(<= ~n2~0 0), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:50,537 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-27 15:43:50,537 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:43:50,540 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:50,540 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:43:50,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][125], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 86#(<= ~n2~0 0), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 117#true, 43#L58true, 52#L145-1true, 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-01-27 15:43:50,550 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 15:43:50,550 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:43:50,550 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:43:50,550 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:50,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][113], [Black: 64#(= ~total~0 0), 30#L144-4true, 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 86#(<= ~n2~0 0), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 43#L58true, 383#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-01-27 15:43:50,551 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 15:43:50,551 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:43:50,551 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-27 15:43:50,551 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:50,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][125], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 86#(<= ~n2~0 0), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 52#L145-1true, 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:50,578 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:43:50,578 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:50,579 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:50,579 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:50,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][113], [30#L144-4true, Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 86#(<= ~n2~0 0), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:50,581 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:43:50,581 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:50,581 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:50,581 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:50,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][113], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 86#(<= ~n2~0 0), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 383#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), 43#L58true, 52#L145-1true, 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-01-27 15:43:50,585 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-27 15:43:50,585 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:50,585 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:43:50,585 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:43:50,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][113], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 86#(<= ~n2~0 0), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), 52#L145-1true, 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:50,607 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:43:50,607 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:50,607 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:50,608 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:50,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][125], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 86#(<= ~n2~0 0), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 40#L145-2true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-01-27 15:43:50,609 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:43:50,609 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:50,609 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:50,609 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:50,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][113], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 86#(<= ~n2~0 0), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), 5#L72true, 40#L145-2true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-01-27 15:43:50,627 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:43:50,627 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:50,627 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:50,627 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:50,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][125], [Black: 64#(= ~total~0 0), 18#L146-1true, 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 86#(<= ~n2~0 0), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-01-27 15:43:50,628 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:43:50,628 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:50,628 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:50,628 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:50,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][113], [Black: 64#(= ~total~0 0), 18#L146-1true, 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 86#(<= ~n2~0 0), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 391#true, Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 655#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-01-27 15:43:50,641 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-27 15:43:50,641 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:50,641 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:50,642 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:50,667 INFO L124 PetriNetUnfolderBase]: 3867/5997 cut-off events. [2024-01-27 15:43:50,667 INFO L125 PetriNetUnfolderBase]: For 17513/18151 co-relation queries the response was YES. [2024-01-27 15:43:50,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21089 conditions, 5997 events. 3867/5997 cut-off events. For 17513/18151 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 37392 event pairs, 1127 based on Foata normal form. 475/6225 useless extension candidates. Maximal degree in co-relation 21051. Up to 3207 conditions per place. [2024-01-27 15:43:50,708 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 101 selfloop transitions, 15 changer transitions 0/148 dead transitions. [2024-01-27 15:43:50,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 148 transitions, 1096 flow [2024-01-27 15:43:50,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:43:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:43:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2024-01-27 15:43:50,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5525606469002695 [2024-01-27 15:43:50,710 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 513 flow. Second operand 7 states and 205 transitions. [2024-01-27 15:43:50,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 148 transitions, 1096 flow [2024-01-27 15:43:50,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 148 transitions, 1056 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-01-27 15:43:50,771 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 599 flow [2024-01-27 15:43:50,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=599, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2024-01-27 15:43:50,771 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 45 predicate places. [2024-01-27 15:43:50,772 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 599 flow [2024-01-27 15:43:50,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-01-27 15:43:50,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:50,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:50,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 15:43:50,772 INFO L420 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-01-27 15:43:50,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash -123008356, now seen corresponding path program 1 times [2024-01-27 15:43:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:50,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643475174] [2024-01-27 15:43:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:43:50,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:50,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643475174] [2024-01-27 15:43:50,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643475174] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:50,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:43:50,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154548236] [2024-01-27 15:43:50,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:50,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:43:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:43:50,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:43:50,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-01-27 15:43:50,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 599 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-01-27 15:43:50,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:50,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-01-27 15:43:50,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:51,753 INFO L124 PetriNetUnfolderBase]: 5091/7821 cut-off events. [2024-01-27 15:43:51,753 INFO L125 PetriNetUnfolderBase]: For 23647/24421 co-relation queries the response was YES. [2024-01-27 15:43:51,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28254 conditions, 7821 events. 5091/7821 cut-off events. For 23647/24421 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 48505 event pairs, 655 based on Foata normal form. 611/8281 useless extension candidates. Maximal degree in co-relation 28213. Up to 4893 conditions per place. [2024-01-27 15:43:51,812 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 102 selfloop transitions, 13 changer transitions 0/149 dead transitions. [2024-01-27 15:43:51,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 149 transitions, 1126 flow [2024-01-27 15:43:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:43:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:43:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions. [2024-01-27 15:43:51,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5525606469002695 [2024-01-27 15:43:51,813 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 599 flow. Second operand 7 states and 205 transitions. [2024-01-27 15:43:51,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 149 transitions, 1126 flow [2024-01-27 15:43:51,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 149 transitions, 1081 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:43:51,917 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 637 flow [2024-01-27 15:43:51,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=637, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2024-01-27 15:43:51,918 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 47 predicate places. [2024-01-27 15:43:51,918 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 637 flow [2024-01-27 15:43:51,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-01-27 15:43:51,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:51,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:51,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 15:43:51,918 INFO L420 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-01-27 15:43:51,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2023728062, now seen corresponding path program 2 times [2024-01-27 15:43:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913367532] [2024-01-27 15:43:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:43:52,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913367532] [2024-01-27 15:43:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913367532] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:52,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387657077] [2024-01-27 15:43:52,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:43:52,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:52,065 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-01-27 15:43:52,066 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-01-27 15:43:52,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:43:52,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:43:52,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:43:52,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:43:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:43:52,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:43:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387657077] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:52,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:43:52,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-01-27 15:43:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20929175] [2024-01-27 15:43:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:52,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:43:52,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:43:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:43:52,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-01-27 15:43:52,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 637 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 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-01-27 15:43:52,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:52,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-01-27 15:43:52,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:52,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][140], [30#L144-4true, Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 686#true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 704#(<= ~q2_front~0 ~q2_back~0), 11#thread1EXITtrue]) [2024-01-27 15:43:52,887 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-27 15:43:52,887 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:52,887 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:43:52,887 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:43:52,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][140], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 686#true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 704#(<= ~q2_front~0 ~q2_back~0), 11#thread1EXITtrue]) [2024-01-27 15:43:52,956 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:43:52,956 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:52,956 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:52,956 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:52,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][142], [30#L144-4true, Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 686#true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 704#(<= ~q2_front~0 ~q2_back~0), 11#thread1EXITtrue]) [2024-01-27 15:43:52,959 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:43:52,959 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:52,959 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:52,959 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:43:53,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][142], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 686#true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 704#(<= ~q2_front~0 ~q2_back~0), 11#thread1EXITtrue]) [2024-01-27 15:43:53,035 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:43:53,035 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:53,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:53,035 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:53,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][140], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 686#true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 40#L145-2true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 704#(<= ~q2_front~0 ~q2_back~0)]) [2024-01-27 15:43:53,036 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:43:53,036 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:53,036 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:53,036 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:53,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][142], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 686#true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, 40#L145-2true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 704#(<= ~q2_front~0 ~q2_back~0)]) [2024-01-27 15:43:53,115 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:43:53,115 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:53,115 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:53,115 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:53,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][140], [Black: 64#(= ~total~0 0), 18#L146-1true, 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 686#true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 704#(<= ~q2_front~0 ~q2_back~0)]) [2024-01-27 15:43:53,116 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:43:53,116 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:53,116 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:53,116 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:53,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1025] L100-->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][142], [Black: 64#(= ~total~0 0), 18#L146-1true, 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 72#(= ~q2_back~0 ~q2_front~0), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 686#true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 704#(<= ~q2_front~0 ~q2_back~0)]) [2024-01-27 15:43:53,187 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-27 15:43:53,187 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:53,187 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:53,187 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:53,399 INFO L124 PetriNetUnfolderBase]: 7765/12055 cut-off events. [2024-01-27 15:43:53,399 INFO L125 PetriNetUnfolderBase]: For 36669/37150 co-relation queries the response was YES. [2024-01-27 15:43:53,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43523 conditions, 12055 events. 7765/12055 cut-off events. For 36669/37150 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 81425 event pairs, 1629 based on Foata normal form. 475/12232 useless extension candidates. Maximal degree in co-relation 43483. Up to 4021 conditions per place. [2024-01-27 15:43:53,487 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 127 selfloop transitions, 21 changer transitions 0/182 dead transitions. [2024-01-27 15:43:53,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 182 transitions, 1377 flow [2024-01-27 15:43:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:43:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:43:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-01-27 15:43:53,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6289308176100629 [2024-01-27 15:43:53,488 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 637 flow. Second operand 6 states and 200 transitions. [2024-01-27 15:43:53,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 182 transitions, 1377 flow [2024-01-27 15:43:53,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 182 transitions, 1357 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-27 15:43:53,640 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 760 flow [2024-01-27 15:43:53,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=107, PETRI_TRANSITIONS=111} [2024-01-27 15:43:53,640 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places. [2024-01-27 15:43:53,640 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 760 flow [2024-01-27 15:43:53,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 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-01-27 15:43:53,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:53,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:53,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:43:53,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:53,846 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:43:53,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1302941722, now seen corresponding path program 2 times [2024-01-27 15:43:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937737536] [2024-01-27 15:43:53,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:43:54,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937737536] [2024-01-27 15:43:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937737536] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173893461] [2024-01-27 15:43:54,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:43:54,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:54,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:43:54,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:43:54,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:43:54,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:43:54,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:43:54,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:43:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:43:54,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:43:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173893461] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:54,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:43:54,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-01-27 15:43:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282633084] [2024-01-27 15:43:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:54,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:43:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:43:54,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:43:54,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2024-01-27 15:43:54,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 760 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 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-01-27 15:43:54,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:54,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2024-01-27 15:43:54,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:55,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 30#L144-4true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 37#L79true, 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 43#L58true, 383#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:55,251 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,251 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:55,251 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:55,251 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:43:55,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 37#L79true, 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 43#L58true, 383#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:55,405 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,405 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:55,405 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:55,405 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:43:55,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [30#L144-4true, Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 37#L79true, 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:55,534 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-27 15:43:55,534 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:55,534 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:55,534 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:55,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 30#L144-4true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 43#L58true, 117#true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 38#thread2EXITtrue, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:55,567 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-27 15:43:55,568 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:55,568 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:55,568 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:43:55,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 37#L79true, 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:55,706 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-27 15:43:55,706 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,706 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,706 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 30#L144-4true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:55,709 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-27 15:43:55,710 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,710 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,710 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 43#L58true, 117#true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, 38#thread2EXITtrue, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:55,733 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-01-27 15:43:55,733 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,733 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,733 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:43:55,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), 50#L82true, Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:55,871 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:43:55,871 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,871 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,871 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 37#L79true, 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 40#L145-2true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:55,873 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:43:55,873 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,873 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,873 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [30#L144-4true, Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:55,875 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:43:55,875 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,875 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,875 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 30#L144-4true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 38#thread2EXITtrue, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:55,876 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-01-27 15:43:55,876 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,876 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:55,877 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:56,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:56,046 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-27 15:43:56,046 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,046 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,046 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, 38#thread2EXITtrue, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:56,047 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-27 15:43:56,047 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,047 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,047 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), 50#L82true, Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 40#L145-2true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,048 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-27 15:43:56,048 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,048 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,048 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 18#L146-1true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 37#L79true, 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,049 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-01-27 15:43:56,049 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,050 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,050 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, 40#L145-2true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,192 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-01-27 15:43:56,192 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,192 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,192 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 38#thread2EXITtrue, 40#L145-2true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,193 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-01-27 15:43:56,193 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,193 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,194 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 18#L146-1true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), 50#L82true, Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,194 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-01-27 15:43:56,194 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,194 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,195 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 18#L146-1true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 577#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,315 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-27 15:43:56,315 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:43:56,315 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:43:56,315 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:43:56,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 18#L146-1true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 38#thread2EXITtrue, Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,316 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-01-27 15:43:56,316 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:43:56,316 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:43:56,316 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:43:56,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), 33#L146-2true, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,417 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-01-27 15:43:56,417 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:43:56,417 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:43:56,418 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:43:56,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][183], [Black: 64#(= ~total~0 0), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), 32#L100true, 983#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), 47#L147-1true, Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 391#true, Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,490 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-01-27 15:43:56,490 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-27 15:43:56,490 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-27 15:43:56,490 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-01-27 15:43:56,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][182], [30#L144-4true, Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), 50#L82true, Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 923#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:56,520 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-01-27 15:43:56,520 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-27 15:43:56,520 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-01-27 15:43:56,520 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:43:56,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][182], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 923#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:56,558 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-27 15:43:56,558 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-27 15:43:56,558 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,558 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-27 15:43:56,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][182], [30#L144-4true, Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, 923#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:56,564 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-01-27 15:43:56,564 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-27 15:43:56,564 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-01-27 15:43:56,564 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-27 15:43:56,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][182], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 52#L145-1true, 5#L72true, 923#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 11#thread1EXITtrue]) [2024-01-27 15:43:56,588 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-27 15:43:56,588 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-27 15:43:56,588 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,589 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-27 15:43:56,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][182], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 40#L145-2true, 923#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,591 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-01-27 15:43:56,591 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-27 15:43:56,592 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-01-27 15:43:56,592 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-01-27 15:43:56,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][182], [Black: 64#(= ~total~0 0), 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L115true, 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, 40#L145-2true, 923#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,607 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-27 15:43:56,607 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-27 15:43:56,607 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-27 15:43:56,607 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:43:56,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][182], [Black: 64#(= ~total~0 0), 18#L146-1true, 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), 50#L82true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 296#(= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 923#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,609 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-01-27 15:43:56,609 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-27 15:43:56,609 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-01-27 15:43:56,609 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-27 15:43:56,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L111-->L115: Formula: (let ((.cse0 (select (select |v_#memory_int#4_98| v_~q2~0.base_101) (+ v_~q2~0.offset_101 (* 4 v_~q2_front~0_89))))) (and (not (= (ite (or (<= .cse0 0) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= 0 (+ v_~total~0_87 2147483648)) (= (+ v_~q2_front~0_89 1) v_~q2_front~0_88) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ v_~total~0_88 .cse0)) (= v_~total~0_87 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= v_~total~0_87 2147483647) (not (= (ite (and (< v_~q2_front~0_89 v_~q2_back~0_105) (<= 0 v_~q2_front~0_89) (< v_~q2_front~0_89 v_~n2~0_76)) 1 0) 0)) (not (= (ite (or (<= 0 .cse0) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)))) InVars {~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, ~q2_front~0=v_~q2_front~0_89, ~q2~0.base=v_~q2~0.base_101, #memory_int#4=|v_#memory_int#4_98|, ~q2_back~0=v_~q2_back~0_105, ~total~0=v_~total~0_88} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_76, ~q2~0.offset=v_~q2~0.offset_101, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q2_front~0=v_~q2_front~0_88, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, #memory_int#4=|v_#memory_int#4_98|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_87, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_101, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_105, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][182], [Black: 64#(= ~total~0 0), 18#L146-1true, 20#thread3EXITtrue, Black: 377#(and (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 68#(<= ~q1_back~0 ~q1_front~0), Black: 379#(and (or (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))) (or (< ~j~0 (+ ~i~0 1)) (< ~j~0 1)) (or (< ~N~0 (+ ~i~0 1)) (< ~j~0 ~N~0))), Black: 699#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 704#(<= ~q2_front~0 ~q2_back~0), Black: 72#(= ~q2_back~0 ~q2_front~0), Black: 836#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), 665#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 838#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 85#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 659#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 653#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 661#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 663#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 564#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L115true, Black: 92#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 387#(and (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (< ~N~0 (+ ~i~0 1)) (< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)))), Black: 679#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 682#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), Black: 680#(and (<= (div |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork3_~cond~3#1|)), 5#L72true, 923#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 115#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 691#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 690#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))]) [2024-01-27 15:43:56,626 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-01-27 15:43:56,626 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-27 15:43:56,626 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-27 15:43:56,626 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-27 15:43:56,640 INFO L124 PetriNetUnfolderBase]: 14048/21819 cut-off events. [2024-01-27 15:43:56,640 INFO L125 PetriNetUnfolderBase]: For 93505/96223 co-relation queries the response was YES. [2024-01-27 15:43:56,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85865 conditions, 21819 events. 14048/21819 cut-off events. For 93505/96223 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 152357 event pairs, 1885 based on Foata normal form. 1998/23478 useless extension candidates. Maximal degree in co-relation 85821. Up to 7397 conditions per place. [2024-01-27 15:43:56,878 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 157 selfloop transitions, 23 changer transitions 0/217 dead transitions. [2024-01-27 15:43:56,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 217 transitions, 1909 flow [2024-01-27 15:43:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:43:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:43:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2024-01-27 15:43:56,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6352201257861635 [2024-01-27 15:43:56,880 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 760 flow. Second operand 6 states and 202 transitions. [2024-01-27 15:43:56,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 217 transitions, 1909 flow [2024-01-27 15:43:57,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 217 transitions, 1881 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-01-27 15:43:57,151 INFO L231 Difference]: Finished difference. Result has 114 places, 123 transitions, 940 flow [2024-01-27 15:43:57,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=114, PETRI_TRANSITIONS=123} [2024-01-27 15:43:57,152 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 60 predicate places. [2024-01-27 15:43:57,152 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 123 transitions, 940 flow [2024-01-27 15:43:57,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 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-01-27 15:43:57,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:57,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:57,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-27 15:43:57,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:57,364 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-27 15:43:57,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash -275418685, now seen corresponding path program 1 times [2024-01-27 15:43:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:57,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761440722] [2024-01-27 15:43:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761440722] [2024-01-27 15:43:59,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761440722] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:59,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811937091] [2024-01-27 15:43:59,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:59,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:59,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:43:59,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 15:43:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:59,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 47 conjunts are in the unsatisfiable core [2024-01-27 15:43:59,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:43:59,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-01-27 15:43:59,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2024-01-27 15:43:59,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:43:59,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:43:59,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:43:59,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:43:59,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:59,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:44:00,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:44:00,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:44:00,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:44:00,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:44:00,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:44:00,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:44:00,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:44:00,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:44:00,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:44:00,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:44:00,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:44:00,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:44:00,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:44:00,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:44:00,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:44:00,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:00,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:44:00,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-01-27 15:44:00,173 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-01-27 15:44:00,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-01-27 15:44:00,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-27 15:44:00,261 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:44:00,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-01-27 15:44:00,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-27 15:44:00,794 INFO L349 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2024-01-27 15:44:00,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 46 [2024-01-27 15:44:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:44:00,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:01,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:01,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 113 [2024-01-27 15:44:01,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:01,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3618 treesize of output 3358 [2024-01-27 15:44:02,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:02,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1138 treesize of output 1066 [2024-01-27 15:44:02,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:02,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 850 treesize of output 922 [2024-01-27 15:46:56,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-01-27 15:46:56,846 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-01-27 15:46:56,847 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-27 15:46:56,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 15:46:57,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-27 15:46:57,059 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:516) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-01-27 15:46:57,080 INFO L158 Benchmark]: Toolchain (without parser) took 198857.16ms. Allocated memory was 159.4MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 86.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-01-27 15:46:57,080 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:46:57,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.79ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 72.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-27 15:46:57,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.15ms. Allocated memory is still 159.4MB. Free memory was 72.6MB in the beginning and 69.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:46:57,081 INFO L158 Benchmark]: Boogie Preprocessor took 66.09ms. Allocated memory is still 159.4MB. Free memory was 69.6MB in the beginning and 127.7MB in the end (delta: -58.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-01-27 15:46:57,081 INFO L158 Benchmark]: RCFGBuilder took 821.47ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 127.6MB in the beginning and 166.8MB in the end (delta: -39.2MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2024-01-27 15:46:57,081 INFO L158 Benchmark]: TraceAbstraction took 197712.71ms. Allocated memory was 203.4MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 165.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-01-27 15:46:57,082 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.79ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 72.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.15ms. Allocated memory is still 159.4MB. Free memory was 72.6MB in the beginning and 69.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.09ms. Allocated memory is still 159.4MB. Free memory was 69.6MB in the beginning and 127.7MB in the end (delta: -58.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * RCFGBuilder took 821.47ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 127.6MB in the beginning and 166.8MB in the end (delta: -39.2MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. * TraceAbstraction took 197712.71ms. Allocated memory was 203.4MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 165.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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 ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:46:59,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:46:59,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-27 15:46:59,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:46:59,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:46:59,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:46:59,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:46:59,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:46:59,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:46:59,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:46:59,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:46:59,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:46:59,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:46:59,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:46:59,174 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:46:59,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:46:59,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:46:59,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:46:59,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:46:59,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:46:59,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:46:59,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:46:59,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:46:59,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-27 15:46:59,177 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-27 15:46:59,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:46:59,178 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-27 15:46:59,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:46:59,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:46:59,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:46:59,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:46:59,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:46:59,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:46:59,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:46:59,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:46:59,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:46:59,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:46:59,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:46:59,182 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-27 15:46:59,182 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-27 15:46:59,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:46:59,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:46:59,182 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:46:59,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:46:59,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:46:59,183 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-27 15:46:59,183 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 -> 8d3b4a56bf20a7e5cb147a14169234a27b247cfdef3db9f4b8a4f4a17cd6fe47 [2024-01-27 15:46:59,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:46:59,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:46:59,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:46:59,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:46:59,490 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:46:59,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-01-27 15:47:00,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:47:00,915 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:47:00,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-01-27 15:47:00,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45ea645f/fcd8bb0da89c449dafd2aa527686fd3b/FLAG0addf16b3 [2024-01-27 15:47:00,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45ea645f/fcd8bb0da89c449dafd2aa527686fd3b [2024-01-27 15:47:00,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:47:00,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:47:00,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:47:00,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:47:00,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:47:00,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:47:00" (1/1) ... [2024-01-27 15:47:00,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c20d3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:00, skipping insertion in model container [2024-01-27 15:47:00,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:47:00" (1/1) ... [2024-01-27 15:47:00,972 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:47:01,165 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-01-27 15:47:01,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:47:01,189 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-27 15:47:01,196 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:47:01,225 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-01-27 15:47:01,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:47:01,247 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:47:01,280 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-01-27 15:47:01,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:47:01,302 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:47:01,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01 WrapperNode [2024-01-27 15:47:01,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:47:01,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:47:01,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:47:01,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:47:01,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,369 INFO L138 Inliner]: procedures = 29, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 350 [2024-01-27 15:47:01,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:47:01,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:47:01,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:47:01,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:47:01,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,418 INFO L175 MemorySlicer]: Split 20 memory accesses to 6 slices as follows [2, 2, 10, 2, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 3, 1, 1, 1]. [2024-01-27 15:47:01,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:47:01,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:47:01,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:47:01,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:47:01,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (1/1) ... [2024-01-27 15:47:01,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:47:01,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:47:01,499 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-01-27 15:47:01,516 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-01-27 15:47:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:47:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-27 15:47:01,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-27 15:47:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-27 15:47:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-27 15:47:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-01-27 15:47:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-01-27 15:47:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:47:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-27 15:47:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-27 15:47:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-27 15:47:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-27 15:47:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-01-27 15:47:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-01-27 15:47:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:47:01,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:47:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:47:01,553 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:47:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:47:01,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:47:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-27 15:47:01,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:47:01,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-27 15:47:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-01-27 15:47:01,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-01-27 15:47:01,558 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:47:01,692 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:47:01,694 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:47:02,228 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:47:02,228 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:47:02,518 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:47:02,519 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-01-27 15:47:02,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:47:02 BoogieIcfgContainer [2024-01-27 15:47:02,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:47:02,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:47:02,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:47:02,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:47:02,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:47:00" (1/3) ... [2024-01-27 15:47:02,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c025101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:47:02, skipping insertion in model container [2024-01-27 15:47:02,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:01" (2/3) ... [2024-01-27 15:47:02,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c025101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:47:02, skipping insertion in model container [2024-01-27 15:47:02,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:47:02" (3/3) ... [2024-01-27 15:47:02,525 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-01-27 15:47:02,532 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:47:02,540 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:47:02,540 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:47:02,540 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:47:02,588 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 15:47:02,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 134 flow [2024-01-27 15:47:02,642 INFO L124 PetriNetUnfolderBase]: 7/49 cut-off events. [2024-01-27 15:47:02,642 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:47:02,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 49 events. 7/49 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-01-27 15:47:02,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 53 transitions, 134 flow [2024-01-27 15:47:02,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 48 transitions, 120 flow [2024-01-27 15:47:02,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:47:02,659 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@24dbef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:47:02,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-27 15:47:02,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:47:02,672 INFO L124 PetriNetUnfolderBase]: 7/47 cut-off events. [2024-01-27 15:47:02,672 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:47:02,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:02,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:02,673 INFO L420 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-01-27 15:47:02,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1220442070, now seen corresponding path program 1 times [2024-01-27 15:47:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:02,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843548637] [2024-01-27 15:47:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:02,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:02,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:02,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:02,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-01-27 15:47:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:02,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2024-01-27 15:47:02,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:47:02,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:02,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843548637] [2024-01-27 15:47:02,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843548637] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:02,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:02,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:47:02,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090335657] [2024-01-27 15:47:02,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:02,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:47:02,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:47:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:47:03,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:47:03,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-01-27 15:47:03,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:03,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:47:03,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:03,382 INFO L124 PetriNetUnfolderBase]: 1172/1991 cut-off events. [2024-01-27 15:47:03,383 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-01-27 15:47:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 1991 events. 1172/1991 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11995 event pairs, 277 based on Foata normal form. 1/1896 useless extension candidates. Maximal degree in co-relation 2793. Up to 1141 conditions per place. [2024-01-27 15:47:03,396 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 45 selfloop transitions, 3 changer transitions 1/66 dead transitions. [2024-01-27 15:47:03,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 269 flow [2024-01-27 15:47:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:47:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:47:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-01-27 15:47:03,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2024-01-27 15:47:03,407 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 120 flow. Second operand 3 states and 113 transitions. [2024-01-27 15:47:03,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 269 flow [2024-01-27 15:47:03,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 243 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-27 15:47:03,413 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 123 flow [2024-01-27 15:47:03,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2024-01-27 15:47:03,416 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2024-01-27 15:47:03,417 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 123 flow [2024-01-27 15:47:03,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-01-27 15:47:03,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:03,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:03,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-01-27 15:47:03,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:03,621 INFO L420 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-01-27 15:47:03,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash 474989719, now seen corresponding path program 1 times [2024-01-27 15:47:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:03,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620771887] [2024-01-27 15:47:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:03,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:03,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:03,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:03,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-01-27 15:47:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:03,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:47:03,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:47:04,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:04,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:04,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620771887] [2024-01-27 15:47:04,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620771887] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:04,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:04,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:47:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582531678] [2024-01-27 15:47:04,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:04,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:47:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:47:04,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:47:04,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 53 [2024-01-27 15:47:04,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-01-27 15:47:04,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:04,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 53 [2024-01-27 15:47:04,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:05,130 INFO L124 PetriNetUnfolderBase]: 4451/6096 cut-off events. [2024-01-27 15:47:05,130 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2024-01-27 15:47:05,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13077 conditions, 6096 events. 4451/6096 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 33217 event pairs, 389 based on Foata normal form. 122/5839 useless extension candidates. Maximal degree in co-relation 5094. Up to 2740 conditions per place. [2024-01-27 15:47:05,160 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 127 selfloop transitions, 12 changer transitions 1/152 dead transitions. [2024-01-27 15:47:05,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 152 transitions, 665 flow [2024-01-27 15:47:05,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:47:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:47:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 279 transitions. [2024-01-27 15:47:05,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-01-27 15:47:05,168 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 123 flow. Second operand 9 states and 279 transitions. [2024-01-27 15:47:05,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 152 transitions, 665 flow [2024-01-27 15:47:05,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 152 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:47:05,171 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 207 flow [2024-01-27 15:47:05,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=207, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2024-01-27 15:47:05,172 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2024-01-27 15:47:05,172 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 207 flow [2024-01-27 15:47:05,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 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-01-27 15:47:05,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:05,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:05,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:47:05,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:05,375 INFO L420 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-01-27 15:47:05,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1029899839, now seen corresponding path program 1 times [2024-01-27 15:47:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800005164] [2024-01-27 15:47:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:05,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:05,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:05,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-01-27 15:47:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:05,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2024-01-27 15:47:05,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:47:05,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:05,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:05,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800005164] [2024-01-27 15:47:05,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800005164] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:05,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:47:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903898759] [2024-01-27 15:47:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:05,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:47:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:47:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:47:05,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:47:05,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-27 15:47:05,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:05,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:47:05,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:05,999 INFO L124 PetriNetUnfolderBase]: 1938/3160 cut-off events. [2024-01-27 15:47:06,000 INFO L125 PetriNetUnfolderBase]: For 4491/4822 co-relation queries the response was YES. [2024-01-27 15:47:06,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8253 conditions, 3160 events. 1938/3160 cut-off events. For 4491/4822 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19430 event pairs, 513 based on Foata normal form. 219/3241 useless extension candidates. Maximal degree in co-relation 5135. Up to 1801 conditions per place. [2024-01-27 15:47:06,015 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 68 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-01-27 15:47:06,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 466 flow [2024-01-27 15:47:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:47:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:47:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-01-27 15:47:06,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7232704402515723 [2024-01-27 15:47:06,018 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 207 flow. Second operand 3 states and 115 transitions. [2024-01-27 15:47:06,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 466 flow [2024-01-27 15:47:06,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 466 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:47:06,025 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 221 flow [2024-01-27 15:47:06,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-01-27 15:47:06,026 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2024-01-27 15:47:06,026 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 221 flow [2024-01-27 15:47:06,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-01-27 15:47:06,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:06,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:06,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:47:06,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:06,243 INFO L420 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-01-27 15:47:06,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1260303260, now seen corresponding path program 1 times [2024-01-27 15:47:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530401119] [2024-01-27 15:47:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:06,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:06,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:06,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:06,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-01-27 15:47:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:06,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 15:47:06,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:47:06,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:06,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530401119] [2024-01-27 15:47:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530401119] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:06,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:06,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:47:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646227810] [2024-01-27 15:47:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:06,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:47:06,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:06,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:47:06,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:47:06,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:47:06,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:06,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:06,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:47:06,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:06,964 INFO L124 PetriNetUnfolderBase]: 2629/4083 cut-off events. [2024-01-27 15:47:06,980 INFO L125 PetriNetUnfolderBase]: For 6382/6936 co-relation queries the response was YES. [2024-01-27 15:47:06,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11728 conditions, 4083 events. 2629/4083 cut-off events. For 6382/6936 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 26229 event pairs, 1726 based on Foata normal form. 398/4076 useless extension candidates. Maximal degree in co-relation 7023. Up to 2605 conditions per place. [2024-01-27 15:47:07,009 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 73 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2024-01-27 15:47:07,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 95 transitions, 485 flow [2024-01-27 15:47:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:47:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:47:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-01-27 15:47:07,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2024-01-27 15:47:07,011 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 221 flow. Second operand 4 states and 144 transitions. [2024-01-27 15:47:07,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 95 transitions, 485 flow [2024-01-27 15:47:07,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:47:07,032 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 241 flow [2024-01-27 15:47:07,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-01-27 15:47:07,033 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 14 predicate places. [2024-01-27 15:47:07,033 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 241 flow [2024-01-27 15:47:07,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:07,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:07,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:07,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-01-27 15:47:07,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:07,237 INFO L420 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-01-27 15:47:07,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1562565204, now seen corresponding path program 1 times [2024-01-27 15:47:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139337793] [2024-01-27 15:47:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:07,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:07,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:07,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-01-27 15:47:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:07,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:47:07,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:47:07,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:07,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139337793] [2024-01-27 15:47:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139337793] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:07,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:07,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:47:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066460946] [2024-01-27 15:47:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:07,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:47:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:47:07,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:47:07,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-27 15:47:07,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:07,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:07,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-27 15:47:07,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:08,041 INFO L124 PetriNetUnfolderBase]: 3387/5439 cut-off events. [2024-01-27 15:47:08,041 INFO L125 PetriNetUnfolderBase]: For 8676/9428 co-relation queries the response was YES. [2024-01-27 15:47:08,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15343 conditions, 5439 events. 3387/5439 cut-off events. For 8676/9428 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 38058 event pairs, 2304 based on Foata normal form. 604/5524 useless extension candidates. Maximal degree in co-relation 11212. Up to 3682 conditions per place. [2024-01-27 15:47:08,072 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 68 selfloop transitions, 4 changer transitions 7/98 dead transitions. [2024-01-27 15:47:08,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 536 flow [2024-01-27 15:47:08,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:47:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:47:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-01-27 15:47:08,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6698113207547169 [2024-01-27 15:47:08,074 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 241 flow. Second operand 4 states and 142 transitions. [2024-01-27 15:47:08,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 536 flow [2024-01-27 15:47:08,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 532 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:47:08,082 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 260 flow [2024-01-27 15:47:08,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-01-27 15:47:08,083 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2024-01-27 15:47:08,083 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 260 flow [2024-01-27 15:47:08,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:08,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:08,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:08,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-01-27 15:47:08,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:08,288 INFO L420 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-01-27 15:47:08,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1416264151, now seen corresponding path program 1 times [2024-01-27 15:47:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487673676] [2024-01-27 15:47:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:08,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:08,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:08,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-01-27 15:47:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:08,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:47:08,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:47:08,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:08,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:08,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487673676] [2024-01-27 15:47:08,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487673676] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:08,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:08,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:47:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819823483] [2024-01-27 15:47:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:08,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:47:08,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:08,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:47:08,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:47:08,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-01-27 15:47:08,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-01-27 15:47:08,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:08,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-01-27 15:47:08,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:09,881 INFO L124 PetriNetUnfolderBase]: 7455/11695 cut-off events. [2024-01-27 15:47:09,882 INFO L125 PetriNetUnfolderBase]: For 14161/15247 co-relation queries the response was YES. [2024-01-27 15:47:09,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32761 conditions, 11695 events. 7455/11695 cut-off events. For 14161/15247 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 84430 event pairs, 2748 based on Foata normal form. 522/11519 useless extension candidates. Maximal degree in co-relation 23622. Up to 3935 conditions per place. [2024-01-27 15:47:09,935 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 108 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2024-01-27 15:47:09,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 132 transitions, 720 flow [2024-01-27 15:47:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:47:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:47:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2024-01-27 15:47:09,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6383647798742138 [2024-01-27 15:47:09,937 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 260 flow. Second operand 6 states and 203 transitions. [2024-01-27 15:47:09,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 132 transitions, 720 flow [2024-01-27 15:47:09,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 132 transitions, 715 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:47:09,978 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 307 flow [2024-01-27 15:47:09,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-01-27 15:47:09,979 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2024-01-27 15:47:09,980 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 307 flow [2024-01-27 15:47:09,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-01-27 15:47:09,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:09,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:09,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-01-27 15:47:10,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:10,182 INFO L420 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-01-27 15:47:10,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1586844703, now seen corresponding path program 1 times [2024-01-27 15:47:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:10,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819151109] [2024-01-27 15:47:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:10,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:10,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:10,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:10,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-01-27 15:47:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:10,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:47:10,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:47:10,477 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:10,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:10,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819151109] [2024-01-27 15:47:10,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819151109] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:10,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:10,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:47:10,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004837569] [2024-01-27 15:47:10,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:10,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:47:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:10,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:47:10,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:47:10,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-01-27 15:47:10,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-01-27 15:47:10,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:10,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-01-27 15:47:10,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:11,635 INFO L124 PetriNetUnfolderBase]: 7911/12211 cut-off events. [2024-01-27 15:47:11,636 INFO L125 PetriNetUnfolderBase]: For 19068/21148 co-relation queries the response was YES. [2024-01-27 15:47:11,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34519 conditions, 12211 events. 7911/12211 cut-off events. For 19068/21148 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 89926 event pairs, 3050 based on Foata normal form. 1194/12004 useless extension candidates. Maximal degree in co-relation 24190. Up to 4751 conditions per place. [2024-01-27 15:47:11,699 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 74 selfloop transitions, 5 changer transitions 41/136 dead transitions. [2024-01-27 15:47:11,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 136 transitions, 799 flow [2024-01-27 15:47:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:47:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:47:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-01-27 15:47:11,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2024-01-27 15:47:11,701 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 307 flow. Second operand 6 states and 196 transitions. [2024-01-27 15:47:11,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 136 transitions, 799 flow [2024-01-27 15:47:11,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 136 transitions, 792 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:47:11,717 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 291 flow [2024-01-27 15:47:11,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2024-01-27 15:47:11,718 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2024-01-27 15:47:11,718 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 291 flow [2024-01-27 15:47:11,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-01-27 15:47:11,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:11,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:11,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-01-27 15:47:11,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:11,923 INFO L420 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-01-27 15:47:11,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1360854972, now seen corresponding path program 1 times [2024-01-27 15:47:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:11,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951125690] [2024-01-27 15:47:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:11,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:11,926 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:11,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-01-27 15:47:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:12,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:47:12,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:12,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:47:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:12,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:12,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951125690] [2024-01-27 15:47:12,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951125690] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:47:12,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:47:12,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-01-27 15:47:12,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657830185] [2024-01-27 15:47:12,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:47:12,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:47:12,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:12,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:47:12,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:47:12,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-01-27 15:47:12,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 291 flow. Second operand has 18 states, 18 states have (on average 17.88888888888889) internal successors, (322), 18 states have internal predecessors, (322), 0 states have call successors, (0), 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-01-27 15:47:12,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:12,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-01-27 15:47:12,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:21,352 INFO L124 PetriNetUnfolderBase]: 31839/44491 cut-off events. [2024-01-27 15:47:21,353 INFO L125 PetriNetUnfolderBase]: For 79088/82554 co-relation queries the response was YES. [2024-01-27 15:47:21,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137521 conditions, 44491 events. 31839/44491 cut-off events. For 79088/82554 co-relation queries the response was YES. Maximal size of possible extension queue 2605. Compared 315260 event pairs, 810 based on Foata normal form. 1212/45291 useless extension candidates. Maximal degree in co-relation 121588. Up to 8495 conditions per place. [2024-01-27 15:47:21,674 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 655 selfloop transitions, 132 changer transitions 5/804 dead transitions. [2024-01-27 15:47:21,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 804 transitions, 4976 flow [2024-01-27 15:47:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-01-27 15:47:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2024-01-27 15:47:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 1401 transitions. [2024-01-27 15:47:21,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5507075471698113 [2024-01-27 15:47:21,679 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 291 flow. Second operand 48 states and 1401 transitions. [2024-01-27 15:47:21,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 804 transitions, 4976 flow [2024-01-27 15:47:21,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 804 transitions, 4795 flow, removed 60 selfloop flow, removed 8 redundant places. [2024-01-27 15:47:21,996 INFO L231 Difference]: Finished difference. Result has 142 places, 223 transitions, 1451 flow [2024-01-27 15:47:21,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=1451, PETRI_PLACES=142, PETRI_TRANSITIONS=223} [2024-01-27 15:47:21,997 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 88 predicate places. [2024-01-27 15:47:21,997 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 223 transitions, 1451 flow [2024-01-27 15:47:21,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.88888888888889) internal successors, (322), 18 states have internal predecessors, (322), 0 states have call successors, (0), 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-01-27 15:47:21,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:21,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:22,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-01-27 15:47:22,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:22,201 INFO L420 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-01-27 15:47:22,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1195382128, now seen corresponding path program 2 times [2024-01-27 15:47:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:22,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663800710] [2024-01-27 15:47:22,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:47:22,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:22,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:22,205 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:22,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-01-27 15:47:22,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:47:22,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:47:22,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:47:22,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:22,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:47:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:22,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:22,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663800710] [2024-01-27 15:47:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663800710] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:47:22,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:47:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-01-27 15:47:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598867502] [2024-01-27 15:47:22,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:47:22,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 15:47:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:22,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 15:47:22,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-01-27 15:47:22,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-01-27 15:47:22,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 223 transitions, 1451 flow. Second operand has 13 states, 13 states have (on average 21.23076923076923) internal successors, (276), 13 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:22,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:22,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-01-27 15:47:22,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:29,947 INFO L124 PetriNetUnfolderBase]: 34283/50255 cut-off events. [2024-01-27 15:47:29,948 INFO L125 PetriNetUnfolderBase]: For 334493/344756 co-relation queries the response was YES. [2024-01-27 15:47:30,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197661 conditions, 50255 events. 34283/50255 cut-off events. For 334493/344756 co-relation queries the response was YES. Maximal size of possible extension queue 2883. Compared 389565 event pairs, 4850 based on Foata normal form. 2370/50814 useless extension candidates. Maximal degree in co-relation 193490. Up to 10745 conditions per place. [2024-01-27 15:47:30,523 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 288 selfloop transitions, 84 changer transitions 1/424 dead transitions. [2024-01-27 15:47:30,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 424 transitions, 3503 flow [2024-01-27 15:47:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:47:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:47:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 320 transitions. [2024-01-27 15:47:30,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548885077186964 [2024-01-27 15:47:30,525 INFO L175 Difference]: Start difference. First operand has 142 places, 223 transitions, 1451 flow. Second operand 11 states and 320 transitions. [2024-01-27 15:47:30,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 424 transitions, 3503 flow [2024-01-27 15:47:32,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 424 transitions, 3454 flow, removed 23 selfloop flow, removed 1 redundant places. [2024-01-27 15:47:32,460 INFO L231 Difference]: Finished difference. Result has 155 places, 255 transitions, 1906 flow [2024-01-27 15:47:32,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1906, PETRI_PLACES=155, PETRI_TRANSITIONS=255} [2024-01-27 15:47:32,461 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 101 predicate places. [2024-01-27 15:47:32,461 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 255 transitions, 1906 flow [2024-01-27 15:47:32,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.23076923076923) internal successors, (276), 13 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:32,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:32,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:32,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-01-27 15:47:32,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:32,666 INFO L420 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-01-27 15:47:32,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:32,666 INFO L85 PathProgramCache]: Analyzing trace with hash -544828828, now seen corresponding path program 1 times [2024-01-27 15:47:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:32,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113258894] [2024-01-27 15:47:32,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:32,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:32,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:32,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:32,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-01-27 15:47:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:32,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:47:32,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:32,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:47:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:33,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113258894] [2024-01-27 15:47:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113258894] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:47:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:47:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-01-27 15:47:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662755455] [2024-01-27 15:47:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:33,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:47:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:47:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-01-27 15:47:33,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2024-01-27 15:47:33,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 255 transitions, 1906 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-01-27 15:47:33,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:33,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2024-01-27 15:47:33,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:37,235 INFO L124 PetriNetUnfolderBase]: 18739/27649 cut-off events. [2024-01-27 15:47:37,235 INFO L125 PetriNetUnfolderBase]: For 163994/169400 co-relation queries the response was YES. [2024-01-27 15:47:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117731 conditions, 27649 events. 18739/27649 cut-off events. For 163994/169400 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 198956 event pairs, 2488 based on Foata normal form. 1170/27911 useless extension candidates. Maximal degree in co-relation 114220. Up to 10873 conditions per place. [2024-01-27 15:47:37,661 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 169 selfloop transitions, 60 changer transitions 1/304 dead transitions. [2024-01-27 15:47:37,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 304 transitions, 2689 flow [2024-01-27 15:47:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:47:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:47:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2024-01-27 15:47:37,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5417789757412399 [2024-01-27 15:47:37,664 INFO L175 Difference]: Start difference. First operand has 155 places, 255 transitions, 1906 flow. Second operand 7 states and 201 transitions. [2024-01-27 15:47:37,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 304 transitions, 2689 flow [2024-01-27 15:47:39,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 304 transitions, 2532 flow, removed 53 selfloop flow, removed 6 redundant places. [2024-01-27 15:47:39,122 INFO L231 Difference]: Finished difference. Result has 153 places, 247 transitions, 1875 flow [2024-01-27 15:47:39,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1875, PETRI_PLACES=153, PETRI_TRANSITIONS=247} [2024-01-27 15:47:39,123 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 99 predicate places. [2024-01-27 15:47:39,123 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 247 transitions, 1875 flow [2024-01-27 15:47:39,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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-01-27 15:47:39,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:39,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:39,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-01-27 15:47:39,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:39,329 INFO L420 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-01-27 15:47:39,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash -966439374, now seen corresponding path program 1 times [2024-01-27 15:47:39,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:39,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541837243] [2024-01-27 15:47:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:39,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:47:39,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:39,333 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:47:39,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-01-27 15:47:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:39,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 15:47:39,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:39,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:47:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:39,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:39,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541837243] [2024-01-27 15:47:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541837243] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:47:39,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:47:39,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-01-27 15:47:39,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968011427] [2024-01-27 15:47:39,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:39,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:47:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:39,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:47:39,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:47:39,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-01-27 15:47:39,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 247 transitions, 1875 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:39,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:39,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-01-27 15:47:39,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:49,746 INFO L124 PetriNetUnfolderBase]: 54085/73422 cut-off events. [2024-01-27 15:47:49,747 INFO L125 PetriNetUnfolderBase]: For 476225/484591 co-relation queries the response was YES. [2024-01-27 15:47:50,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301762 conditions, 73422 events. 54085/73422 cut-off events. For 476225/484591 co-relation queries the response was YES. Maximal size of possible extension queue 4486. Compared 513449 event pairs, 6504 based on Foata normal form. 1598/68754 useless extension candidates. Maximal degree in co-relation 301705. Up to 25045 conditions per place. [2024-01-27 15:47:50,830 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 382 selfloop transitions, 187 changer transitions 6/624 dead transitions. [2024-01-27 15:47:50,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 624 transitions, 6096 flow [2024-01-27 15:47:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:47:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:47:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-01-27 15:47:50,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5974842767295597 [2024-01-27 15:47:50,832 INFO L175 Difference]: Start difference. First operand has 153 places, 247 transitions, 1875 flow. Second operand 6 states and 190 transitions. [2024-01-27 15:47:50,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 624 transitions, 6096 flow