/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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 23:23:49,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 23:23:49,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 23:23:49,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 23:23:49,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 23:23:49,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 23:23:49,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 23:23:49,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 23:23:49,336 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 23:23:49,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 23:23:49,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 23:23:49,337 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 23:23:49,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 23:23:49,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 23:23:49,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 23:23:49,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 23:23:49,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:23:49,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 23:23:49,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 23:23:49,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 23:23:49,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 23:23:49,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 23:23:49,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 23:23:49,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 23:23:49,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 23:23:49,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2025-03-14 23:23:50,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7442e5a01/f81b89a593c24ef7878df46fee645eca/FLAGbc63a3bc3 [2025-03-14 23:23:50,964 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 23:23:50,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2025-03-14 23:23:50,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7442e5a01/f81b89a593c24ef7878df46fee645eca/FLAGbc63a3bc3 [2025-03-14 23:23:51,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7442e5a01/f81b89a593c24ef7878df46fee645eca [2025-03-14 23:23:51,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 23:23:51,332 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 23:23:51,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 23:23:51,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 23:23:51,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 23:23:51,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19541f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51, skipping insertion in model container [2025-03-14 23:23:51,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 23:23:51,468 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-three-array-max.wvr.c[2862,2875] [2025-03-14 23:23:51,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:23:51,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 23:23:51,510 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-three-array-max.wvr.c[2862,2875] [2025-03-14 23:23:51,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:23:51,532 INFO L204 MainTranslator]: Completed translation [2025-03-14 23:23:51,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51 WrapperNode [2025-03-14 23:23:51,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 23:23:51,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 23:23:51,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 23:23:51,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 23:23:51,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,564 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 210 [2025-03-14 23:23:51,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 23:23:51,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 23:23:51,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 23:23:51,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 23:23:51,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 23:23:51,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 23:23:51,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 23:23:51,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 23:23:51,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (1/1) ... [2025-03-14 23:23:51,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:23:51,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:23:51,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 23:23:51,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 23:23:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 23:23:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 23:23:51,650 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 23:23:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 23:23:51,650 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 23:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 23:23:51,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 23:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 23:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 23:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 23:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 23:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 23:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 23:23:51,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 23:23:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 23:23:51,652 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 23:23:51,739 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 23:23:51,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 23:23:52,079 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 23:23:52,079 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 23:23:52,136 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 23:23:52,136 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 23:23:52,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:23:52 BoogieIcfgContainer [2025-03-14 23:23:52,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 23:23:52,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 23:23:52,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 23:23:52,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 23:23:52,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 11:23:51" (1/3) ... [2025-03-14 23:23:52,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462dfe47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:23:52, skipping insertion in model container [2025-03-14 23:23:52,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:51" (2/3) ... [2025-03-14 23:23:52,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462dfe47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:23:52, skipping insertion in model container [2025-03-14 23:23:52,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:23:52" (3/3) ... [2025-03-14 23:23:52,145 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-03-14 23:23:52,155 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 23:23:52,156 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 286 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 23:23:52,157 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 23:23:52,244 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 23:23:52,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 23:23:52,296 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7b57c586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 23:23:52,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 23:23:52,389 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 23:23:52,389 INFO L124 PetriNetUnfolderBase]: 21/297 cut-off events. [2025-03-14 23:23:52,391 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 23:23:52,391 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:52,391 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:23:52,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:23:52,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash 223878685, now seen corresponding path program 1 times [2025-03-14 23:23:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:52,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999998672] [2025-03-14 23:23:52,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:52,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:23:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:53,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999998672] [2025-03-14 23:23:53,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999998672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:53,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:53,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 23:23:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237174669] [2025-03-14 23:23:53,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:53,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 23:23:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:53,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 23:23:53,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-14 23:23:53,187 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 306 [2025-03-14 23:23:53,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 306 transitions, 633 flow. Second operand has 8 states, 8 states have (on average 167.75) internal successors, (1342), 8 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:23:53,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:53,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 306 [2025-03-14 23:23:53,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:53,551 INFO L124 PetriNetUnfolderBase]: 202/812 cut-off events. [2025-03-14 23:23:53,551 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-14 23:23:53,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 812 events. 202/812 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3400 event pairs, 103 based on Foata normal form. 13/678 useless extension candidates. Maximal degree in co-relation 822. Up to 304 conditions per place. [2025-03-14 23:23:53,567 INFO L140 encePairwiseOnDemand]: 269/306 looper letters, 118 selfloop transitions, 21 changer transitions 12/298 dead transitions. [2025-03-14 23:23:53,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 298 transitions, 916 flow [2025-03-14 23:23:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 23:23:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 23:23:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1399 transitions. [2025-03-14 23:23:53,584 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5714869281045751 [2025-03-14 23:23:53,586 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, -1 predicate places. [2025-03-14 23:23:53,586 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 298 transitions, 916 flow [2025-03-14 23:23:53,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.75) internal successors, (1342), 8 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:23:53,587 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:53,587 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:23:53,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 23:23:53,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:23:53,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash -20481215, now seen corresponding path program 1 times [2025-03-14 23:23:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:53,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507810846] [2025-03-14 23:23:53,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 23:23:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:54,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507810846] [2025-03-14 23:23:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507810846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:54,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-14 23:23:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018419722] [2025-03-14 23:23:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:54,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 23:23:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:54,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 23:23:54,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2025-03-14 23:23:54,510 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 306 [2025-03-14 23:23:54,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 298 transitions, 916 flow. Second operand has 21 states, 21 states have (on average 149.9047619047619) internal successors, (3148), 21 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:23:54,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:54,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 306 [2025-03-14 23:23:54,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:55,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][201], [201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:23:55,667 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,671 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,671 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,671 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][202], [201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:23:55,671 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,671 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,671 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,671 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][201], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true]) [2025-03-14 23:23:55,672 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,672 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,672 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,672 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][202], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 149#L48-5true]) [2025-03-14 23:23:55,672 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,672 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,672 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,672 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][201], [101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:23:55,674 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,675 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,675 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,675 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][202], [101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:23:55,675 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,675 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,675 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,675 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][201], [thread2Thread1of1ForFork2InUse, 194#L62true, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true]) [2025-03-14 23:23:55,680 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,680 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,680 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,680 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][202], [thread2Thread1of1ForFork2InUse, 194#L62true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 149#L48-5true]) [2025-03-14 23:23:55,680 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,680 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,680 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:55,680 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:55,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([825] L62-->L65: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork2_~i~1#1_9| 4))) (let ((.cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int_66| v_~A~0.base_22) (+ .cse0 v_~A~0.offset_22))) (.cse3 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483648)))) (and (= |v_#memory_int_65| (store |v_#memory_int_66| v_~C~0.base_24 (store (select |v_#memory_int_66| v_~C~0.base_24) (+ v_~C~0.offset_24 .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| (+ .cse1 (select (select |v_#memory_int_66| v_~B~0.base_20) (+ v_~B~0.offset_20 .cse0)))) .cse2 (not (= (ite (or .cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse1)) 1 0) 0)) .cse3 (not (= (ite (or (<= .cse1 |v_thread2Thread1of1ForFork2_plus_#res#1_1|) .cse3) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_9| 1) v_~p~0_11)))) InVars {~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, ~C~0.base=v_~C~0.base_24, #memory_int=|v_#memory_int_66|, ~C~0.offset=v_~C~0.offset_24, ~B~0.offset=v_~B~0.offset_20} OutVars{~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #memory_int=|v_#memory_int_65|, ~C~0.offset=v_~C~0.offset_24, ~p~0=v_~p~0_11, ~B~0.offset=v_~B~0.offset_20, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][277], [60#L65true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 230#L53-2true]) [2025-03-14 23:23:55,961 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-03-14 23:23:55,961 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:23:55,961 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:55,961 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:55,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([825] L62-->L65: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork2_~i~1#1_9| 4))) (let ((.cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int_66| v_~A~0.base_22) (+ .cse0 v_~A~0.offset_22))) (.cse3 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483648)))) (and (= |v_#memory_int_65| (store |v_#memory_int_66| v_~C~0.base_24 (store (select |v_#memory_int_66| v_~C~0.base_24) (+ v_~C~0.offset_24 .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| (+ .cse1 (select (select |v_#memory_int_66| v_~B~0.base_20) (+ v_~B~0.offset_20 .cse0)))) .cse2 (not (= (ite (or .cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse1)) 1 0) 0)) .cse3 (not (= (ite (or (<= .cse1 |v_thread2Thread1of1ForFork2_plus_#res#1_1|) .cse3) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_9| 1) v_~p~0_11)))) InVars {~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, ~C~0.base=v_~C~0.base_24, #memory_int=|v_#memory_int_66|, ~C~0.offset=v_~C~0.offset_24, ~B~0.offset=v_~B~0.offset_20} OutVars{~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #memory_int=|v_#memory_int_65|, ~C~0.offset=v_~C~0.offset_24, ~p~0=v_~p~0_11, ~B~0.offset=v_~B~0.offset_20, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][277], [60#L65true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 230#L53-2true]) [2025-03-14 23:23:55,961 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2025-03-14 23:23:55,961 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:55,961 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:23:55,961 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:55,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][307], [201#L61-5true, 99#L82true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 230#L53-2true]) [2025-03-14 23:23:55,991 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-14 23:23:55,991 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:23:55,991 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:23:55,991 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-14 23:23:55,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][307], [99#L82true, thread2Thread1of1ForFork2InUse, 194#L62true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 230#L53-2true]) [2025-03-14 23:23:55,992 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-14 23:23:55,992 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:23:55,992 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2025-03-14 23:23:55,992 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:23:57,008 INFO L124 PetriNetUnfolderBase]: 1820/4821 cut-off events. [2025-03-14 23:23:57,008 INFO L125 PetriNetUnfolderBase]: For 1485/1632 co-relation queries the response was YES. [2025-03-14 23:23:57,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9394 conditions, 4821 events. 1820/4821 cut-off events. For 1485/1632 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 40543 event pairs, 715 based on Foata normal form. 0/3778 useless extension candidates. Maximal degree in co-relation 8091. Up to 2334 conditions per place. [2025-03-14 23:23:57,040 INFO L140 encePairwiseOnDemand]: 261/306 looper letters, 224 selfloop transitions, 53 changer transitions 76/500 dead transitions. [2025-03-14 23:23:57,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 500 transitions, 2302 flow [2025-03-14 23:23:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-14 23:23:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2025-03-14 23:23:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 10288 transitions. [2025-03-14 23:23:57,061 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4872596381547788 [2025-03-14 23:23:57,062 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 67 predicate places. [2025-03-14 23:23:57,062 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 500 transitions, 2302 flow [2025-03-14 23:23:57,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.9047619047619) internal successors, (3148), 21 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:23:57,064 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:57,064 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:23:57,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 23:23:57,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:23:57,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash 405874371, now seen corresponding path program 1 times [2025-03-14 23:23:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:57,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271745499] [2025-03-14 23:23:57,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:23:57,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:57,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271745499] [2025-03-14 23:23:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271745499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:23:57,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206526667] [2025-03-14 23:23:57,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:57,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:23:57,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:23:57,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:23:57,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 23:23:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:57,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:23:57,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:23:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:23:57,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:23:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:23:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206526667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:23:57,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:23:57,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-14 23:23:57,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283385823] [2025-03-14 23:23:57,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:23:57,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 23:23:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:57,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 23:23:57,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:23:57,961 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 306 [2025-03-14 23:23:57,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 500 transitions, 2302 flow. Second operand has 19 states, 19 states have (on average 228.73684210526315) internal successors, (4346), 19 states have internal predecessors, (4346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:23:57,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:57,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 306 [2025-03-14 23:23:57,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:58,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true]) [2025-03-14 23:23:58,589 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,589 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,589 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,589 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true]) [2025-03-14 23:23:58,589 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,589 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,589 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,589 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true]) [2025-03-14 23:23:58,590 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,590 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,590 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,590 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true]) [2025-03-14 23:23:58,590 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,590 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,590 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,590 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,592 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true]) [2025-03-14 23:23:58,592 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,592 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,592 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,592 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,592 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,592 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true]) [2025-03-14 23:23:58,592 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,592 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,593 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,593 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,593 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([825] L62-->L65: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork2_~i~1#1_9| 4))) (let ((.cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int_66| v_~A~0.base_22) (+ .cse0 v_~A~0.offset_22))) (.cse3 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483648)))) (and (= |v_#memory_int_65| (store |v_#memory_int_66| v_~C~0.base_24 (store (select |v_#memory_int_66| v_~C~0.base_24) (+ v_~C~0.offset_24 .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| (+ .cse1 (select (select |v_#memory_int_66| v_~B~0.base_20) (+ v_~B~0.offset_20 .cse0)))) .cse2 (not (= (ite (or .cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse1)) 1 0) 0)) .cse3 (not (= (ite (or (<= .cse1 |v_thread2Thread1of1ForFork2_plus_#res#1_1|) .cse3) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_9| 1) v_~p~0_11)))) InVars {~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, ~C~0.base=v_~C~0.base_24, #memory_int=|v_#memory_int_66|, ~C~0.offset=v_~C~0.offset_24, ~B~0.offset=v_~B~0.offset_20} OutVars{~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #memory_int=|v_#memory_int_65|, ~C~0.offset=v_~C~0.offset_24, ~p~0=v_~p~0_11, ~B~0.offset=v_~B~0.offset_20, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][368], [60#L65true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true, 230#L53-2true]) [2025-03-14 23:23:58,593 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,593 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-14 23:23:58,593 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true]) [2025-03-14 23:23:58,594 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true]) [2025-03-14 23:23:58,594 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-14 23:23:58,594 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:23:58,605 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,605 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,605 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,605 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:23:58,605 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:23:58,606 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:23:58,606 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,606 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,608 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:23:58,608 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,608 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,608 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [201#L61-5true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:23:58,609 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([825] L62-->L65: Formula: (let ((.cse0 (* |v_thread2Thread1of1ForFork2_~i~1#1_9| 4))) (let ((.cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int_66| v_~A~0.base_22) (+ .cse0 v_~A~0.offset_22))) (.cse3 (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_1| 2147483648)))) (and (= |v_#memory_int_65| (store |v_#memory_int_66| v_~C~0.base_24 (store (select |v_#memory_int_66| v_~C~0.base_24) (+ v_~C~0.offset_24 .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| (+ .cse1 (select (select |v_#memory_int_66| v_~B~0.base_20) (+ v_~B~0.offset_20 .cse0)))) .cse2 (not (= (ite (or .cse2 (<= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse1)) 1 0) 0)) .cse3 (not (= (ite (or (<= .cse1 |v_thread2Thread1of1ForFork2_plus_#res#1_1|) .cse3) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork2_~i~1#1_9| 1) v_~p~0_11)))) InVars {~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, ~C~0.base=v_~C~0.base_24, #memory_int=|v_#memory_int_66|, ~C~0.offset=v_~C~0.offset_24, ~B~0.offset=v_~B~0.offset_20} OutVars{~A~0.base=v_~A~0.base_22, ~B~0.base=v_~B~0.base_20, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_9|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_22, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, #memory_int=|v_#memory_int_65|, ~C~0.offset=v_~C~0.offset_24, ~p~0=v_~p~0_11, ~B~0.offset=v_~B~0.offset_20, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][368], [60#L65true, 461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 230#L53-2true]) [2025-03-14 23:23:58,609 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-14 23:23:58,609 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][341], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:23:58,610 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][342], [461#(and (<= ~N~0 1) (= thread3Thread1of1ForFork0_~i~2 1)), 101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:23:58,610 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-14 23:23:58,610 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-14 23:23:59,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true, 453#true]) [2025-03-14 23:23:59,249 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:23:59,249 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:23:59,249 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:23:59,249 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true, 453#true]) [2025-03-14 23:23:59,250 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 252#L73-1true, 453#true]) [2025-03-14 23:23:59,250 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 252#L73-1true, 453#true]) [2025-03-14 23:23:59,250 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:23:59,250 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:23:59,251 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:23:59,251 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 23:23:59,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][411], [201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 1381#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:23:59,288 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,288 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,288 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,288 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][412], [201#L61-5true, 101#L87true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 1381#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:23:59,288 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,288 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,288 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,288 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 453#true]) [2025-03-14 23:23:59,289 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 149#L48-5true, 453#true]) [2025-03-14 23:23:59,289 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][411], [101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 1381#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 104#L49true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true]) [2025-03-14 23:23:59,290 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][412], [101#L87true, 194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 1381#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true]) [2025-03-14 23:23:59,290 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 129#L74true, 453#true]) [2025-03-14 23:23:59,290 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 129#L74true, 453#true]) [2025-03-14 23:23:59,291 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,291 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,291 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-14 23:23:59,291 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-14 23:23:59,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 104#L49true, 16#L76true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 453#true]) [2025-03-14 23:23:59,360 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-14 23:23:59,360 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:23:59,360 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [201#L61-5true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 16#L76true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 453#true]) [2025-03-14 23:23:59,361 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L48-4-->L49: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][379], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), 16#L76true, 104#L49true, thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 453#true]) [2025-03-14 23:23:59,361 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:23:59,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L48-4-->L48-5: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork1_~i~0_3) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][380], [194#L62true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 16#L76true, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 98#L108-4true, 149#L48-5true, 453#true]) [2025-03-14 23:23:59,361 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-14 23:23:59,362 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:23:59,362 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:23:59,362 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:23:59,657 INFO L124 PetriNetUnfolderBase]: 3788/9065 cut-off events. [2025-03-14 23:23:59,658 INFO L125 PetriNetUnfolderBase]: For 7315/12215 co-relation queries the response was YES. [2025-03-14 23:23:59,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22746 conditions, 9065 events. 3788/9065 cut-off events. For 7315/12215 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 77266 event pairs, 1346 based on Foata normal form. 37/7125 useless extension candidates. Maximal degree in co-relation 14635. Up to 4455 conditions per place. [2025-03-14 23:23:59,808 INFO L140 encePairwiseOnDemand]: 268/306 looper letters, 171 selfloop transitions, 67 changer transitions 90/643 dead transitions. [2025-03-14 23:23:59,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 643 transitions, 3620 flow [2025-03-14 23:23:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 23:23:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 23:23:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4440 transitions. [2025-03-14 23:23:59,825 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7636738906088751 [2025-03-14 23:23:59,827 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 85 predicate places. [2025-03-14 23:23:59,827 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 643 transitions, 3620 flow [2025-03-14 23:23:59,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 228.73684210526315) internal successors, (4346), 19 states have internal predecessors, (4346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:23:59,829 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:59,829 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:23:59,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 23:24:00,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:00,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:00,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash 715091524, now seen corresponding path program 1 times [2025-03-14 23:24:00,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:00,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939347661] [2025-03-14 23:24:00,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:00,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:00,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939347661] [2025-03-14 23:24:00,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939347661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:00,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109540421] [2025-03-14 23:24:00,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:00,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:00,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:00,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:24:00,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 23:24:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:00,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:00,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:00,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 23:24:00,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109540421] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:24:00,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:24:00,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-14 23:24:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33627452] [2025-03-14 23:24:00,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:24:00,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 23:24:00,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:00,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 23:24:00,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:24:00,951 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 306 [2025-03-14 23:24:00,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 643 transitions, 3620 flow. Second operand has 19 states, 19 states have (on average 224.8421052631579) internal successors, (4272), 19 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:00,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:00,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 306 [2025-03-14 23:24:00,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:02,389 INFO L124 PetriNetUnfolderBase]: 3944/8752 cut-off events. [2025-03-14 23:24:02,389 INFO L125 PetriNetUnfolderBase]: For 11237/12236 co-relation queries the response was YES. [2025-03-14 23:24:02,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26029 conditions, 8752 events. 3944/8752 cut-off events. For 11237/12236 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 73612 event pairs, 1666 based on Foata normal form. 5/6951 useless extension candidates. Maximal degree in co-relation 22146. Up to 4066 conditions per place. [2025-03-14 23:24:02,446 INFO L140 encePairwiseOnDemand]: 267/306 looper letters, 157 selfloop transitions, 38 changer transitions 182/668 dead transitions. [2025-03-14 23:24:02,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 668 transitions, 4382 flow [2025-03-14 23:24:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 23:24:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 23:24:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4368 transitions. [2025-03-14 23:24:02,450 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7512899896800825 [2025-03-14 23:24:02,451 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 103 predicate places. [2025-03-14 23:24:02,451 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 668 transitions, 4382 flow [2025-03-14 23:24:02,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 224.8421052631579) internal successors, (4272), 19 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:02,452 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:02,452 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:02,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 23:24:02,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-14 23:24:02,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:02,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash 704667343, now seen corresponding path program 2 times [2025-03-14 23:24:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741950374] [2025-03-14 23:24:02,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:24:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:02,677 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 23:24:02,678 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:02,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741950374] [2025-03-14 23:24:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741950374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:24:02,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:24:02,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 23:24:02,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569380829] [2025-03-14 23:24:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:02,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 23:24:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:02,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 23:24:02,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 23:24:02,760 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 306 [2025-03-14 23:24:02,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 668 transitions, 4382 flow. Second operand has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:02,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:02,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 306 [2025-03-14 23:24:02,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:05,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L73-1-->L87: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][466], [101#L87true, thread2Thread1of1ForFork2InUse, 1381#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 70#L61-3true, 1980#true, 312#true, 169#L50-1true, 98#L108-4true, 3537#true]) [2025-03-14 23:24:05,761 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-14 23:24:05,762 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:05,762 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:05,762 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:05,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([834] L73-1-->L74: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][467], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 70#L61-3true, 312#true, 1980#true, 169#L50-1true, 98#L108-4true, 3537#true, 129#L74true, 453#true]) [2025-03-14 23:24:05,762 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-14 23:24:05,762 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:05,762 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:05,762 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-14 23:24:05,862 INFO L124 PetriNetUnfolderBase]: 11309/22859 cut-off events. [2025-03-14 23:24:05,862 INFO L125 PetriNetUnfolderBase]: For 40483/44583 co-relation queries the response was YES. [2025-03-14 23:24:05,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76958 conditions, 22859 events. 11309/22859 cut-off events. For 40483/44583 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 213789 event pairs, 3219 based on Foata normal form. 131/19022 useless extension candidates. Maximal degree in co-relation 70013. Up to 9667 conditions per place. [2025-03-14 23:24:06,033 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 253 selfloop transitions, 15 changer transitions 250/901 dead transitions. [2025-03-14 23:24:06,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 901 transitions, 7366 flow [2025-03-14 23:24:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:24:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:24:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2025-03-14 23:24:06,035 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9161220043572985 [2025-03-14 23:24:06,035 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 108 predicate places. [2025-03-14 23:24:06,035 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 901 transitions, 7366 flow [2025-03-14 23:24:06,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:06,036 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:06,036 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:06,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 23:24:06,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:06,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:06,038 INFO L85 PathProgramCache]: Analyzing trace with hash 622678003, now seen corresponding path program 3 times [2025-03-14 23:24:06,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:06,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589249283] [2025-03-14 23:24:06,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:24:06,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:06,061 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 23:24:06,062 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:06,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:06,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589249283] [2025-03-14 23:24:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589249283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:24:06,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:24:06,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 23:24:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58856450] [2025-03-14 23:24:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:06,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 23:24:06,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:06,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 23:24:06,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 23:24:06,133 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 306 [2025-03-14 23:24:06,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 901 transitions, 7366 flow. Second operand has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:06,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:06,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 306 [2025-03-14 23:24:06,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:08,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][699], [thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 138#L68true, 1980#true, 98#L108-4true, 3546#(= thread3Thread1of1ForFork0_~i~2 1), 230#L53-2true, 453#true]) [2025-03-14 23:24:08,473 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:08,473 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:08,473 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:08,473 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:10,391 INFO L124 PetriNetUnfolderBase]: 14837/29787 cut-off events. [2025-03-14 23:24:10,391 INFO L125 PetriNetUnfolderBase]: For 69356/78080 co-relation queries the response was YES. [2025-03-14 23:24:10,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118082 conditions, 29787 events. 14837/29787 cut-off events. For 69356/78080 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 282818 event pairs, 3357 based on Foata normal form. 694/25213 useless extension candidates. Maximal degree in co-relation 100322. Up to 12517 conditions per place. [2025-03-14 23:24:10,752 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 384 selfloop transitions, 26 changer transitions 277/1070 dead transitions. [2025-03-14 23:24:10,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1070 transitions, 10353 flow [2025-03-14 23:24:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:24:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:24:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1682 transitions. [2025-03-14 23:24:10,754 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9161220043572985 [2025-03-14 23:24:10,755 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 113 predicate places. [2025-03-14 23:24:10,755 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 1070 transitions, 10353 flow [2025-03-14 23:24:10,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:10,755 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:10,756 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:10,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 23:24:10,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:10,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1982652177, now seen corresponding path program 4 times [2025-03-14 23:24:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:10,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086274118] [2025-03-14 23:24:10,757 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:24:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:10,790 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:24:10,790 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086274118] [2025-03-14 23:24:10,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086274118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626449140] [2025-03-14 23:24:10,975 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:24:10,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:10,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:10,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:24:10,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 23:24:11,082 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:24:11,082 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:11,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:11,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:11,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:11,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626449140] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:11,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:24:11,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 22 [2025-03-14 23:24:11,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255576419] [2025-03-14 23:24:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:11,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:24:11,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:11,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:24:11,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-14 23:24:11,549 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 306 [2025-03-14 23:24:11,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 1070 transitions, 10353 flow. Second operand has 9 states, 9 states have (on average 227.66666666666666) internal successors, (2049), 9 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:11,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:11,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 306 [2025-03-14 23:24:11,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:15,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L73-1-->L87: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][841], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3539#(= |thread2Thread1of1ForFork2_~i~1#1| 1), 3544#true, 171#L61-4true, 101#L87true, 1381#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 169#L50-1true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0))]) [2025-03-14 23:24:15,917 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2025-03-14 23:24:15,917 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:15,917 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 23:24:15,917 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:15,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([834] L73-1-->L74: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][842], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3539#(= |thread2Thread1of1ForFork2_~i~1#1| 1), 3544#true, 171#L61-4true, 169#L50-1true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 129#L74true, 453#true]) [2025-03-14 23:24:15,917 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2025-03-14 23:24:15,917 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:15,917 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 23:24:15,917 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:15,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L73-1-->L87: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][841], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3539#(= |thread2Thread1of1ForFork2_~i~1#1| 1), 3544#true, 101#L87true, 1381#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 1980#true, 169#L50-1true, 98#L108-4true, 22#L61-2true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0))]) [2025-03-14 23:24:15,959 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 23:24:15,959 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 23:24:15,959 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:15,959 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:15,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([834] L73-1-->L74: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][842], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3539#(= |thread2Thread1of1ForFork2_~i~1#1| 1), 3544#true, 169#L50-1true, 1980#true, 98#L108-4true, 22#L61-2true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 129#L74true, 453#true]) [2025-03-14 23:24:15,959 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-14 23:24:15,959 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:15,959 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 23:24:15,959 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:15,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L73-1-->L87: Formula: (<= v_~N~0_6 v_thread3Thread1of1ForFork0_~i~2_3) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][806], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 70#L61-3true, 312#true, 3537#true, 3544#true, 101#L87true, 1381#(<= ~N~0 thread3Thread1of1ForFork0_~i~2), 169#L50-1true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0))]) [2025-03-14 23:24:15,996 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-14 23:24:15,996 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 23:24:15,996 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 23:24:15,996 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 23:24:15,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([834] L73-1-->L74: Formula: (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][807], [thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 70#L61-3true, 312#true, 3537#true, 3544#true, 1980#true, 169#L50-1true, 98#L108-4true, 129#L74true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 453#true]) [2025-03-14 23:24:15,996 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-14 23:24:15,996 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 23:24:15,996 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 23:24:15,996 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 23:24:16,131 INFO L124 PetriNetUnfolderBase]: 15273/30710 cut-off events. [2025-03-14 23:24:16,131 INFO L125 PetriNetUnfolderBase]: For 90835/101717 co-relation queries the response was YES. [2025-03-14 23:24:16,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135925 conditions, 30710 events. 15273/30710 cut-off events. For 90835/101717 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 289250 event pairs, 2757 based on Foata normal form. 349/25994 useless extension candidates. Maximal degree in co-relation 121354. Up to 12624 conditions per place. [2025-03-14 23:24:16,436 INFO L140 encePairwiseOnDemand]: 272/306 looper letters, 552 selfloop transitions, 24 changer transitions 373/1291 dead transitions. [2025-03-14 23:24:16,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1291 transitions, 14947 flow [2025-03-14 23:24:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:24:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:24:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2340 transitions. [2025-03-14 23:24:16,438 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2025-03-14 23:24:16,438 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 122 predicate places. [2025-03-14 23:24:16,438 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 1291 transitions, 14947 flow [2025-03-14 23:24:16,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 227.66666666666666) internal successors, (2049), 9 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:16,439 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:16,439 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:16,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 23:24:16,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:16,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:16,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:16,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1553312306, now seen corresponding path program 2 times [2025-03-14 23:24:16,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:16,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395082426] [2025-03-14 23:24:16,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:24:16,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:16,657 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 23:24:16,657 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:16,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:16,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395082426] [2025-03-14 23:24:16,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395082426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:24:16,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:24:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 23:24:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722513361] [2025-03-14 23:24:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:16,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 23:24:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:16,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 23:24:16,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-14 23:24:16,732 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 306 [2025-03-14 23:24:16,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1291 transitions, 14947 flow. Second operand has 6 states, 6 states have (on average 265.1666666666667) internal successors, (1591), 6 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:16,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:16,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 306 [2025-03-14 23:24:16,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:20,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][968], [189#L50-2true, thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5214#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 453#true]) [2025-03-14 23:24:20,182 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-14 23:24:20,182 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-14 23:24:20,182 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:20,182 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-14 23:24:21,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][968], [99#L82true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5214#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 230#L53-2true, 453#true]) [2025-03-14 23:24:21,419 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:21,419 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:21,419 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:21,419 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:26,608 INFO L124 PetriNetUnfolderBase]: 29824/56936 cut-off events. [2025-03-14 23:24:26,608 INFO L125 PetriNetUnfolderBase]: For 220699/239285 co-relation queries the response was YES. [2025-03-14 23:24:26,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284385 conditions, 56936 events. 29824/56936 cut-off events. For 220699/239285 co-relation queries the response was YES. Maximal size of possible extension queue 2085. Compared 566425 event pairs, 4024 based on Foata normal form. 635/49022 useless extension candidates. Maximal degree in co-relation 255890. Up to 25228 conditions per place. [2025-03-14 23:24:27,409 INFO L140 encePairwiseOnDemand]: 299/306 looper letters, 1053 selfloop transitions, 31 changer transitions 379/1847 dead transitions. [2025-03-14 23:24:27,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1847 transitions, 25059 flow [2025-03-14 23:24:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:24:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:24:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1665 transitions. [2025-03-14 23:24:27,410 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9068627450980392 [2025-03-14 23:24:27,411 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 127 predicate places. [2025-03-14 23:24:27,411 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 1847 transitions, 25059 flow [2025-03-14 23:24:27,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 265.1666666666667) internal successors, (1591), 6 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:27,411 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:27,411 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 23:24:27,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:27,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash -838916692, now seen corresponding path program 3 times [2025-03-14 23:24:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885289787] [2025-03-14 23:24:27,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:24:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:27,467 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:24:27,467 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885289787] [2025-03-14 23:24:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885289787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171724186] [2025-03-14 23:24:27,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:24:27,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:27,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:27,552 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:24:27,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 23:24:27,647 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:24:27,647 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:27,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 23:24:27,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:27,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:24:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171724186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:24:27,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:24:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-14 23:24:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740699663] [2025-03-14 23:24:27,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:24:27,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:24:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:27,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:24:27,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-14 23:24:27,734 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 306 [2025-03-14 23:24:27,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 1847 transitions, 25059 flow. Second operand has 9 states, 9 states have (on average 265.3333333333333) internal successors, (2388), 9 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:27,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:27,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 306 [2025-03-14 23:24:27,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:31,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][1109], [189#L50-2true, 99#L82true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5214#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 5220#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 453#true]) [2025-03-14 23:24:31,198 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-14 23:24:31,198 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:31,198 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-14 23:24:31,198 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-14 23:24:33,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][1109], [thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5214#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 230#L53-2true, 5220#(and (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1)), 453#true]) [2025-03-14 23:24:33,068 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-03-14 23:24:33,068 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:33,068 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-14 23:24:33,068 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-14 23:24:37,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][1887], [189#L50-2true, thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5221#(<= 2 ~N~0), 5211#true, 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 3546#(= thread3Thread1of1ForFork0_~i~2 1), 453#true]) [2025-03-14 23:24:37,553 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-14 23:24:37,553 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:24:37,553 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-14 23:24:37,553 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-14 23:24:38,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L78-->L82: Formula: (let ((.cse0 (select (select |v_#memory_int_71| v_~C~0.base_28) (+ v_~C~0.offset_28 (* v_thread3Thread1of1ForFork0_~i~2_9 4))))) (or (and (= v_~maxc~0_25 .cse0) (<= v_~maxc~0_26 .cse0)) (and (< .cse0 v_~maxc~0_26) (= v_~maxc~0_26 v_~maxc~0_25) (= |v_thread3Thread1of1ForFork0_#t~mem11_2| |v_thread3Thread1of1ForFork0_#t~mem11_1|)))) InVars {~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~maxc~0=v_~maxc~0_26, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~C~0.base=v_~C~0.base_28} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~C~0.base=v_~C~0.base_28, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_28, #memory_int=|v_#memory_int_71|, ~maxc~0=v_~maxc~0_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~maxc~0][1887], [thread2Thread1of1ForFork2InUse, 99#L82true, thread3Thread1of1ForFork0InUse, 302#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 312#true, 3537#true, 5221#(<= 2 ~N~0), 5211#true, 138#L68true, 1980#true, 98#L108-4true, 5210#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (<= 2 ~N~0)), 230#L53-2true, 3546#(= thread3Thread1of1ForFork0_~i~2 1), 453#true]) [2025-03-14 23:24:38,728 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-14 23:24:38,728 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 23:24:38,728 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 23:24:38,728 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-14 23:24:40,831 INFO L124 PetriNetUnfolderBase]: 36530/67637 cut-off events. [2025-03-14 23:24:40,831 INFO L125 PetriNetUnfolderBase]: For 330672/353662 co-relation queries the response was YES. [2025-03-14 23:24:41,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391086 conditions, 67637 events. 36530/67637 cut-off events. For 330672/353662 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 672491 event pairs, 2811 based on Foata normal form. 1812/58849 useless extension candidates. Maximal degree in co-relation 376595. Up to 31383 conditions per place. [2025-03-14 23:24:41,700 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 1497 selfloop transitions, 205 changer transitions 431/2517 dead transitions. [2025-03-14 23:24:41,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 2517 transitions, 39514 flow [2025-03-14 23:24:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 23:24:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 23:24:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3829 transitions. [2025-03-14 23:24:41,702 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8937908496732027 [2025-03-14 23:24:41,702 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 140 predicate places. [2025-03-14 23:24:41,702 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 2517 transitions, 39514 flow [2025-03-14 23:24:41,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 265.3333333333333) internal successors, (2388), 9 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:41,703 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:41,703 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:41,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 23:24:41,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:41,904 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1683638261, now seen corresponding path program 1 times [2025-03-14 23:24:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:41,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009617861] [2025-03-14 23:24:41,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 23:24:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009617861] [2025-03-14 23:24:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009617861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163945912] [2025-03-14 23:24:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:42,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:42,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:42,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:24:42,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 23:24:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:42,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:42,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 23:24:42,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 23:24:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163945912] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:24:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2025-03-14 23:24:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14916831] [2025-03-14 23:24:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:24:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:42,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:24:42,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:24:42,564 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 306 [2025-03-14 23:24:42,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 2517 transitions, 39514 flow. Second operand has 9 states, 9 states have (on average 231.55555555555554) internal successors, (2084), 9 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:42,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:42,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 306 [2025-03-14 23:24:42,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:56,445 INFO L124 PetriNetUnfolderBase]: 31458/57870 cut-off events. [2025-03-14 23:24:56,445 INFO L125 PetriNetUnfolderBase]: For 363208/380142 co-relation queries the response was YES. [2025-03-14 23:24:56,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367609 conditions, 57870 events. 31458/57870 cut-off events. For 363208/380142 co-relation queries the response was YES. Maximal size of possible extension queue 2203. Compared 560457 event pairs, 2505 based on Foata normal form. 714/50129 useless extension candidates. Maximal degree in co-relation 332409. Up to 27092 conditions per place. [2025-03-14 23:24:57,381 INFO L140 encePairwiseOnDemand]: 272/306 looper letters, 1272 selfloop transitions, 119 changer transitions 483/2286 dead transitions. [2025-03-14 23:24:57,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 2286 transitions, 39272 flow [2025-03-14 23:24:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 23:24:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 23:24:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2605 transitions. [2025-03-14 23:24:57,384 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739156268568034 [2025-03-14 23:24:57,385 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 135 predicate places. [2025-03-14 23:24:57,385 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 2286 transitions, 39272 flow [2025-03-14 23:24:57,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 231.55555555555554) internal successors, (2084), 9 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:57,386 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:57,386 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:24:57,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 23:24:57,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-14 23:24:57,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:24:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1631214453, now seen corresponding path program 1 times [2025-03-14 23:24:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350236225] [2025-03-14 23:24:57,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:24:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350236225] [2025-03-14 23:24:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350236225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696578745] [2025-03-14 23:24:57,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:24:57,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:57,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:57,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:24:57,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 23:24:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:24:57,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:57,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:24:58,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:24:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696578745] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:24:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2025-03-14 23:24:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346616005] [2025-03-14 23:24:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:24:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:24:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:58,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:24:58,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:24:58,345 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 306 [2025-03-14 23:24:58,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 2286 transitions, 39272 flow. Second operand has 9 states, 9 states have (on average 231.66666666666666) internal successors, (2085), 9 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:24:58,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:58,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 306 [2025-03-14 23:24:58,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:25:10,477 INFO L124 PetriNetUnfolderBase]: 28180/51863 cut-off events. [2025-03-14 23:25:10,477 INFO L125 PetriNetUnfolderBase]: For 448071/466087 co-relation queries the response was YES. [2025-03-14 23:25:10,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357175 conditions, 51863 events. 28180/51863 cut-off events. For 448071/466087 co-relation queries the response was YES. Maximal size of possible extension queue 1868. Compared 493532 event pairs, 2181 based on Foata normal form. 1110/46643 useless extension candidates. Maximal degree in co-relation 344072. Up to 24232 conditions per place. [2025-03-14 23:25:11,275 INFO L140 encePairwiseOnDemand]: 272/306 looper letters, 1137 selfloop transitions, 45 changer transitions 404/2081 dead transitions. [2025-03-14 23:25:11,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 2081 transitions, 38421 flow [2025-03-14 23:25:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:25:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:25:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2374 transitions. [2025-03-14 23:25:11,277 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7758169934640523 [2025-03-14 23:25:11,278 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 144 predicate places. [2025-03-14 23:25:11,278 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 2081 transitions, 38421 flow [2025-03-14 23:25:11,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 231.66666666666666) internal successors, (2085), 9 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:25:11,278 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:25:11,278 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:25:11,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 23:25:11,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:25:11,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:25:11,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:25:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash -744202921, now seen corresponding path program 1 times [2025-03-14 23:25:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:25:11,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854617955] [2025-03-14 23:25:11,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:25:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:25:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:25:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-14 23:25:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:25:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854617955] [2025-03-14 23:25:15,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854617955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:25:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711596977] [2025-03-14 23:25:15,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:25:15,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:25:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:25:15,770 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:25:15,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 23:25:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:25:15,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-14 23:25:15,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:25:15,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 23:25:16,073 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 23:25:16,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2025-03-14 23:25:16,351 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-14 23:25:16,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-03-14 23:25:17,632 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2025-03-14 23:25:17,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 55 [2025-03-14 23:25:18,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:25:18,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 99 [2025-03-14 23:25:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:25:19,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 23:25:19,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711596977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:25:19,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 23:25:19,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [52] total 87 [2025-03-14 23:25:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870459730] [2025-03-14 23:25:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:25:19,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-14 23:25:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:25:19,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-14 23:25:19,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=7138, Unknown=0, NotChecked=0, Total=7482 [2025-03-14 23:25:19,299 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2025-03-14 23:25:19,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 2081 transitions, 38421 flow. Second operand has 45 states, 45 states have (on average 94.04444444444445) internal successors, (4232), 45 states have internal predecessors, (4232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:25:19,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:25:19,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2025-03-14 23:25:19,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:25:31,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:25:36,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:25:37,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:25:42,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 23:26:08,594 INFO L124 PetriNetUnfolderBase]: 58633/98642 cut-off events. [2025-03-14 23:26:08,594 INFO L125 PetriNetUnfolderBase]: For 934466/946952 co-relation queries the response was YES. [2025-03-14 23:26:09,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691632 conditions, 98642 events. 58633/98642 cut-off events. For 934466/946952 co-relation queries the response was YES. Maximal size of possible extension queue 2711. Compared 892832 event pairs, 7699 based on Foata normal form. 238/89255 useless extension candidates. Maximal degree in co-relation 642225. Up to 40914 conditions per place. [2025-03-14 23:26:09,911 INFO L140 encePairwiseOnDemand]: 219/306 looper letters, 3092 selfloop transitions, 355 changer transitions 592/4144 dead transitions. [2025-03-14 23:26:09,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 4144 transitions, 81211 flow [2025-03-14 23:26:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-03-14 23:26:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2025-03-14 23:26:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 10865 transitions. [2025-03-14 23:26:09,918 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.3198787022316434 [2025-03-14 23:26:09,919 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 254 predicate places. [2025-03-14 23:26:09,919 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 4144 transitions, 81211 flow [2025-03-14 23:26:09,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 94.04444444444445) internal successors, (4232), 45 states have internal predecessors, (4232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:26:09,920 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:26:09,920 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:26:09,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 23:26:10,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:26:10,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:26:10,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:26:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash 863056769, now seen corresponding path program 2 times [2025-03-14 23:26:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:26:10,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86325436] [2025-03-14 23:26:10,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:26:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:26:10,174 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:26:10,174 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:26:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 23:26:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:26:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86325436] [2025-03-14 23:26:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86325436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:26:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470788886] [2025-03-14 23:26:14,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:26:14,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:26:14,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:26:14,039 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:26:14,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 23:26:14,148 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:26:14,149 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:26:14,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-14 23:26:14,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:26:14,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 23:26:14,276 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 23:26:14,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2025-03-14 23:26:14,502 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-14 23:26:14,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-03-14 23:26:16,418 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-14 23:26:16,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 49 [2025-03-14 23:26:17,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:26:17,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 63 [2025-03-14 23:26:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:26:18,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:26:22,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:26:22,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 190 [2025-03-14 23:26:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:26:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470788886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:26:25,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:26:25,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 47, 45] total 109 [2025-03-14 23:26:25,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443355142] [2025-03-14 23:26:25,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:26:25,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2025-03-14 23:26:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:26:25,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2025-03-14 23:26:25,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=11236, Unknown=0, NotChecked=0, Total=11772 [2025-03-14 23:26:25,577 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 306 [2025-03-14 23:26:25,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 4144 transitions, 81211 flow. Second operand has 109 states, 109 states have (on average 72.78899082568807) internal successors, (7934), 109 states have internal predecessors, (7934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:26:25,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:26:25,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 306 [2025-03-14 23:26:25,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:28:11,882 INFO L124 PetriNetUnfolderBase]: 85801/146455 cut-off events. [2025-03-14 23:28:11,882 INFO L125 PetriNetUnfolderBase]: For 1500537/1516142 co-relation queries the response was YES. [2025-03-14 23:28:12,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120757 conditions, 146455 events. 85801/146455 cut-off events. For 1500537/1516142 co-relation queries the response was YES. Maximal size of possible extension queue 3986. Compared 1426494 event pairs, 6645 based on Foata normal form. 280/131513 useless extension candidates. Maximal degree in co-relation 1051807. Up to 57862 conditions per place. [2025-03-14 23:28:14,106 INFO L140 encePairwiseOnDemand]: 212/306 looper letters, 6502 selfloop transitions, 1511 changer transitions 817/8893 dead transitions. [2025-03-14 23:28:14,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 792 places, 8893 transitions, 188461 flow [2025-03-14 23:28:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2025-03-14 23:28:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2025-03-14 23:28:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 18731 transitions. [2025-03-14 23:28:14,119 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.2508705668059574 [2025-03-14 23:28:14,120 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 497 predicate places. [2025-03-14 23:28:14,120 INFO L471 AbstractCegarLoop]: Abstraction has has 792 places, 8893 transitions, 188461 flow [2025-03-14 23:28:14,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 72.78899082568807) internal successors, (7934), 109 states have internal predecessors, (7934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:28:14,122 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:28:14,122 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:28:14,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 23:28:14,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 23:28:14,323 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:28:14,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:28:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash 769519003, now seen corresponding path program 3 times [2025-03-14 23:28:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:28:14,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454109631] [2025-03-14 23:28:14,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:28:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:28:14,368 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:28:14,368 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:28:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:28:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:28:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454109631] [2025-03-14 23:28:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454109631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:28:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371704662] [2025-03-14 23:28:17,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:28:17,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:28:17,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:28:17,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:28:17,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 23:28:17,430 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:28:17,431 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:28:17,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-14 23:28:17,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:28:17,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 23:28:17,584 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 23:28:17,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2025-03-14 23:28:17,890 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-14 23:28:17,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-03-14 23:28:19,756 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-14 23:28:19,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 49 [2025-03-14 23:28:21,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:28:21,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 64 [2025-03-14 23:28:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:28:21,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:28:25,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:28:25,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 114 [2025-03-14 23:28:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:28:28,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371704662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:28:28,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:28:28,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 45, 45] total 107 [2025-03-14 23:28:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653166258] [2025-03-14 23:28:28,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:28:28,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2025-03-14 23:28:28,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:28:28,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2025-03-14 23:28:28,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=10816, Unknown=0, NotChecked=0, Total=11342 [2025-03-14 23:28:28,228 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2025-03-14 23:28:28,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 8893 transitions, 188461 flow. Second operand has 107 states, 107 states have (on average 93.57009345794393) internal successors, (10012), 107 states have internal predecessors, (10012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:28:28,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:28:28,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2025-03-14 23:28:28,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:32:55,232 INFO L124 PetriNetUnfolderBase]: 117999/201902 cut-off events. [2025-03-14 23:32:55,232 INFO L125 PetriNetUnfolderBase]: For 2258770/2282340 co-relation queries the response was YES. [2025-03-14 23:32:56,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713477 conditions, 201902 events. 117999/201902 cut-off events. For 2258770/2282340 co-relation queries the response was YES. Maximal size of possible extension queue 5214. Compared 2031582 event pairs, 3703 based on Foata normal form. 1343/181243 useless extension candidates. Maximal degree in co-relation 1609333. Up to 78548 conditions per place. [2025-03-14 23:32:58,518 INFO L140 encePairwiseOnDemand]: 216/306 looper letters, 10987 selfloop transitions, 2435 changer transitions 1222/14749 dead transitions. [2025-03-14 23:32:58,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1064 places, 14749 transitions, 339565 flow [2025-03-14 23:32:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 273 states. [2025-03-14 23:32:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2025-03-14 23:32:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 26845 transitions. [2025-03-14 23:32:58,569 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.3213507625272331 [2025-03-14 23:32:58,570 INFO L298 CegarLoopForPetriNet]: 295 programPoint places, 769 predicate places. [2025-03-14 23:32:58,570 INFO L471 AbstractCegarLoop]: Abstraction has has 1064 places, 14749 transitions, 339565 flow [2025-03-14 23:32:58,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 93.57009345794393) internal successors, (10012), 107 states have internal predecessors, (10012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:32:58,574 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:32:58,574 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:32:58,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 23:32:58,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-14 23:32:58,778 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:32:58,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:32:58,781 INFO L85 PathProgramCache]: Analyzing trace with hash 320915247, now seen corresponding path program 4 times [2025-03-14 23:32:58,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:32:58,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674502549] [2025-03-14 23:32:58,781 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:32:58,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:32:59,149 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:32:59,150 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:33:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 23:33:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:33:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674502549] [2025-03-14 23:33:07,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674502549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:33:07,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563012712] [2025-03-14 23:33:07,919 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:33:07,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:33:07,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:33:07,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:33:07,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-14 23:33:08,096 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:33:08,097 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:33:08,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-14 23:33:08,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:33:12,593 INFO L349 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2025-03-14 23:33:12,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 75 [2025-03-14 23:33:16,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:33:16,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 1 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 335 treesize of output 743 [2025-03-14 23:35:37,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2025-03-14 23:35:37,039 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-14 23:35:37,040 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-14 23:35:37,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-14 23:35:37,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 23:35:37,247 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:518) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:404) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 67 more [2025-03-14 23:35:37,257 INFO L158 Benchmark]: Toolchain (without parser) took 705925.10ms. Allocated memory was 71.3MB in the beginning and 784.3MB in the end (delta: 713.0MB). Free memory was 44.0MB in the beginning and 485.3MB in the end (delta: -441.3MB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2025-03-14 23:35:37,258 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:35:37,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.94ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 31.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 23:35:37,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.67ms. Allocated memory is still 71.3MB. Free memory was 31.4MB in the beginning and 29.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 23:35:37,258 INFO L158 Benchmark]: Boogie Preprocessor took 34.35ms. Allocated memory is still 71.3MB. Free memory was 29.3MB in the beginning and 27.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:35:37,258 INFO L158 Benchmark]: RCFGBuilder took 536.85ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 20.8MB in the end (delta: 6.8MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2025-03-14 23:35:37,259 INFO L158 Benchmark]: TraceAbstraction took 705116.24ms. Allocated memory was 71.3MB in the beginning and 784.3MB in the end (delta: 713.0MB). Free memory was 19.9MB in the beginning and 485.3MB in the end (delta: -465.4MB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2025-03-14 23:35:37,263 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.94ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 31.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.67ms. Allocated memory is still 71.3MB. Free memory was 31.4MB in the beginning and 29.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.35ms. Allocated memory is still 71.3MB. Free memory was 29.3MB in the beginning and 27.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 536.85ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 20.8MB in the end (delta: 6.8MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * TraceAbstraction took 705116.24ms. Allocated memory was 71.3MB in the beginning and 784.3MB in the end (delta: 713.0MB). Free memory was 19.9MB in the beginning and 485.3MB in the end (delta: -465.4MB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...