/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/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:32:02,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:32:02,286 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 21:32:02,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:32:02,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:32:02,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:32:02,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:32:02,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:32:02,310 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:32:02,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:32:02,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:32:02,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:32:02,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:32:02,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:32:02,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:32:02,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:32:02,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:32:02,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:32:02,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:32:02,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:32:02,312 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 21:32:02,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:32:02,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:32:02,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:32:02,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:32:02,570 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:32:02,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2025-03-14 21:32:03,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1287a1d6a/483b50bfa99a43d088b0202f516320bd/FLAGb2b09bc96 [2025-03-14 21:32:03,964 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:32:03,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2025-03-14 21:32:03,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1287a1d6a/483b50bfa99a43d088b0202f516320bd/FLAGb2b09bc96 [2025-03-14 21:32:03,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1287a1d6a/483b50bfa99a43d088b0202f516320bd [2025-03-14 21:32:03,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:32:03,998 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:32:03,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:32:03,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:32:04,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:32:04,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:32:03" (1/1) ... [2025-03-14 21:32:04,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289018a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04, skipping insertion in model container [2025-03-14 21:32:04,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:32:03" (1/1) ... [2025-03-14 21:32:04,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:32:04,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2025-03-14 21:32:04,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:32:04,356 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:32:04,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2025-03-14 21:32:04,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:32:04,501 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:32:04,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04 WrapperNode [2025-03-14 21:32:04,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:32:04,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:32:04,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:32:04,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:32:04,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,598 INFO L138 Inliner]: procedures = 277, calls = 830, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 939 [2025-03-14 21:32:04,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:32:04,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:32:04,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:32:04,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:32:04,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:32:04,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:32:04,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:32:04,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:32:04,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (1/1) ... [2025-03-14 21:32:04,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:32:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:04,698 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 21:32:04,704 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 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 21:32:04,719 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 21:32:04,719 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:32:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:32:04,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:32:04,720 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 21:32:04,814 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:32:04,816 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:32:05,721 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:32:05,721 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:32:05,761 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:32:05,761 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:32:05,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:32:05 BoogieIcfgContainer [2025-03-14 21:32:05,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:32:05,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:32:05,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:32:05,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:32:05,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:32:03" (1/3) ... [2025-03-14 21:32:05,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5583668e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:32:05, skipping insertion in model container [2025-03-14 21:32:05,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:32:04" (2/3) ... [2025-03-14 21:32:05,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5583668e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:32:05, skipping insertion in model container [2025-03-14 21:32:05,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:32:05" (3/3) ... [2025-03-14 21:32:05,769 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-03-14 21:32:05,780 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:32:05,781 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 945 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-14 21:32:05,781 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:32:05,889 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 21:32:05,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:32:05,944 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;@70f48ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:32:05,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 21:32:06,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:32:06,225 INFO L124 PetriNetUnfolderBase]: 3/921 cut-off events. [2025-03-14 21:32:06,226 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 21:32:06,226 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:06,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:06,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1986557894, now seen corresponding path program 1 times [2025-03-14 21:32:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082548970] [2025-03-14 21:32:06,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:07,532 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 21:32:07,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:07,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082548970] [2025-03-14 21:32:07,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082548970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:32:07,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:32:07,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:32:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966939177] [2025-03-14 21:32:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:32:07,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:32:07,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:07,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:32:07,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:32:07,574 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 926 out of 952 [2025-03-14 21:32:07,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 952 transitions, 1918 flow. Second operand has 3 states, 3 states have (on average 928.0) internal successors, (2784), 3 states have internal predecessors, (2784), 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 21:32:07,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:07,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 926 of 952 [2025-03-14 21:32:07,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:07,990 INFO L124 PetriNetUnfolderBase]: 145/1743 cut-off events. [2025-03-14 21:32:07,990 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-14 21:32:08,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2052 conditions, 1743 events. 145/1743 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5111 event pairs, 54 based on Foata normal form. 48/1707 useless extension candidates. Maximal degree in co-relation 1089. Up to 174 conditions per place. [2025-03-14 21:32:08,007 INFO L140 encePairwiseOnDemand]: 944/952 looper letters, 28 selfloop transitions, 3 changer transitions 6/955 dead transitions. [2025-03-14 21:32:08,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 955 transitions, 1997 flow [2025-03-14 21:32:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:32:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:32:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2819 transitions. [2025-03-14 21:32:08,025 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9870448179271709 [2025-03-14 21:32:08,027 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, -4 predicate places. [2025-03-14 21:32:08,027 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 955 transitions, 1997 flow [2025-03-14 21:32:08,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 928.0) internal successors, (2784), 3 states have internal predecessors, (2784), 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 21:32:08,029 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:08,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:08,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:32:08,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:08,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:08,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1835233876, now seen corresponding path program 1 times [2025-03-14 21:32:08,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:08,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612676595] [2025-03-14 21:32:08,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:08,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:08,863 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 21:32:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:08,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612676595] [2025-03-14 21:32:08,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612676595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:32:08,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:32:08,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 21:32:08,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795734142] [2025-03-14 21:32:08,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:32:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 21:32:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:08,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 21:32:08,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 21:32:08,871 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 930 out of 952 [2025-03-14 21:32:08,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 955 transitions, 1997 flow. Second operand has 4 states, 4 states have (on average 932.0) internal successors, (3728), 4 states have internal predecessors, (3728), 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 21:32:08,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:08,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 930 of 952 [2025-03-14 21:32:08,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:09,352 INFO L124 PetriNetUnfolderBase]: 274/2278 cut-off events. [2025-03-14 21:32:09,352 INFO L125 PetriNetUnfolderBase]: For 387/413 co-relation queries the response was YES. [2025-03-14 21:32:09,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 2278 events. 274/2278 cut-off events. For 387/413 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9453 event pairs, 86 based on Foata normal form. 4/2152 useless extension candidates. Maximal degree in co-relation 2046. Up to 288 conditions per place. [2025-03-14 21:32:09,363 INFO L140 encePairwiseOnDemand]: 947/952 looper letters, 39 selfloop transitions, 4 changer transitions 8/978 dead transitions. [2025-03-14 21:32:09,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 950 places, 978 transitions, 2191 flow [2025-03-14 21:32:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 21:32:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 21:32:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3753 transitions. [2025-03-14 21:32:09,383 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9855567226890757 [2025-03-14 21:32:09,383 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, -1 predicate places. [2025-03-14 21:32:09,384 INFO L471 AbstractCegarLoop]: Abstraction has has 950 places, 978 transitions, 2191 flow [2025-03-14 21:32:09,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 932.0) internal successors, (3728), 4 states have internal predecessors, (3728), 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 21:32:09,389 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:09,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:09,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:32:09,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:09,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash -637039738, now seen corresponding path program 1 times [2025-03-14 21:32:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517547066] [2025-03-14 21:32:09,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:09,891 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 21:32:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:09,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517547066] [2025-03-14 21:32:09,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517547066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:32:09,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:32:09,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:32:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22435298] [2025-03-14 21:32:09,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:32:09,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:32:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:09,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:32:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:32:09,899 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 926 out of 952 [2025-03-14 21:32:09,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 978 transitions, 2191 flow. Second operand has 3 states, 3 states have (on average 929.6666666666666) internal successors, (2789), 3 states have internal predecessors, (2789), 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 21:32:09,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:09,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 926 of 952 [2025-03-14 21:32:09,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:10,542 INFO L124 PetriNetUnfolderBase]: 336/2661 cut-off events. [2025-03-14 21:32:10,542 INFO L125 PetriNetUnfolderBase]: For 959/1062 co-relation queries the response was YES. [2025-03-14 21:32:10,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4317 conditions, 2661 events. 336/2661 cut-off events. For 959/1062 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11963 event pairs, 56 based on Foata normal form. 2/2511 useless extension candidates. Maximal degree in co-relation 3075. Up to 449 conditions per place. [2025-03-14 21:32:10,553 INFO L140 encePairwiseOnDemand]: 946/952 looper letters, 61 selfloop transitions, 4 changer transitions 9/997 dead transitions. [2025-03-14 21:32:10,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 952 places, 997 transitions, 2437 flow [2025-03-14 21:32:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:32:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:32:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2818 transitions. [2025-03-14 21:32:10,557 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9866946778711485 [2025-03-14 21:32:10,558 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 1 predicate places. [2025-03-14 21:32:10,558 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 997 transitions, 2437 flow [2025-03-14 21:32:10,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 929.6666666666666) internal successors, (2789), 3 states have internal predecessors, (2789), 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 21:32:10,560 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:10,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:32:10,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:10,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 438219782, now seen corresponding path program 1 times [2025-03-14 21:32:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850340154] [2025-03-14 21:32:10,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:11,141 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 21:32:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850340154] [2025-03-14 21:32:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850340154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:32:11,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:32:11,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:32:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142974710] [2025-03-14 21:32:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:32:11,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:32:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:11,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:32:11,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:32:11,147 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 932 out of 952 [2025-03-14 21:32:11,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 997 transitions, 2437 flow. Second operand has 3 states, 3 states have (on average 935.6666666666666) internal successors, (2807), 3 states have internal predecessors, (2807), 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 21:32:11,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:11,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 932 of 952 [2025-03-14 21:32:11,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:11,512 INFO L124 PetriNetUnfolderBase]: 68/1463 cut-off events. [2025-03-14 21:32:11,512 INFO L125 PetriNetUnfolderBase]: For 795/807 co-relation queries the response was YES. [2025-03-14 21:32:11,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1463 events. 68/1463 cut-off events. For 795/807 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2921 event pairs, 7 based on Foata normal form. 46/1472 useless extension candidates. Maximal degree in co-relation 1039. Up to 131 conditions per place. [2025-03-14 21:32:11,516 INFO L140 encePairwiseOnDemand]: 948/952 looper letters, 25 selfloop transitions, 13 changer transitions 8/982 dead transitions. [2025-03-14 21:32:11,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 951 places, 982 transitions, 2444 flow [2025-03-14 21:32:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:32:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:32:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2815 transitions. [2025-03-14 21:32:11,520 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9856442577030813 [2025-03-14 21:32:11,521 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 0 predicate places. [2025-03-14 21:32:11,521 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 982 transitions, 2444 flow [2025-03-14 21:32:11,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 935.6666666666666) internal successors, (2807), 3 states have internal predecessors, (2807), 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 21:32:11,522 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:11,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:11,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:32:11,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:11,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1761420872, now seen corresponding path program 1 times [2025-03-14 21:32:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611511854] [2025-03-14 21:32:11,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:12,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:12,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611511854] [2025-03-14 21:32:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611511854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:12,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467685915] [2025-03-14 21:32:12,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:12,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:12,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:12,016 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 21:32:12,018 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 21:32:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:12,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 21:32:12,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:13,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:32:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467685915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:32:14,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:32:14,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 21:32:14,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687567960] [2025-03-14 21:32:14,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:32:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:32:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:14,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:32:14,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:32:14,076 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 952 [2025-03-14 21:32:14,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 982 transitions, 2444 flow. Second operand has 10 states, 10 states have (on average 926.4) internal successors, (9264), 10 states have internal predecessors, (9264), 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 21:32:14,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:14,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 952 [2025-03-14 21:32:14,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:14,717 INFO L124 PetriNetUnfolderBase]: 132/1957 cut-off events. [2025-03-14 21:32:14,717 INFO L125 PetriNetUnfolderBase]: For 1809/1833 co-relation queries the response was YES. [2025-03-14 21:32:14,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 1957 events. 132/1957 cut-off events. For 1809/1833 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5887 event pairs, 1 based on Foata normal form. 0/1897 useless extension candidates. Maximal degree in co-relation 2015. Up to 270 conditions per place. [2025-03-14 21:32:14,724 INFO L140 encePairwiseOnDemand]: 944/952 looper letters, 103 selfloop transitions, 16 changer transitions 16/1052 dead transitions. [2025-03-14 21:32:14,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 1052 transitions, 3320 flow [2025-03-14 21:32:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:32:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:32:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11167 transitions. [2025-03-14 21:32:14,737 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9775035014005602 [2025-03-14 21:32:14,740 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 11 predicate places. [2025-03-14 21:32:14,740 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 1052 transitions, 3320 flow [2025-03-14 21:32:14,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 926.4) internal successors, (9264), 10 states have internal predecessors, (9264), 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 21:32:14,744 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:14,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:14,754 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 21:32:14,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:14,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:14,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash 249056027, now seen corresponding path program 1 times [2025-03-14 21:32:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162369642] [2025-03-14 21:32:14,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:14,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:18,517 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 21:32:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162369642] [2025-03-14 21:32:18,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162369642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:32:18,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:32:18,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-14 21:32:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88163303] [2025-03-14 21:32:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:32:18,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 21:32:18,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:18,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 21:32:18,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-03-14 21:32:18,521 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 952 [2025-03-14 21:32:18,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 1052 transitions, 3320 flow. Second operand has 24 states, 24 states have (on average 108.04166666666667) internal successors, (2593), 24 states have internal predecessors, (2593), 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 21:32:18,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:18,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 952 [2025-03-14 21:32:18,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:25,476 INFO L124 PetriNetUnfolderBase]: 375/2851 cut-off events. [2025-03-14 21:32:25,477 INFO L125 PetriNetUnfolderBase]: For 7989/8160 co-relation queries the response was YES. [2025-03-14 21:32:25,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8626 conditions, 2851 events. 375/2851 cut-off events. For 7989/8160 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 13334 event pairs, 5 based on Foata normal form. 0/2753 useless extension candidates. Maximal degree in co-relation 4751. Up to 838 conditions per place. [2025-03-14 21:32:25,489 INFO L140 encePairwiseOnDemand]: 917/952 looper letters, 1145 selfloop transitions, 52 changer transitions 67/1331 dead transitions. [2025-03-14 21:32:25,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1004 places, 1331 transitions, 7887 flow [2025-03-14 21:32:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-14 21:32:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-14 21:32:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 4176 transitions. [2025-03-14 21:32:25,508 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.10201289818252883 [2025-03-14 21:32:25,509 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 53 predicate places. [2025-03-14 21:32:25,509 INFO L471 AbstractCegarLoop]: Abstraction has has 1004 places, 1331 transitions, 7887 flow [2025-03-14 21:32:25,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 108.04166666666667) internal successors, (2593), 24 states have internal predecessors, (2593), 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 21:32:25,512 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:25,513 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:32:25,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:25,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash 185325358, now seen corresponding path program 1 times [2025-03-14 21:32:25,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:25,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314717242] [2025-03-14 21:32:25,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:28,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:28,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314717242] [2025-03-14 21:32:28,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314717242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:28,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071117334] [2025-03-14 21:32:28,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:28,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:28,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:28,936 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 21:32:28,939 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 21:32:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:29,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1904 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-14 21:32:29,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:30,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-14 21:32:30,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2025-03-14 21:32:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-14 21:32:30,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 21:32:30,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071117334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:32:30,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 21:32:30,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [26] total 46 [2025-03-14 21:32:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156247668] [2025-03-14 21:32:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:32:30,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 21:32:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:30,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 21:32:30,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1954, Unknown=0, NotChecked=0, Total=2070 [2025-03-14 21:32:30,853 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 952 [2025-03-14 21:32:30,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1004 places, 1331 transitions, 7887 flow. Second operand has 23 states, 23 states have (on average 110.69565217391305) internal successors, (2546), 23 states have internal predecessors, (2546), 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 21:32:30,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:30,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 952 [2025-03-14 21:32:30,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:40,432 INFO L124 PetriNetUnfolderBase]: 498/3779 cut-off events. [2025-03-14 21:32:40,433 INFO L125 PetriNetUnfolderBase]: For 12329/12676 co-relation queries the response was YES. [2025-03-14 21:32:40,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14250 conditions, 3779 events. 498/3779 cut-off events. For 12329/12676 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 22633 event pairs, 6 based on Foata normal form. 0/3628 useless extension candidates. Maximal degree in co-relation 9075. Up to 1340 conditions per place. [2025-03-14 21:32:40,450 INFO L140 encePairwiseOnDemand]: 917/952 looper letters, 1276 selfloop transitions, 248 changer transitions 91/1682 dead transitions. [2025-03-14 21:32:40,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1077 places, 1682 transitions, 15265 flow [2025-03-14 21:32:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-14 21:32:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-03-14 21:32:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 6380 transitions. [2025-03-14 21:32:40,464 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.09056325232795821 [2025-03-14 21:32:40,465 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 126 predicate places. [2025-03-14 21:32:40,465 INFO L471 AbstractCegarLoop]: Abstraction has has 1077 places, 1682 transitions, 15265 flow [2025-03-14 21:32:40,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 110.69565217391305) internal successors, (2546), 23 states have internal predecessors, (2546), 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 21:32:40,466 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:40,466 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:40,477 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 21:32:40,667 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,SelfDestructingSolverStorable6 [2025-03-14 21:32:40,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:40,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:40,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2130450254, now seen corresponding path program 1 times [2025-03-14 21:32:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:40,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676995877] [2025-03-14 21:32:40,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676995877] [2025-03-14 21:32:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676995877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:41,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079592300] [2025-03-14 21:32:41,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:41,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:41,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:41,175 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 21:32:41,176 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 21:32:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:41,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 21:32:41,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:42,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:32:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079592300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:32:42,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:32:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-14 21:32:42,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566228617] [2025-03-14 21:32:42,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:32:42,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 21:32:42,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:42,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 21:32:42,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-14 21:32:42,741 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 920 out of 952 [2025-03-14 21:32:42,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1077 places, 1682 transitions, 15265 flow. Second operand has 16 states, 16 states have (on average 924.5625) internal successors, (14793), 16 states have internal predecessors, (14793), 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 21:32:42,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:42,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 920 of 952 [2025-03-14 21:32:42,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:32:44,223 INFO L124 PetriNetUnfolderBase]: 619/4349 cut-off events. [2025-03-14 21:32:44,223 INFO L125 PetriNetUnfolderBase]: For 19710/20201 co-relation queries the response was YES. [2025-03-14 21:32:44,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17969 conditions, 4349 events. 619/4349 cut-off events. For 19710/20201 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 26888 event pairs, 6 based on Foata normal form. 0/4172 useless extension candidates. Maximal degree in co-relation 12097. Up to 1731 conditions per place. [2025-03-14 21:32:44,241 INFO L140 encePairwiseOnDemand]: 942/952 looper letters, 515 selfloop transitions, 115 changer transitions 96/1815 dead transitions. [2025-03-14 21:32:44,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1098 places, 1815 transitions, 18719 flow [2025-03-14 21:32:44,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 21:32:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 21:32:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 20362 transitions. [2025-03-14 21:32:44,248 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9722116119174943 [2025-03-14 21:32:44,249 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 147 predicate places. [2025-03-14 21:32:44,249 INFO L471 AbstractCegarLoop]: Abstraction has has 1098 places, 1815 transitions, 18719 flow [2025-03-14 21:32:44,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 924.5625) internal successors, (14793), 16 states have internal predecessors, (14793), 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 21:32:44,252 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:32:44,252 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:32:44,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 21:32:44,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:44,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:32:44,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:32:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2045056998, now seen corresponding path program 1 times [2025-03-14 21:32:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:32:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804790646] [2025-03-14 21:32:44,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:32:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:32:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804790646] [2025-03-14 21:32:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804790646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:32:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175641009] [2025-03-14 21:32:47,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:32:47,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:32:47,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:32:47,763 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 21:32:47,764 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 21:32:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:32:48,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-14 21:32:48,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:32:48,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-14 21:32:49,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:32:49,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-03-14 21:32:49,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2025-03-14 21:32:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:49,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:32:53,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-03-14 21:32:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:32:54,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175641009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:32:54,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:32:54,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 29] total 85 [2025-03-14 21:32:54,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612874437] [2025-03-14 21:32:54,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:32:54,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-03-14 21:32:54,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:32:54,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-03-14 21:32:54,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=6837, Unknown=1, NotChecked=0, Total=7140 [2025-03-14 21:32:54,021 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 952 [2025-03-14 21:32:54,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1098 places, 1815 transitions, 18719 flow. Second operand has 85 states, 85 states have (on average 104.3529411764706) internal successors, (8870), 85 states have internal predecessors, (8870), 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 21:32:54,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:32:54,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 952 [2025-03-14 21:32:54,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:33:25,546 INFO L124 PetriNetUnfolderBase]: 1215/8572 cut-off events. [2025-03-14 21:33:25,546 INFO L125 PetriNetUnfolderBase]: For 46380/47743 co-relation queries the response was YES. [2025-03-14 21:33:25,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41835 conditions, 8572 events. 1215/8572 cut-off events. For 46380/47743 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 72063 event pairs, 8 based on Foata normal form. 0/8217 useless extension candidates. Maximal degree in co-relation 33959. Up to 4564 conditions per place. [2025-03-14 21:33:25,577 INFO L140 encePairwiseOnDemand]: 911/952 looper letters, 2041 selfloop transitions, 753 changer transitions 351/3212 dead transitions. [2025-03-14 21:33:25,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1343 places, 3212 transitions, 44395 flow [2025-03-14 21:33:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2025-03-14 21:33:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2025-03-14 21:33:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 19196 transitions. [2025-03-14 21:33:25,600 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.0819669331147093 [2025-03-14 21:33:25,601 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 392 predicate places. [2025-03-14 21:33:25,601 INFO L471 AbstractCegarLoop]: Abstraction has has 1343 places, 3212 transitions, 44395 flow [2025-03-14 21:33:25,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 104.3529411764706) internal successors, (8870), 85 states have internal predecessors, (8870), 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 21:33:25,603 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:33:25,603 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:25,614 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 21:33:25,804 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 21:33:25,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:33:25,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:33:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1836490595, now seen corresponding path program 2 times [2025-03-14 21:33:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:33:25,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126824616] [2025-03-14 21:33:25,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:33:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:33:25,880 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:33:25,881 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:33:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 20 proven. 318 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:33:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:33:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126824616] [2025-03-14 21:33:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126824616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:33:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957075324] [2025-03-14 21:33:26,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:33:26,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:33:26,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:33:26,483 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 21:33:26,484 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 21:33:26,694 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:33:26,695 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:33:26,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 2041 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 21:33:26,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:33:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 20 proven. 318 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:33:27,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:33:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 20 proven. 318 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:33:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957075324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:33:28,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:33:28,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-14 21:33:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931574123] [2025-03-14 21:33:28,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:33:28,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 21:33:28,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:33:28,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 21:33:28,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-03-14 21:33:28,218 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 923 out of 952 [2025-03-14 21:33:28,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1343 places, 3212 transitions, 44395 flow. Second operand has 22 states, 22 states have (on average 927.0) internal successors, (20394), 22 states have internal predecessors, (20394), 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 21:33:28,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:33:28,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 923 of 952 [2025-03-14 21:33:28,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:33:34,273 INFO L124 PetriNetUnfolderBase]: 1606/10870 cut-off events. [2025-03-14 21:33:34,274 INFO L125 PetriNetUnfolderBase]: For 75852/78083 co-relation queries the response was YES. [2025-03-14 21:33:34,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57122 conditions, 10870 events. 1606/10870 cut-off events. For 75852/78083 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 92703 event pairs, 9 based on Foata normal form. 0/10403 useless extension candidates. Maximal degree in co-relation 45215. Up to 5953 conditions per place. [2025-03-14 21:33:34,320 INFO L140 encePairwiseOnDemand]: 945/952 looper letters, 1646 selfloop transitions, 230 changer transitions 374/3753 dead transitions. [2025-03-14 21:33:34,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1372 places, 3753 transitions, 59192 flow [2025-03-14 21:33:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 21:33:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 21:33:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 27902 transitions. [2025-03-14 21:33:34,329 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9769607843137255 [2025-03-14 21:33:34,329 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 421 predicate places. [2025-03-14 21:33:34,329 INFO L471 AbstractCegarLoop]: Abstraction has has 1372 places, 3753 transitions, 59192 flow [2025-03-14 21:33:34,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 927.0) internal successors, (20394), 22 states have internal predecessors, (20394), 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 21:33:34,334 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:33:34,334 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:33:34,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 21:33:34,535 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 21:33:34,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:33:34,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:33:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -887586117, now seen corresponding path program 2 times [2025-03-14 21:33:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:33:34,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594970949] [2025-03-14 21:33:34,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:33:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:33:34,706 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:33:34,706 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:33:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:33:39,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:33:39,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594970949] [2025-03-14 21:33:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594970949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:33:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583500926] [2025-03-14 21:33:39,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:33:39,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:33:39,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:33:39,703 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 21:33:39,703 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 21:33:39,951 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:33:39,951 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:33:39,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-14 21:33:39,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:33:42,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 21:33:43,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:33:43,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-03-14 21:33:44,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:33:44,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-03-14 21:33:46,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:33:46,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2025-03-14 21:33:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:33:46,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:33:58,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-03-14 21:33:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 14 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:33:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583500926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:33:59,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:33:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 44, 39] total 116 [2025-03-14 21:33:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364310976] [2025-03-14 21:33:59,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:33:59,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2025-03-14 21:33:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:33:59,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2025-03-14 21:33:59,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=12811, Unknown=3, NotChecked=0, Total=13340 [2025-03-14 21:33:59,374 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 952 [2025-03-14 21:33:59,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1372 places, 3753 transitions, 59192 flow. Second operand has 116 states, 116 states have (on average 97.10344827586206) internal successors, (11264), 116 states have internal predecessors, (11264), 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 21:33:59,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:33:59,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 952 [2025-03-14 21:33:59,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:34:31,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:34:33,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:34:35,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:34:40,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:34:53,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:34:55,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:34:57,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:35:51,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:35:53,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:35:55,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:35:57,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:35:59,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:36:01,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:36:20,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:36:22,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:37:19,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:37:56,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:37:58,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:38:00,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:38:02,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:38:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:38:06,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-14 21:38:46,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| 3)) (.cse9 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse9 (- 8))) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|)) (.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* |c_t1Thread1of1ForFork1_inc_top_#t~post31#1| 4)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_#in~stack#1.base|)) (.cse8 (+ |c_~#arr~0.offset| (- 4) .cse9)) (.cse5 (select .cse7 0))) (and (= |c_t1Thread1of1ForFork1_push_#in~stack#1.offset| |c_~#arr~0.offset|) (not (= (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_#in~x#1| 4294967296))) (forall ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_51| Int) (|v_t1Thread1of1ForFork1_push_#t~ret34#1_62| Int)) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_51| |c_t1Thread1of1ForFork1_push_#in~stack#1.offset|) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_#in~stack#1.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_51|) |c_t1Thread1of1ForFork1_push_#in~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| c_~top~0))) (not (= (+ 2 |c_t2Thread1of1ForFork0_pop_#res#1|) 0)) (= 3 c_~top~0) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret34#1_62| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |c_t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| |c_t1Thread1of1ForFork1_get_top_#res#1|))) (= |c_~#arr~0.offset| 0) (not (= (mod (select .cse3 (+ .cse4 |c_~#arr~0.offset| (- 4))) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret34#1_62| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |c_t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296))))) (not (= (mod (+ (* |c_t1Thread1of1ForFork1_~tmp~0#1| 4294967295) 4294967294) 4294967296) 0)) (= 2 |c_t1Thread1of1ForFork1_inc_top_#t~post31#1|) (= |c_t1Thread1of1ForFork1_push_#in~stack#1.base| |c_~#arr~0.base|) (= 3 |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse5) (exists ((|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|t1Thread1of1ForFork1_push_#t~ret34#1| Int)) (let ((.cse6 (select .cse7 (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret34#1| 4))))) (and (<= 2 |t1Thread1of1ForFork1_push_#t~ret34#1|) (<= 0 .cse6) (<= .cse6 799) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|)))) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret34#1_62| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |c_t1Thread1of1ForFork1_push_#in~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| c_~top~0))) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ (* |c_t1Thread1of1ForFork1_push_#t~ret34#1| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |c_t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296) 4294967294)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret34#1_66| Int) (v_ArrVal_294 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_66| 4)) v_ArrVal_294)) |c_~#arr~0.base|) .cse8) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_66| c_~top~0))) (not (= (mod (select .cse3 (+ .cse4 |c_~#arr~0.offset|)) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_54| Int) (|v_t1Thread1of1ForFork1_push_#t~ret34#1_66| Int) (v_ArrVal_294 Int)) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_54| |c_t1Thread1of1ForFork1_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_#in~stack#1.base| (store .cse0 (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_54| (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_66| 4)) v_ArrVal_294)) |c_~#arr~0.base|) .cse8) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_66| c_~top~0))) (<= .cse5 799)))) is different from false [2025-03-14 21:38:48,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| 3)) (.cse9 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse9 (- 8))) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base|)) (.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* |c_t1Thread1of1ForFork1_inc_top_#t~post31#1| 4)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_push_#in~stack#1.base|)) (.cse8 (+ |c_~#arr~0.offset| (- 4) .cse9)) (.cse5 (select .cse7 0))) (and (<= 4294966496 (mod (+ (* 4294967295 |c_t2Thread1of1ForFork0_pop_#res#1|) 4294967295) 4294967296)) (= |c_t1Thread1of1ForFork1_push_#in~stack#1.offset| |c_~#arr~0.offset|) (not (= (mod |c_t1Thread1of1ForFork1_push_~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork1_push_#in~x#1| 4294967296))) (forall ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_51| Int) (|v_t1Thread1of1ForFork1_push_#t~ret34#1_62| Int)) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_51| |c_t1Thread1of1ForFork1_push_#in~stack#1.offset|) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_#in~stack#1.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_51|) |c_t1Thread1of1ForFork1_push_#in~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| c_~top~0))) (= 3 c_~top~0) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret34#1_62| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |c_t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296))) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| |c_t1Thread1of1ForFork1_get_top_#res#1|))) (= |c_~#arr~0.offset| 0) (<= 0 |c_t2Thread1of1ForFork0_pop_#res#1|) (not (= (mod (select .cse3 (+ .cse4 |c_~#arr~0.offset| (- 4))) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret34#1_62| Int)) (or (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |c_t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296))))) (not (= (mod (+ (* |c_t1Thread1of1ForFork1_~tmp~0#1| 4294967295) 4294967294) 4294967296) 0)) (<= |c_t2Thread1of1ForFork0_pop_#res#1| 2147483647) (= 2 |c_t1Thread1of1ForFork1_inc_top_#t~post31#1|) (= |c_t1Thread1of1ForFork1_push_#in~stack#1.base| |c_~#arr~0.base|) (= 3 |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork1_push_~stack#1.offset|) (<= 0 .cse5) (exists ((|t1Thread1of1ForFork1_push_~stack#1.offset| Int) (|t1Thread1of1ForFork1_push_#t~ret34#1| Int)) (let ((.cse6 (select .cse7 (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret34#1| 4))))) (and (<= 2 |t1Thread1of1ForFork1_push_#t~ret34#1|) (<= 0 .cse6) (<= .cse6 799) (<= 0 |t1Thread1of1ForFork1_push_~stack#1.offset|)))) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret34#1_62| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |c_t1Thread1of1ForFork1_push_#in~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_62| c_~top~0))) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ (* |c_t1Thread1of1ForFork1_push_#t~ret34#1| 4) |c_t1Thread1of1ForFork1_push_~stack#1.offset|) |c_t1Thread1of1ForFork1_push_~x#1|)) |c_~#arr~0.base|) .cse1) 4294967296) 4294967294)) (= |c_t1Thread1of1ForFork1_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork1_push_#t~ret34#1_66| Int) (v_ArrVal_294 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_~stack#1.base| (store .cse2 (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_66| 4)) v_ArrVal_294)) |c_~#arr~0.base|) .cse8) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_66| c_~top~0))) (not (= (mod (select .cse3 (+ .cse4 |c_~#arr~0.offset|)) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork1_push_~stack#1.offset_54| Int) (|v_t1Thread1of1ForFork1_push_#t~ret34#1_66| Int) (v_ArrVal_294 Int)) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_54| |c_t1Thread1of1ForFork1_push_#in~stack#1.offset|) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork1_push_#in~stack#1.base| (store .cse0 (+ |v_t1Thread1of1ForFork1_push_~stack#1.offset_54| (* |v_t1Thread1of1ForFork1_push_#t~ret34#1_66| 4)) v_ArrVal_294)) |c_~#arr~0.base|) .cse8) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork1_push_#t~ret34#1_66| c_~top~0))) (<= .cse5 799)))) is different from false [2025-03-14 21:40:56,552 INFO L124 PetriNetUnfolderBase]: 3049/21402 cut-off events. [2025-03-14 21:40:56,552 INFO L125 PetriNetUnfolderBase]: For 170065/175596 co-relation queries the response was YES. [2025-03-14 21:40:56,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126150 conditions, 21402 events. 3049/21402 cut-off events. For 170065/175596 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 219269 event pairs, 10 based on Foata normal form. 0/20455 useless extension candidates. Maximal degree in co-relation 110259. Up to 13032 conditions per place. [2025-03-14 21:40:56,657 INFO L140 encePairwiseOnDemand]: 910/952 looper letters, 4271 selfloop transitions, 1968 changer transitions 942/7248 dead transitions. [2025-03-14 21:40:56,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1812 places, 7248 transitions, 134073 flow [2025-03-14 21:40:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 441 states. [2025-03-14 21:40:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2025-03-14 21:40:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 33789 transitions. [2025-03-14 21:40:56,696 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.08048219287715086 [2025-03-14 21:40:56,697 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 861 predicate places. [2025-03-14 21:40:56,697 INFO L471 AbstractCegarLoop]: Abstraction has has 1812 places, 7248 transitions, 134073 flow [2025-03-14 21:40:56,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 116 states have (on average 97.10344827586206) internal successors, (11264), 116 states have internal predecessors, (11264), 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 21:40:56,698 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:40:56,699 INFO L221 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:56,711 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 21:40:56,899 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 21:40:56,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:40:56,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:40:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1683795333, now seen corresponding path program 2 times [2025-03-14 21:40:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:40:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059015632] [2025-03-14 21:40:56,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:40:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:40:57,072 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:40:57,072 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:40:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:40:57,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:40:57,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059015632] [2025-03-14 21:40:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059015632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:40:57,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616319782] [2025-03-14 21:40:57,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:40:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:40:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:40:57,947 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 21:40:57,950 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 21:40:58,245 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:40:58,245 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:40:58,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 2200 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 21:40:58,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:41:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:41:00,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:41:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:41:02,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616319782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:41:02,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:41:02,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-14 21:41:02,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957101797] [2025-03-14 21:41:02,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:41:02,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 21:41:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:41:02,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 21:41:02,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2025-03-14 21:41:02,321 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 920 out of 952 [2025-03-14 21:41:02,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1812 places, 7248 transitions, 134073 flow. Second operand has 24 states, 24 states have (on average 924.625) internal successors, (22191), 24 states have internal predecessors, (22191), 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 21:41:02,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:41:02,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 920 of 952 [2025-03-14 21:41:02,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:41:43,281 INFO L124 PetriNetUnfolderBase]: 4356/29496 cut-off events. [2025-03-14 21:41:43,282 INFO L125 PetriNetUnfolderBase]: For 289018/297433 co-relation queries the response was YES. [2025-03-14 21:41:43,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186448 conditions, 29496 events. 4356/29496 cut-off events. For 289018/297433 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 328967 event pairs, 10 based on Foata normal form. 0/28226 useless extension candidates. Maximal degree in co-relation 168173. Up to 18890 conditions per place. [2025-03-14 21:41:43,511 INFO L140 encePairwiseOnDemand]: 943/952 looper letters, 4588 selfloop transitions, 1007 changer transitions 1405/9346 dead transitions. [2025-03-14 21:41:43,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1849 places, 9346 transitions, 195165 flow [2025-03-14 21:41:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-14 21:41:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-14 21:41:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 35199 transitions. [2025-03-14 21:41:43,616 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9729931446262715 [2025-03-14 21:41:43,619 INFO L298 CegarLoopForPetriNet]: 951 programPoint places, 898 predicate places. [2025-03-14 21:41:43,619 INFO L471 AbstractCegarLoop]: Abstraction has has 1849 places, 9346 transitions, 195165 flow [2025-03-14 21:41:43,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 924.625) internal successors, (22191), 24 states have internal predecessors, (22191), 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 21:41:43,627 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:41:43,628 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:43,637 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 21:41:43,832 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 21:41:43,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:41:43,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:41:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash -228905990, now seen corresponding path program 3 times [2025-03-14 21:41:43,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:41:43,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41769613] [2025-03-14 21:41:43,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:41:43,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:41:45,799 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 21:41:45,800 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:42:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 114 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:42:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:42:00,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41769613] [2025-03-14 21:42:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41769613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:42:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297039598] [2025-03-14 21:42:00,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:42:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:42:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:42:00,599 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 21:42:00,601 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 21:42:00,982 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 21:42:00,982 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:42:00,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 2246 conjuncts, 152 conjuncts are in the unsatisfiable core [2025-03-14 21:42:01,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:42:08,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 21:42:09,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-14 21:42:10,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 21:42:10,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-03-14 21:42:12,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-14 21:42:17,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-14 21:42:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:42:17,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:42:29,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-03-14 21:42:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 21 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:42:31,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297039598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:42:31,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:42:31,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 60, 60] total 162 [2025-03-14 21:42:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806266046] [2025-03-14 21:42:31,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:42:31,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 162 states [2025-03-14 21:42:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:42:31,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2025-03-14 21:42:31,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1468, Invalid=24614, Unknown=0, NotChecked=0, Total=26082 [2025-03-14 21:42:31,322 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 952 [2025-03-14 21:42:31,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1849 places, 9346 transitions, 195165 flow. Second operand has 162 states, 162 states have (on average 90.9753086419753) internal successors, (14738), 162 states have internal predecessors, (14738), 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 21:42:31,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:42:31,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 952 [2025-03-14 21:42:31,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-14 21:45:41,408 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 21:45:41,408 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 21:45:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2025-03-14 21:45:41,495 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-14 21:45:41,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-14 21:45:41,699 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 21:45:41,699 WARN L596 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 413 known predicates. [2025-03-14 21:45:41,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-03-14 21:45:41,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-14 21:45:41,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 21:45:41,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-14 21:45:41,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 21:45:41,704 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-14 21:45:41,712 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 21:45:41,712 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 21:45:41,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 09:45:41 BasicIcfg [2025-03-14 21:45:41,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 21:45:41,723 INFO L158 Benchmark]: Toolchain (without parser) took 817724.39ms. Allocated memory was 71.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 43.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 471.1MB. Max. memory is 8.0GB. [2025-03-14 21:45:41,723 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 71.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:45:41,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.36ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 28.3MB in the end (delta: 14.5MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2025-03-14 21:45:41,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.91ms. Allocated memory is still 71.3MB. Free memory was 28.3MB in the beginning and 36.6MB in the end (delta: -8.2MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2025-03-14 21:45:41,723 INFO L158 Benchmark]: Boogie Preprocessor took 69.63ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 30.6MB in the end (delta: 5.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 21:45:41,724 INFO L158 Benchmark]: RCFGBuilder took 1088.54ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 30.6MB in the beginning and 31.2MB in the end (delta: -529.5kB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2025-03-14 21:45:41,724 INFO L158 Benchmark]: TraceAbstraction took 815959.05ms. Allocated memory was 92.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 30.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 439.2MB. Max. memory is 8.0GB. [2025-03-14 21:45:41,727 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 71.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 503.36ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 28.3MB in the end (delta: 14.5MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 95.91ms. Allocated memory is still 71.3MB. Free memory was 28.3MB in the beginning and 36.6MB in the end (delta: -8.2MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.63ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 30.6MB in the end (delta: 5.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1088.54ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 30.6MB in the beginning and 31.2MB in the end (delta: -529.5kB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. * TraceAbstraction took 815959.05ms. Allocated memory was 92.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 30.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 439.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 413 known predicates. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 413 known predicates. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 413 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 413 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1051 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.3s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 815.8s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 707.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 21089 SdHoareTripleChecker+Valid, 204.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21089 mSDsluCounter, 25174 SdHoareTripleChecker+Invalid, 191.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 220 IncrementalHoareTripleChecker+Unchecked, 24494 mSDsCounter, 547 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 221858 IncrementalHoareTripleChecker+Invalid, 222647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 547 mSolverCounterUnsat, 680 mSDtfsCounter, 221858 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16792 GetRequests, 15206 SyntacticMatches, 3 SemanticMatches, 1582 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 225176 ImplicationChecksByTransitivity, 455.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195165occurred in iteration=12, InterpolantAutomatonStates: 919, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 100.9s InterpolantComputationTime, 20616 NumberOfCodeBlocks, 20616 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 27747 ConstructedInterpolants, 150 QuantifiedInterpolants, 145125 SizeOfPredicates, 221 NumberOfNonLiveVariables, 16236 ConjunctsInSsa, 422 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 291/4144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown