/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:37:43,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:37:43,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:37:43,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:37:43,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:37:43,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:37:43,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:37:43,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:37:43,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:37:43,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:37:43,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:37:43,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:37:43,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:37:43,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:37:43,494 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:37:43,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:37:43,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:37:43,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:37:43,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:37:43,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:37:43,496 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:37:43,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:37:43,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:37:43,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:37:43,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:37:43,723 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:37:43,725 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 [2025-04-13 20:37:45,064 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d277ca572/5fc7ca9bbe874db295cc06da952f0170/FLAGddea44f0a [2025-04-13 20:37:45,267 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:37:45,267 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2025-04-13 20:37:45,276 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d277ca572/5fc7ca9bbe874db295cc06da952f0170/FLAGddea44f0a [2025-04-13 20:37:46,065 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d277ca572/5fc7ca9bbe874db295cc06da952f0170 [2025-04-13 20:37:46,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:37:46,068 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:37:46,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:37:46,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:37:46,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:37:46,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134d581e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46, skipping insertion in model container [2025-04-13 20:37:46,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:37:46,271 WARN L250 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] [2025-04-13 20:37:46,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:37:46,296 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:37:46,330 WARN L250 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] [2025-04-13 20:37:46,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:37:46,350 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:37:46,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46 WrapperNode [2025-04-13 20:37:46,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:37:46,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:37:46,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:37:46,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:37:46,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,391 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 315 [2025-04-13 20:37:46,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:37:46,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:37:46,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:37:46,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:37:46,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,417 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 20:37:46,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:37:46,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:37:46,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:37:46,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:37:46,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (1/1) ... [2025-04-13 20:37:46,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:37:46,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:46,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:37:46,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:37:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:37:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:37:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:37:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:37:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:37:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:37:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:37:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:37:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:37:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:37:46,482 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:37:46,586 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:37:46,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:37:46,991 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:37:46,992 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:37:46,992 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:37:47,325 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:37:47,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:37:47 BoogieIcfgContainer [2025-04-13 20:37:47,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:37:47,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:37:47,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:37:47,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:37:47,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:37:46" (1/3) ... [2025-04-13 20:37:47,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a014ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:37:47, skipping insertion in model container [2025-04-13 20:37:47,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:37:46" (2/3) ... [2025-04-13 20:37:47,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a014ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:37:47, skipping insertion in model container [2025-04-13 20:37:47,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:37:47" (3/3) ... [2025-04-13 20:37:47,331 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-04-13 20:37:47,341 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:37:47,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 43 locations, 45 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-13 20:37:47,342 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:37:47,393 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:37:47,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 126 flow [2025-04-13 20:37:47,449 INFO L116 PetriNetUnfolderBase]: 7/45 cut-off events. [2025-04-13 20:37:47,454 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:37:47,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 45 events. 7/45 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-13 20:37:47,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 126 flow [2025-04-13 20:37:47,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 44 transitions, 112 flow [2025-04-13 20:37:47,469 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:37:47,480 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bb548b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:37:47,480 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:37:47,529 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:37:47,529 INFO L116 PetriNetUnfolderBase]: 7/43 cut-off events. [2025-04-13 20:37:47,529 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:37:47,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:47,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:47,530 INFO L403 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)] === [2025-04-13 20:37:47,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1217734584, now seen corresponding path program 1 times [2025-04-13 20:37:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:47,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108492305] [2025-04-13 20:37:47,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:47,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 20:37:47,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:37:47,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:47,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:47,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:47,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108492305] [2025-04-13 20:37:47,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108492305] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:47,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:47,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:37:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586379418] [2025-04-13 20:37:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:47,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:37:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:47,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:37:47,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:37:47,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-04-13 20:37:47,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:47,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:47,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-04-13 20:37:47,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:48,136 INFO L116 PetriNetUnfolderBase]: 1030/1753 cut-off events. [2025-04-13 20:37:48,137 INFO L117 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-04-13 20:37:48,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1753 events. 1030/1753 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10482 event pairs, 252 based on Foata normal form. 1/1664 useless extension candidates. Maximal degree in co-relation 2793. Up to 989 conditions per place. [2025-04-13 20:37:48,154 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 39 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2025-04-13 20:37:48,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 243 flow [2025-04-13 20:37:48,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:37:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:37:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-13 20:37:48,164 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2025-04-13 20:37:48,164 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 112 flow. Second operand 3 states and 104 transitions. [2025-04-13 20:37:48,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 243 flow [2025-04-13 20:37:48,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 217 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:37:48,172 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 115 flow [2025-04-13 20:37:48,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-04-13 20:37:48,177 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-04-13 20:37:48,177 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 115 flow [2025-04-13 20:37:48,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:48,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:48,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:48,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:37:48,178 INFO L403 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)] === [2025-04-13 20:37:48,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1182938255, now seen corresponding path program 1 times [2025-04-13 20:37:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:48,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067637206] [2025-04-13 20:37:48,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:48,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:37:48,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:37:48,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:48,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:48,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067637206] [2025-04-13 20:37:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067637206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:48,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:48,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:37:48,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403003933] [2025-04-13 20:37:48,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:48,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:37:48,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:48,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:37:48,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:37:48,345 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-04-13 20:37:48,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:48,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:48,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-04-13 20:37:48,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:48,574 INFO L116 PetriNetUnfolderBase]: 1204/1954 cut-off events. [2025-04-13 20:37:48,574 INFO L117 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2025-04-13 20:37:48,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 1954 events. 1204/1954 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11299 event pairs, 362 based on Foata normal form. 64/1926 useless extension candidates. Maximal degree in co-relation 1456. Up to 1131 conditions per place. [2025-04-13 20:37:48,587 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-04-13 20:37:48,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 269 flow [2025-04-13 20:37:48,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:37:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:37:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-13 20:37:48,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7346938775510204 [2025-04-13 20:37:48,588 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 115 flow. Second operand 3 states and 108 transitions. [2025-04-13 20:37:48,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 269 flow [2025-04-13 20:37:48,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:48,592 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 126 flow [2025-04-13 20:37:48,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-13 20:37:48,593 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-04-13 20:37:48,593 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 126 flow [2025-04-13 20:37:48,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:48,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:48,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:48,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:37:48,594 INFO L403 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)] === [2025-04-13 20:37:48,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1757831649, now seen corresponding path program 1 times [2025-04-13 20:37:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:48,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250596859] [2025-04-13 20:37:48,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:48,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:37:48,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:37:48,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:48,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:48,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250596859] [2025-04-13 20:37:48,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250596859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:48,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:48,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:37:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142978779] [2025-04-13 20:37:48,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:48,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:37:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:48,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:37:48,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:37:48,763 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-04-13 20:37:48,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:48,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:48,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-04-13 20:37:48,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:49,040 INFO L116 PetriNetUnfolderBase]: 1425/2331 cut-off events. [2025-04-13 20:37:49,040 INFO L117 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2025-04-13 20:37:49,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5054 conditions, 2331 events. 1425/2331 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13428 event pairs, 399 based on Foata normal form. 33/2270 useless extension candidates. Maximal degree in co-relation 3350. Up to 1290 conditions per place. [2025-04-13 20:37:49,055 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-04-13 20:37:49,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 285 flow [2025-04-13 20:37:49,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:37:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:37:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-04-13 20:37:49,057 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7210884353741497 [2025-04-13 20:37:49,057 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 126 flow. Second operand 3 states and 106 transitions. [2025-04-13 20:37:49,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 285 flow [2025-04-13 20:37:49,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:49,059 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 138 flow [2025-04-13 20:37:49,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2025-04-13 20:37:49,062 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-04-13 20:37:49,062 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 138 flow [2025-04-13 20:37:49,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:49,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:49,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:49,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:37:49,062 INFO L403 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)] === [2025-04-13 20:37:49,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1116501598, now seen corresponding path program 1 times [2025-04-13 20:37:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:49,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668797527] [2025-04-13 20:37:49,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:49,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:37:49,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:37:49,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:49,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:49,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668797527] [2025-04-13 20:37:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668797527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:49,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:49,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:37:49,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248494558] [2025-04-13 20:37:49,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:49,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:37:49,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:49,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:37:49,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:37:49,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-04-13 20:37:49,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:49,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:49,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-04-13 20:37:49,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:49,524 INFO L116 PetriNetUnfolderBase]: 1781/2854 cut-off events. [2025-04-13 20:37:49,524 INFO L117 PetriNetUnfolderBase]: For 1450/1450 co-relation queries the response was YES. [2025-04-13 20:37:49,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 2854 events. 1781/2854 cut-off events. For 1450/1450 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17582 event pairs, 1276 based on Foata normal form. 72/2647 useless extension candidates. Maximal degree in co-relation 3434. Up to 1897 conditions per place. [2025-04-13 20:37:49,540 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 56 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-04-13 20:37:49,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 333 flow [2025-04-13 20:37:49,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:37:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:37:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-13 20:37:49,543 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6836734693877551 [2025-04-13 20:37:49,543 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 138 flow. Second operand 4 states and 134 transitions. [2025-04-13 20:37:49,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 333 flow [2025-04-13 20:37:49,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:49,546 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 156 flow [2025-04-13 20:37:49,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=4, PETRI_FLOW=156, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-04-13 20:37:49,547 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2025-04-13 20:37:49,547 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 156 flow [2025-04-13 20:37:49,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:49,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:49,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:49,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:37:49,548 INFO L403 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)] === [2025-04-13 20:37:49,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash 421764920, now seen corresponding path program 1 times [2025-04-13 20:37:49,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:49,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135980859] [2025-04-13 20:37:49,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:49,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:49,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:37:49,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:37:49,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:49,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:49,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135980859] [2025-04-13 20:37:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135980859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:37:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956311048] [2025-04-13 20:37:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:49,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:37:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:49,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:37:49,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:37:49,673 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-04-13 20:37:49,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:49,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:49,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-04-13 20:37:49,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:49,976 INFO L116 PetriNetUnfolderBase]: 2317/3853 cut-off events. [2025-04-13 20:37:49,976 INFO L117 PetriNetUnfolderBase]: For 1970/1970 co-relation queries the response was YES. [2025-04-13 20:37:49,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8761 conditions, 3853 events. 2317/3853 cut-off events. For 1970/1970 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 26080 event pairs, 1724 based on Foata normal form. 106/3596 useless extension candidates. Maximal degree in co-relation 6832. Up to 2489 conditions per place. [2025-04-13 20:37:49,995 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 55 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2025-04-13 20:37:49,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 356 flow [2025-04-13 20:37:49,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:37:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:37:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-13 20:37:49,996 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-04-13 20:37:49,996 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 156 flow. Second operand 5 states and 154 transitions. [2025-04-13 20:37:49,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 356 flow [2025-04-13 20:37:49,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:49,999 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 191 flow [2025-04-13 20:37:49,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-04-13 20:37:49,999 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-04-13 20:37:49,999 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 191 flow [2025-04-13 20:37:49,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:49,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:49,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:50,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:37:50,000 INFO L403 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)] === [2025-04-13 20:37:50,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1433890844, now seen corresponding path program 1 times [2025-04-13 20:37:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:50,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89610670] [2025-04-13 20:37:50,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:50,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:37:50,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:37:50,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:50,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:50,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:50,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89610670] [2025-04-13 20:37:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89610670] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:50,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066581398] [2025-04-13 20:37:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:50,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:50,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2025-04-13 20:37:50,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:50,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:50,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2025-04-13 20:37:50,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:51,051 INFO L116 PetriNetUnfolderBase]: 6369/9953 cut-off events. [2025-04-13 20:37:51,052 INFO L117 PetriNetUnfolderBase]: For 4588/4716 co-relation queries the response was YES. [2025-04-13 20:37:51,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22860 conditions, 9953 events. 6369/9953 cut-off events. For 4588/4716 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 70785 event pairs, 2799 based on Foata normal form. 16/8988 useless extension candidates. Maximal degree in co-relation 18126. Up to 3399 conditions per place. [2025-04-13 20:37:51,094 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 88 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2025-04-13 20:37:51,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 110 transitions, 564 flow [2025-04-13 20:37:51,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2025-04-13 20:37:51,095 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6292517006802721 [2025-04-13 20:37:51,095 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 191 flow. Second operand 6 states and 185 transitions. [2025-04-13 20:37:51,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 110 transitions, 564 flow [2025-04-13 20:37:51,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 557 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:51,099 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 230 flow [2025-04-13 20:37:51,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2025-04-13 20:37:51,099 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2025-04-13 20:37:51,099 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 230 flow [2025-04-13 20:37:51,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:51,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:51,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:51,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:37:51,100 INFO L403 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)] === [2025-04-13 20:37:51,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1027212129, now seen corresponding path program 1 times [2025-04-13 20:37:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:51,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406928839] [2025-04-13 20:37:51,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:51,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:51,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:37:51,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:37:51,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:51,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:51,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:51,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406928839] [2025-04-13 20:37:51,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406928839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:51,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:51,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:51,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694006526] [2025-04-13 20:37:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:51,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:51,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:51,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:51,332 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2025-04-13 20:37:51,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:51,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:51,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2025-04-13 20:37:51,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:51,918 INFO L116 PetriNetUnfolderBase]: 5021/8097 cut-off events. [2025-04-13 20:37:51,918 INFO L117 PetriNetUnfolderBase]: For 3977/4031 co-relation queries the response was YES. [2025-04-13 20:37:51,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18582 conditions, 8097 events. 5021/8097 cut-off events. For 3977/4031 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 57426 event pairs, 2149 based on Foata normal form. 6/7247 useless extension candidates. Maximal degree in co-relation 13633. Up to 3217 conditions per place. [2025-04-13 20:37:51,944 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 56 selfloop transitions, 6 changer transitions 30/105 dead transitions. [2025-04-13 20:37:51,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 105 transitions, 544 flow [2025-04-13 20:37:51,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2025-04-13 20:37:51,945 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2025-04-13 20:37:51,945 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 230 flow. Second operand 6 states and 183 transitions. [2025-04-13 20:37:51,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 105 transitions, 544 flow [2025-04-13 20:37:51,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 532 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 20:37:51,948 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 212 flow [2025-04-13 20:37:51,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2025-04-13 20:37:51,948 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2025-04-13 20:37:51,948 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 212 flow [2025-04-13 20:37:51,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:51,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:51,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:51,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:37:51,949 INFO L403 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)] === [2025-04-13 20:37:51,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1989407034, now seen corresponding path program 1 times [2025-04-13 20:37:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:51,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322182909] [2025-04-13 20:37:51,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:51,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:51,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:37:51,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:37:51,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:51,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:52,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:52,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322182909] [2025-04-13 20:37:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322182909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:52,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732604840] [2025-04-13 20:37:52,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:52,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:52,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:52,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:52,180 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-04-13 20:37:52,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:52,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:52,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-04-13 20:37:52,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:52,543 INFO L116 PetriNetUnfolderBase]: 2851/4627 cut-off events. [2025-04-13 20:37:52,543 INFO L117 PetriNetUnfolderBase]: For 3219/3219 co-relation queries the response was YES. [2025-04-13 20:37:52,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11326 conditions, 4627 events. 2851/4627 cut-off events. For 3219/3219 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 29107 event pairs, 499 based on Foata normal form. 248/4770 useless extension candidates. Maximal degree in co-relation 8841. Up to 2431 conditions per place. [2025-04-13 20:37:52,561 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 59 selfloop transitions, 5 changer transitions 2/80 dead transitions. [2025-04-13 20:37:52,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 80 transitions, 434 flow [2025-04-13 20:37:52,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2025-04-13 20:37:52,562 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5544217687074829 [2025-04-13 20:37:52,562 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 212 flow. Second operand 6 states and 163 transitions. [2025-04-13 20:37:52,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 80 transitions, 434 flow [2025-04-13 20:37:52,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 414 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-04-13 20:37:52,566 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 192 flow [2025-04-13 20:37:52,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-04-13 20:37:52,567 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2025-04-13 20:37:52,567 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 192 flow [2025-04-13 20:37:52,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:52,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:52,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:52,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:37:52,567 INFO L403 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)] === [2025-04-13 20:37:52,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1325544927, now seen corresponding path program 1 times [2025-04-13 20:37:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:52,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193363587] [2025-04-13 20:37:52,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:52,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:37:52,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:37:52,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:52,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:52,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:52,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193363587] [2025-04-13 20:37:52,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193363587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:52,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:52,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:52,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794971126] [2025-04-13 20:37:52,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:52,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:52,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:52,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:52,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:52,782 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-04-13 20:37:52,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:52,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:52,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-04-13 20:37:52,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:53,071 INFO L116 PetriNetUnfolderBase]: 1675/2661 cut-off events. [2025-04-13 20:37:53,072 INFO L117 PetriNetUnfolderBase]: For 2461/2595 co-relation queries the response was YES. [2025-04-13 20:37:53,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6935 conditions, 2661 events. 1675/2661 cut-off events. For 2461/2595 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14993 event pairs, 241 based on Foata normal form. 254/2842 useless extension candidates. Maximal degree in co-relation 5730. Up to 1489 conditions per place. [2025-04-13 20:37:53,084 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 60 selfloop transitions, 5 changer transitions 1/80 dead transitions. [2025-04-13 20:37:53,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 80 transitions, 424 flow [2025-04-13 20:37:53,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-04-13 20:37:53,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-04-13 20:37:53,085 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 192 flow. Second operand 6 states and 165 transitions. [2025-04-13 20:37:53,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 80 transitions, 424 flow [2025-04-13 20:37:53,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 400 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-04-13 20:37:53,087 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 182 flow [2025-04-13 20:37:53,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2025-04-13 20:37:53,088 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2025-04-13 20:37:53,088 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 182 flow [2025-04-13 20:37:53,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:53,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:53,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:53,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:37:53,088 INFO L403 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)] === [2025-04-13 20:37:53,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash -300616501, now seen corresponding path program 1 times [2025-04-13 20:37:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:53,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316959025] [2025-04-13 20:37:53,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:53,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:53,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 20:37:53,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:37:53,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:53,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:37:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:53,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316959025] [2025-04-13 20:37:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316959025] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:53,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166678073] [2025-04-13 20:37:53,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:53,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:53,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:37:53,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:37:53,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 20:37:53,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:37:53,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:53,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:53,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:37:53,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:37:53,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:37:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166678073] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:53,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:37:53,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-13 20:37:53,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190692098] [2025-04-13 20:37:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:53,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:37:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:53,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:37:53,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:37:53,452 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-04-13 20:37:53,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:53,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:53,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-04-13 20:37:53,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:53,868 INFO L116 PetriNetUnfolderBase]: 2193/3356 cut-off events. [2025-04-13 20:37:53,869 INFO L117 PetriNetUnfolderBase]: For 3275/3498 co-relation queries the response was YES. [2025-04-13 20:37:53,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8982 conditions, 3356 events. 2193/3356 cut-off events. For 3275/3498 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18545 event pairs, 311 based on Foata normal form. 296/3624 useless extension candidates. Maximal degree in co-relation 8955. Up to 1219 conditions per place. [2025-04-13 20:37:53,891 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 75 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2025-04-13 20:37:53,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 543 flow [2025-04-13 20:37:53,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2025-04-13 20:37:53,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-04-13 20:37:53,892 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 182 flow. Second operand 6 states and 182 transitions. [2025-04-13 20:37:53,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 543 flow [2025-04-13 20:37:53,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 100 transitions, 517 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-04-13 20:37:53,895 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 257 flow [2025-04-13 20:37:53,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-04-13 20:37:53,896 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-04-13 20:37:53,896 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 257 flow [2025-04-13 20:37:53,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:53,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:53,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:53,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:37:54,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 20:37:54,097 INFO L403 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)] === [2025-04-13 20:37:54,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:54,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1124366731, now seen corresponding path program 2 times [2025-04-13 20:37:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:54,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796423237] [2025-04-13 20:37:54,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:37:54,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:54,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:37:54,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 41 statements. [2025-04-13 20:37:54,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:37:54,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:37:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:54,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796423237] [2025-04-13 20:37:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796423237] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:54,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993470835] [2025-04-13 20:37:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:54,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:37:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:54,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:37:54,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:37:54,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-04-13 20:37:54,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:54,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:54,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-04-13 20:37:54,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:54,967 INFO L116 PetriNetUnfolderBase]: 6747/8981 cut-off events. [2025-04-13 20:37:54,967 INFO L117 PetriNetUnfolderBase]: For 14227/14649 co-relation queries the response was YES. [2025-04-13 20:37:54,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28533 conditions, 8981 events. 6747/8981 cut-off events. For 14227/14649 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 49167 event pairs, 602 based on Foata normal form. 604/9532 useless extension candidates. Maximal degree in co-relation 28504. Up to 3031 conditions per place. [2025-04-13 20:37:55,031 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 125 selfloop transitions, 24 changer transitions 0/160 dead transitions. [2025-04-13 20:37:55,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 160 transitions, 1124 flow [2025-04-13 20:37:55,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:37:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:37:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2025-04-13 20:37:55,033 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5801749271137027 [2025-04-13 20:37:55,033 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 257 flow. Second operand 7 states and 199 transitions. [2025-04-13 20:37:55,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 160 transitions, 1124 flow [2025-04-13 20:37:55,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 160 transitions, 1119 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:55,048 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 462 flow [2025-04-13 20:37:55,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=462, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2025-04-13 20:37:55,049 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2025-04-13 20:37:55,049 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 462 flow [2025-04-13 20:37:55,049 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:55,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:55,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:55,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:37:55,049 INFO L403 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)] === [2025-04-13 20:37:55,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1449175047, now seen corresponding path program 3 times [2025-04-13 20:37:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:55,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796339606] [2025-04-13 20:37:55,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:37:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:55,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:37:55,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 41 statements. [2025-04-13 20:37:55,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:37:55,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:55,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796339606] [2025-04-13 20:37:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796339606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:55,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:55,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949298553] [2025-04-13 20:37:55,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:55,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:37:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:55,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:37:55,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:37:55,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-04-13 20:37:55,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 462 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:55,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:55,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-04-13 20:37:55,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:56,363 INFO L116 PetriNetUnfolderBase]: 11894/15894 cut-off events. [2025-04-13 20:37:56,363 INFO L117 PetriNetUnfolderBase]: For 38519/39321 co-relation queries the response was YES. [2025-04-13 20:37:56,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58925 conditions, 15894 events. 11894/15894 cut-off events. For 38519/39321 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 92209 event pairs, 811 based on Foata normal form. 944/16786 useless extension candidates. Maximal degree in co-relation 58892. Up to 4530 conditions per place. [2025-04-13 20:37:56,475 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 126 selfloop transitions, 36 changer transitions 0/173 dead transitions. [2025-04-13 20:37:56,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 173 transitions, 1461 flow [2025-04-13 20:37:56,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-04-13 20:37:56,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-04-13 20:37:56,476 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 462 flow. Second operand 6 states and 178 transitions. [2025-04-13 20:37:56,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 173 transitions, 1461 flow [2025-04-13 20:37:56,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 173 transitions, 1435 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:56,518 INFO L231 Difference]: Finished difference. Result has 82 places, 106 transitions, 922 flow [2025-04-13 20:37:56,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=82, PETRI_TRANSITIONS=106} [2025-04-13 20:37:56,518 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2025-04-13 20:37:56,518 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 106 transitions, 922 flow [2025-04-13 20:37:56,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:56,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:56,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:56,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:37:56,519 INFO L403 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)] === [2025-04-13 20:37:56,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1513619565, now seen corresponding path program 1 times [2025-04-13 20:37:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:56,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803898256] [2025-04-13 20:37:56,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:56,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 20:37:56,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:37:56,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:56,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:56,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803898256] [2025-04-13 20:37:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803898256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:37:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444412942] [2025-04-13 20:37:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:56,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:37:56,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:56,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:37:56,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:37:56,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-04-13 20:37:56,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 106 transitions, 922 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:56,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:56,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-04-13 20:37:56,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:57,786 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_1| 0) (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_1|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][89], [Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 15#thread2EXITtrue, Black: 60#(= ~total~0 0), 257#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 48#L58true, 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 11#L144-4true, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:57,787 INFO L286 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-04-13 20:37:57,787 INFO L289 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-04-13 20:37:57,787 INFO L289 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-04-13 20:37:57,787 INFO L289 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-04-13 20:37:57,787 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L111-->L115: Formula: (and (<= 0 (+ v_~total~0_155 2147483648)) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) (<= v_~total~0_156 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| v_~total~0_156) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= v_~total~0_155 2147483647) (not (= (ite (and (< v_~q2_front~0_149 v_~n2~0_132) (< v_~q2_front~0_149 v_~q2_back~0_161) (<= 0 v_~q2_front~0_149)) 1 0) 0)) (= (+ v_~total~0_156 (select (select |v_#memory_int#1_156| v_~q2~0.base_169) (+ v_~q2~0.offset_169 (* v_~q2_front~0_149 4)))) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_155 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q2_front~0_149 1) v_~q2_front~0_148)) InVars {~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_149, ~q2~0.base=v_~q2~0.base_169, #memory_int#1=|v_#memory_int#1_156|, ~q2_back~0=v_~q2_back~0_161, ~total~0=v_~total~0_156} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_148, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_156|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, ~total~0=v_~total~0_155, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_169, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_161} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][178], [2#L79true, Black: 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 60#(= ~total~0 0), 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), 48#L58true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), 40#L115true, Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 255#true, 11#L144-4true, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:57,787 INFO L286 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-04-13 20:37:57,787 INFO L289 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-04-13 20:37:57,787 INFO L289 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-04-13 20:37:57,787 INFO L289 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-04-13 20:37:58,052 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_1| 0) (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_1|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][89], [32#L145true, Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 15#thread2EXITtrue, Black: 60#(= ~total~0 0), 257#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 48#L58true, 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,053 INFO L286 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L111-->L115: Formula: (and (<= 0 (+ v_~total~0_155 2147483648)) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) (<= v_~total~0_156 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| v_~total~0_156) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= v_~total~0_155 2147483647) (not (= (ite (and (< v_~q2_front~0_149 v_~n2~0_132) (< v_~q2_front~0_149 v_~q2_back~0_161) (<= 0 v_~q2_front~0_149)) 1 0) 0)) (= (+ v_~total~0_156 (select (select |v_#memory_int#1_156| v_~q2~0.base_169) (+ v_~q2~0.offset_169 (* v_~q2_front~0_149 4)))) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_155 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q2_front~0_149 1) v_~q2_front~0_148)) InVars {~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_149, ~q2~0.base=v_~q2~0.base_169, #memory_int#1=|v_#memory_int#1_156|, ~q2_back~0=v_~q2_back~0_161, ~total~0=v_~total~0_156} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_148, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_156|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, ~total~0=v_~total~0_155, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_169, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_161} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][178], [2#L79true, 32#L145true, Black: 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 60#(= ~total~0 0), 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), 48#L58true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), 40#L115true, Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 255#true, Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,053 INFO L286 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([940] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_170| v_~f~0.base_166) (+ v_~f~0.offset_166 (* v_~j~0_137 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_178) (< v_~q2_back~0_178 v_~n2~0_148)) 1 0) 0)) (= v_~j~0_136 (+ v_~j~0_137 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#1_170| v_~q2~0.base_179) (+ v_~q2~0.offset_179 (* 4 v_~q2_back~0_178)))) 0) 1 0) 0)) (= (+ v_~q2_back~0_178 1) v_~q2_back~0_177) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (< v_~q2_back~0_178 2147483647) 1 0) 0)))) InVars {~j~0=v_~j~0_137, ~n2~0=v_~n2~0_148, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, ~q2~0.base=v_~q2~0.base_179, #memory_int#1=|v_#memory_int#1_170|, ~q2_back~0=v_~q2_back~0_178, ~f~0.offset=v_~f~0.offset_166} OutVars{~j~0=v_~j~0_136, ~n2~0=v_~n2~0_148, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, #memory_int#1=|v_#memory_int#1_170|, ~f~0.offset=v_~f~0.offset_166, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_1|, ~q2~0.base=v_~q2~0.base_179, ~q2_back~0=v_~q2_back~0_177} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~q2_back~0][122], [2#L79true, 32#L145true, Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 60#(= ~total~0 0), 48#L58true, 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 255#true, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,053 INFO L286 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,053 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,056 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([940] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_170| v_~f~0.base_166) (+ v_~f~0.offset_166 (* v_~j~0_137 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_178) (< v_~q2_back~0_178 v_~n2~0_148)) 1 0) 0)) (= v_~j~0_136 (+ v_~j~0_137 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#1_170| v_~q2~0.base_179) (+ v_~q2~0.offset_179 (* 4 v_~q2_back~0_178)))) 0) 1 0) 0)) (= (+ v_~q2_back~0_178 1) v_~q2_back~0_177) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (< v_~q2_back~0_178 2147483647) 1 0) 0)))) InVars {~j~0=v_~j~0_137, ~n2~0=v_~n2~0_148, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, ~q2~0.base=v_~q2~0.base_179, #memory_int#1=|v_#memory_int#1_170|, ~q2_back~0=v_~q2_back~0_178, ~f~0.offset=v_~f~0.offset_166} OutVars{~j~0=v_~j~0_136, ~n2~0=v_~n2~0_148, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, #memory_int#1=|v_#memory_int#1_170|, ~f~0.offset=v_~f~0.offset_166, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_1|, ~q2~0.base=v_~q2~0.base_179, ~q2_back~0=v_~q2_back~0_177} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~q2_back~0][122], [2#L79true, Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 60#(= ~total~0 0), 48#L58true, 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 255#true, 11#L144-4true, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,056 INFO L286 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,056 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,056 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,056 INFO L289 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-04-13 20:37:58,181 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_1| 0) (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_1|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][89], [Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 15#thread2EXITtrue, Black: 60#(= ~total~0 0), 257#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 11#L144-4true, 13#thread1EXITtrue, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,182 INFO L286 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L111-->L115: Formula: (and (<= 0 (+ v_~total~0_155 2147483648)) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) (<= v_~total~0_156 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| v_~total~0_156) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= v_~total~0_155 2147483647) (not (= (ite (and (< v_~q2_front~0_149 v_~n2~0_132) (< v_~q2_front~0_149 v_~q2_back~0_161) (<= 0 v_~q2_front~0_149)) 1 0) 0)) (= (+ v_~total~0_156 (select (select |v_#memory_int#1_156| v_~q2~0.base_169) (+ v_~q2~0.offset_169 (* v_~q2_front~0_149 4)))) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_155 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q2_front~0_149 1) v_~q2_front~0_148)) InVars {~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_149, ~q2~0.base=v_~q2~0.base_169, #memory_int#1=|v_#memory_int#1_156|, ~q2_back~0=v_~q2_back~0_161, ~total~0=v_~total~0_156} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_148, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_156|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, ~total~0=v_~total~0_155, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_169, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_161} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][178], [2#L79true, Black: 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 60#(= ~total~0 0), 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), 40#L115true, Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 255#true, 11#L144-4true, 13#thread1EXITtrue, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,182 INFO L286 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([940] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_170| v_~f~0.base_166) (+ v_~f~0.offset_166 (* v_~j~0_137 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_178) (< v_~q2_back~0_178 v_~n2~0_148)) 1 0) 0)) (= v_~j~0_136 (+ v_~j~0_137 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#1_170| v_~q2~0.base_179) (+ v_~q2~0.offset_179 (* 4 v_~q2_back~0_178)))) 0) 1 0) 0)) (= (+ v_~q2_back~0_178 1) v_~q2_back~0_177) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (< v_~q2_back~0_178 2147483647) 1 0) 0)))) InVars {~j~0=v_~j~0_137, ~n2~0=v_~n2~0_148, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, ~q2~0.base=v_~q2~0.base_179, #memory_int#1=|v_#memory_int#1_170|, ~q2_back~0=v_~q2_back~0_178, ~f~0.offset=v_~f~0.offset_166} OutVars{~j~0=v_~j~0_136, ~n2~0=v_~n2~0_148, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, #memory_int#1=|v_#memory_int#1_170|, ~f~0.offset=v_~f~0.offset_166, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_1|, ~q2~0.base=v_~q2~0.base_179, ~q2_back~0=v_~q2_back~0_177} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~q2_back~0][122], [2#L79true, Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 60#(= ~total~0 0), 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 255#true, Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 11#L144-4true, 13#thread1EXITtrue, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,182 INFO L286 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,182 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,315 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_1| 0) (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_1|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][89], [32#L145true, Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 15#thread2EXITtrue, Black: 60#(= ~total~0 0), 257#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 13#thread1EXITtrue, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,316 INFO L286 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L111-->L115: Formula: (and (<= 0 (+ v_~total~0_155 2147483648)) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) (<= v_~total~0_156 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| v_~total~0_156) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= v_~total~0_155 2147483647) (not (= (ite (and (< v_~q2_front~0_149 v_~n2~0_132) (< v_~q2_front~0_149 v_~q2_back~0_161) (<= 0 v_~q2_front~0_149)) 1 0) 0)) (= (+ v_~total~0_156 (select (select |v_#memory_int#1_156| v_~q2~0.base_169) (+ v_~q2~0.offset_169 (* v_~q2_front~0_149 4)))) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_155 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q2_front~0_149 1) v_~q2_front~0_148)) InVars {~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_149, ~q2~0.base=v_~q2~0.base_169, #memory_int#1=|v_#memory_int#1_156|, ~q2_back~0=v_~q2_back~0_161, ~total~0=v_~total~0_156} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_148, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_156|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, ~total~0=v_~total~0_155, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_169, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_161} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][178], [2#L79true, Black: 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), 32#L145true, Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 60#(= ~total~0 0), 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), 40#L115true, Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 255#true, Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 13#thread1EXITtrue, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,316 INFO L286 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([940] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_170| v_~f~0.base_166) (+ v_~f~0.offset_166 (* v_~j~0_137 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_178) (< v_~q2_back~0_178 v_~n2~0_148)) 1 0) 0)) (= v_~j~0_136 (+ v_~j~0_137 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#1_170| v_~q2~0.base_179) (+ v_~q2~0.offset_179 (* 4 v_~q2_back~0_178)))) 0) 1 0) 0)) (= (+ v_~q2_back~0_178 1) v_~q2_back~0_177) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (< v_~q2_back~0_178 2147483647) 1 0) 0)))) InVars {~j~0=v_~j~0_137, ~n2~0=v_~n2~0_148, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, ~q2~0.base=v_~q2~0.base_179, #memory_int#1=|v_#memory_int#1_170|, ~q2_back~0=v_~q2_back~0_178, ~f~0.offset=v_~f~0.offset_166} OutVars{~j~0=v_~j~0_136, ~n2~0=v_~n2~0_148, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, #memory_int#1=|v_#memory_int#1_170|, ~f~0.offset=v_~f~0.offset_166, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_1|, ~q2~0.base=v_~q2~0.base_179, ~q2_back~0=v_~q2_back~0_177} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~q2_back~0][122], [2#L79true, 32#L145true, Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 60#(= ~total~0 0), 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 255#true, 13#thread1EXITtrue, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,316 INFO L286 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,316 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L82-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_1| 0) (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_1| 0)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_1|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][89], [Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 47#L145-1true, Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 15#thread2EXITtrue, Black: 60#(= ~total~0 0), 257#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,431 INFO L286 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] L111-->L115: Formula: (and (<= 0 (+ v_~total~0_155 2147483648)) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) (<= v_~total~0_156 |v_thread4Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| v_~total~0_156) (<= |v_thread4Thread1of1ForFork1_plus_#res#1_1| 2147483647)) 1 0) 0)) (<= v_~total~0_155 2147483647) (not (= (ite (and (< v_~q2_front~0_149 v_~n2~0_132) (< v_~q2_front~0_149 v_~q2_back~0_161) (<= 0 v_~q2_front~0_149)) 1 0) 0)) (= (+ v_~total~0_156 (select (select |v_#memory_int#1_156| v_~q2~0.base_169) (+ v_~q2~0.offset_169 (* v_~q2_front~0_149 4)))) |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= v_~total~0_155 |v_thread4Thread1of1ForFork1_plus_#res#1_1|) (= (+ v_~q2_front~0_149 1) v_~q2_front~0_148)) InVars {~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_149, ~q2~0.base=v_~q2~0.base_169, #memory_int#1=|v_#memory_int#1_156|, ~q2_back~0=v_~q2_back~0_161, ~total~0=v_~total~0_156} OutVars{thread4Thread1of1ForFork1_plus_#in~b#1=|v_thread4Thread1of1ForFork1_plus_#in~b#1_1|, ~n2~0=v_~n2~0_132, ~q2~0.offset=v_~q2~0.offset_169, ~q2_front~0=v_~q2_front~0_148, thread4Thread1of1ForFork1_plus_~b#1=|v_thread4Thread1of1ForFork1_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_156|, thread4Thread1of1ForFork1_#t~post15#1=|v_thread4Thread1of1ForFork1_#t~post15#1_1|, ~total~0=v_~total~0_155, thread4Thread1of1ForFork1_#t~mem13#1=|v_thread4Thread1of1ForFork1_#t~mem13#1_1|, thread4Thread1of1ForFork1_plus_#in~a#1=|v_thread4Thread1of1ForFork1_plus_#in~a#1_1|, thread4Thread1of1ForFork1_#t~ret14#1=|v_thread4Thread1of1ForFork1_#t~ret14#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_plus_#res#1=|v_thread4Thread1of1ForFork1_plus_#res#1_1|, thread4Thread1of1ForFork1_plus_~a#1=|v_thread4Thread1of1ForFork1_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_169, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~q2_back~0=v_~q2_back~0_161} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_plus_#in~b#1, thread4Thread1of1ForFork1_#t~mem13#1, thread4Thread1of1ForFork1_plus_#in~a#1, thread4Thread1of1ForFork1_#t~ret14#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_plus_#res#1, thread4Thread1of1ForFork1_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork1_plus_~b#1, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork1_#t~post15#1, ~total~0][178], [2#L79true, Black: 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), 47#L145-1true, Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 60#(= ~total~0 0), 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, Black: 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), 40#L115true, Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), 255#true, Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,431 INFO L286 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([940] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_170| v_~f~0.base_166) (+ v_~f~0.offset_166 (* v_~j~0_137 4))))) (and (not (= (ite (and (<= 0 v_~q2_back~0_178) (< v_~q2_back~0_178 v_~n2~0_148)) 1 0) 0)) (= v_~j~0_136 (+ v_~j~0_137 1)) (not (= (ite (= (+ .cse0 (select (select |v_#memory_int#1_170| v_~q2~0.base_179) (+ v_~q2~0.offset_179 (* 4 v_~q2_back~0_178)))) 0) 1 0) 0)) (= (+ v_~q2_back~0_178 1) v_~q2_back~0_177) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (< v_~q2_back~0_178 2147483647) 1 0) 0)))) InVars {~j~0=v_~j~0_137, ~n2~0=v_~n2~0_148, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, ~q2~0.base=v_~q2~0.base_179, #memory_int#1=|v_#memory_int#1_170|, ~q2_back~0=v_~q2_back~0_178, ~f~0.offset=v_~f~0.offset_166} OutVars{~j~0=v_~j~0_136, ~n2~0=v_~n2~0_148, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~f~0.base=v_~f~0.base_166, ~q2~0.offset=v_~q2~0.offset_179, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, #memory_int#1=|v_#memory_int#1_170|, ~f~0.offset=v_~f~0.offset_166, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~mem5#1=|v_thread2Thread1of1ForFork2_#t~mem5#1_1|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_1|, ~q2~0.base=v_~q2~0.base_179, ~q2_back~0=v_~q2_back~0_177} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_#t~mem5#1, thread2Thread1of1ForFork2_#t~post8#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post9#1, ~q2_back~0][122], [2#L79true, Black: 275#(or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))), 47#L145-1true, Black: 279#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 118#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 64#(<= ~q1_back~0 ~q1_front~0), Black: 68#(<= ~q2_back~0 ~q2_front~0), Black: 267#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 277#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 60#(= ~total~0 0), 19#L118true, Black: 78#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 261#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 264#(and (<= (+ ~j~0 1) ~N~0) (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 23#L100true, 248#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0)), Black: 259#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 167#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 122#(<= ~q2_front~0 ~q2_back~0), Black: 250#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0)), Black: 111#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 72#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 291#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 276#(and (or (and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)) (< ~N~0 (+ ~j~0 1))) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), 255#true, Black: 88#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2025-04-13 20:37:58,431 INFO L286 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-04-13 20:37:58,431 INFO L289 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-04-13 20:37:58,903 INFO L116 PetriNetUnfolderBase]: 16937/26108 cut-off events. [2025-04-13 20:37:58,903 INFO L117 PetriNetUnfolderBase]: For 105811/113051 co-relation queries the response was YES. [2025-04-13 20:37:59,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102742 conditions, 26108 events. 16937/26108 cut-off events. For 105811/113051 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 196565 event pairs, 2449 based on Foata normal form. 3607/28877 useless extension candidates. Maximal degree in co-relation 102704. Up to 7786 conditions per place. [2025-04-13 20:37:59,142 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 154 selfloop transitions, 11 changer transitions 0/215 dead transitions. [2025-04-13 20:37:59,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 215 transitions, 2252 flow [2025-04-13 20:37:59,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:37:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:37:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2025-04-13 20:37:59,143 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2025-04-13 20:37:59,143 INFO L175 Difference]: Start difference. First operand has 82 places, 106 transitions, 922 flow. Second operand 6 states and 186 transitions. [2025-04-13 20:37:59,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 215 transitions, 2252 flow [2025-04-13 20:37:59,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 215 transitions, 2234 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-13 20:37:59,310 INFO L231 Difference]: Finished difference. Result has 91 places, 114 transitions, 993 flow [2025-04-13 20:37:59,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=993, PETRI_PLACES=91, PETRI_TRANSITIONS=114} [2025-04-13 20:37:59,310 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2025-04-13 20:37:59,310 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 993 flow [2025-04-13 20:37:59,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:59,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:59,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:59,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:37:59,311 INFO L403 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)] === [2025-04-13 20:37:59,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash -37096023, now seen corresponding path program 4 times [2025-04-13 20:37:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:59,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945530458] [2025-04-13 20:37:59,311 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:37:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:59,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:37:59,339 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:37:59,340 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:37:59,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:37:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:59,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945530458] [2025-04-13 20:37:59,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945530458] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:59,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615365590] [2025-04-13 20:37:59,535 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:37:59,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:59,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:59,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:37:59,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:37:59,598 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:37:59,631 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:37:59,631 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:37:59,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:59,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:37:59,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:37:59,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:38:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615365590] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:38:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 16 [2025-04-13 20:38:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413029924] [2025-04-13 20:38:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:00,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:38:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:00,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:38:00,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:38:00,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-04-13 20:38:00,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 114 transitions, 993 flow. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 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) [2025-04-13 20:38:00,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:00,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-04-13 20:38:00,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:06,812 INFO L116 PetriNetUnfolderBase]: 53125/75725 cut-off events. [2025-04-13 20:38:06,813 INFO L117 PetriNetUnfolderBase]: For 353588/367640 co-relation queries the response was YES. [2025-04-13 20:38:07,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334600 conditions, 75725 events. 53125/75725 cut-off events. For 353588/367640 co-relation queries the response was YES. Maximal size of possible extension queue 3536. Compared 559199 event pairs, 822 based on Foata normal form. 12196/86987 useless extension candidates. Maximal degree in co-relation 334556. Up to 30147 conditions per place. [2025-04-13 20:38:07,707 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 186 selfloop transitions, 108 changer transitions 0/315 dead transitions. [2025-04-13 20:38:07,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 315 transitions, 3277 flow [2025-04-13 20:38:07,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:38:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:38:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 293 transitions. [2025-04-13 20:38:07,708 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5435992578849722 [2025-04-13 20:38:07,708 INFO L175 Difference]: Start difference. First operand has 91 places, 114 transitions, 993 flow. Second operand 11 states and 293 transitions. [2025-04-13 20:38:07,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 315 transitions, 3277 flow [2025-04-13 20:38:09,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 315 transitions, 3268 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 20:38:09,847 INFO L231 Difference]: Finished difference. Result has 110 places, 194 transitions, 2408 flow [2025-04-13 20:38:09,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2408, PETRI_PLACES=110, PETRI_TRANSITIONS=194} [2025-04-13 20:38:09,847 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2025-04-13 20:38:09,847 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 194 transitions, 2408 flow [2025-04-13 20:38:09,847 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 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) [2025-04-13 20:38:09,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:09,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:38:09,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:38:10,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:38:10,048 INFO L403 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)] === [2025-04-13 20:38:10,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1897978901, now seen corresponding path program 2 times [2025-04-13 20:38:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:10,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769555047] [2025-04-13 20:38:10,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:10,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:38:10,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:38:10,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:10,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:38:10,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:10,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769555047] [2025-04-13 20:38:10,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769555047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:10,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303411389] [2025-04-13 20:38:10,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:10,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:10,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:10,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:38:10,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:38:10,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:38:10,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:10,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:10,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:38:10,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:38:10,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:38:10,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303411389] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:10,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:38:10,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 14 [2025-04-13 20:38:10,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682856199] [2025-04-13 20:38:10,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:10,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:38:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:10,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:38:10,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:38:10,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-04-13 20:38:10,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 194 transitions, 2408 flow. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 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) [2025-04-13 20:38:10,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:10,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-04-13 20:38:10,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:19,737 INFO L116 PetriNetUnfolderBase]: 64059/90866 cut-off events. [2025-04-13 20:38:19,737 INFO L117 PetriNetUnfolderBase]: For 666289/677289 co-relation queries the response was YES. [2025-04-13 20:38:20,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454517 conditions, 90866 events. 64059/90866 cut-off events. For 666289/677289 co-relation queries the response was YES. Maximal size of possible extension queue 3703. Compared 662977 event pairs, 5943 based on Foata normal form. 8788/99014 useless extension candidates. Maximal degree in co-relation 454462. Up to 38251 conditions per place. [2025-04-13 20:38:20,975 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 454 selfloop transitions, 94 changer transitions 0/570 dead transitions. [2025-04-13 20:38:20,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 570 transitions, 8285 flow [2025-04-13 20:38:20,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:38:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:38:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 375 transitions. [2025-04-13 20:38:20,977 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-04-13 20:38:20,977 INFO L175 Difference]: Start difference. First operand has 110 places, 194 transitions, 2408 flow. Second operand 15 states and 375 transitions. [2025-04-13 20:38:20,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 570 transitions, 8285 flow [2025-04-13 20:38:25,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 570 transitions, 8193 flow, removed 46 selfloop flow, removed 0 redundant places. [2025-04-13 20:38:25,036 INFO L231 Difference]: Finished difference. Result has 135 places, 262 transitions, 3778 flow [2025-04-13 20:38:25,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2374, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3778, PETRI_PLACES=135, PETRI_TRANSITIONS=262} [2025-04-13 20:38:25,036 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 85 predicate places. [2025-04-13 20:38:25,036 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 262 transitions, 3778 flow [2025-04-13 20:38:25,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 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) [2025-04-13 20:38:25,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:25,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:38:25,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:38:25,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:25,241 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:38:25,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash 429759199, now seen corresponding path program 5 times [2025-04-13 20:38:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:25,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111865847] [2025-04-13 20:38:25,242 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:38:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:25,252 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:38:25,261 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:38:25,261 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:25,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:38:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:25,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111865847] [2025-04-13 20:38:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111865847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:38:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:38:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:38:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153224614] [2025-04-13 20:38:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:25,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:38:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:25,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:38:25,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:38:25,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-04-13 20:38:25,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 262 transitions, 3778 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:38:25,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:25,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-04-13 20:38:25,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:35,084 INFO L116 PetriNetUnfolderBase]: 49625/75390 cut-off events. [2025-04-13 20:38:35,084 INFO L117 PetriNetUnfolderBase]: For 902679/918813 co-relation queries the response was YES. [2025-04-13 20:38:35,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443257 conditions, 75390 events. 49625/75390 cut-off events. For 902679/918813 co-relation queries the response was YES. Maximal size of possible extension queue 3371. Compared 610478 event pairs, 7335 based on Foata normal form. 10495/84604 useless extension candidates. Maximal degree in co-relation 443189. Up to 47955 conditions per place. [2025-04-13 20:38:36,290 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 217 selfloop transitions, 89 changer transitions 0/353 dead transitions. [2025-04-13 20:38:36,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 353 transitions, 5544 flow [2025-04-13 20:38:36,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:38:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:38:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2025-04-13 20:38:36,292 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5539358600583091 [2025-04-13 20:38:36,292 INFO L175 Difference]: Start difference. First operand has 135 places, 262 transitions, 3778 flow. Second operand 7 states and 190 transitions. [2025-04-13 20:38:36,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 353 transitions, 5544 flow [2025-04-13 20:38:40,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 353 transitions, 5414 flow, removed 41 selfloop flow, removed 4 redundant places. [2025-04-13 20:38:40,326 INFO L231 Difference]: Finished difference. Result has 138 places, 295 transitions, 4542 flow [2025-04-13 20:38:40,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3624, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4542, PETRI_PLACES=138, PETRI_TRANSITIONS=295} [2025-04-13 20:38:40,327 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 88 predicate places. [2025-04-13 20:38:40,327 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 295 transitions, 4542 flow [2025-04-13 20:38:40,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:38:40,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:40,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:38:40,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:38:40,327 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:38:40,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash -941630066, now seen corresponding path program 1 times [2025-04-13 20:38:40,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:40,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377919008] [2025-04-13 20:38:40,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:40,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 20:38:40,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 20:38:40,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:40,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:41,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:41,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377919008] [2025-04-13 20:38:41,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377919008] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:41,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376719163] [2025-04-13 20:38:41,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:41,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:41,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:42,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:38:42,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 20:38:42,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 20:38:42,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:42,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:42,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:38:42,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:42,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:38:42,249 INFO L354 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 [2025-04-13 20:38:42,301 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:38:42,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:38:42,351 INFO L354 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 [2025-04-13 20:38:42,833 INFO L325 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-04-13 20:38:42,833 INFO L354 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 42 [2025-04-13 20:38:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:38:42,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:47,625 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:47,625 INFO L354 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 155 treesize of output 95 [2025-04-13 20:38:47,705 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:47,705 INFO L354 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 322 treesize of output 478 [2025-04-13 20:38:47,808 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:47,808 INFO L354 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 226 treesize of output 370