/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/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:57:32,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:57:32,539 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:57:32,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:57:32,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:57:32,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:57:32,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:57:32,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:57:32,561 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:57:32,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:57:32,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:57:32,561 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:57:32,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:57:32,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:57:32,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:57:32,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:57:32,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:57:32,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:57:32,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:57:32,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:57:32,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:57:32,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:57:32,564 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:57:32,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:57:32,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:57:32,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:57:32,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:57:32,836 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:57:32,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-14 21:57:34,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dbcc2db/b8eae853789c4602b48cb775ebd93fb7/FLAG1b01773bc [2025-03-14 21:57:34,229 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:57:34,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-14 21:57:34,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dbcc2db/b8eae853789c4602b48cb775ebd93fb7/FLAG1b01773bc [2025-03-14 21:57:34,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28dbcc2db/b8eae853789c4602b48cb775ebd93fb7 [2025-03-14 21:57:34,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:57:34,263 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:57:34,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:57:34,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:57:34,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:57:34,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5934da91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34, skipping insertion in model container [2025-03-14 21:57:34,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:57:34,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2025-03-14 21:57:34,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:57:34,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:57:34,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2025-03-14 21:57:34,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:57:34,617 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:57:34,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34 WrapperNode [2025-03-14 21:57:34,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:57:34,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:57:34,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:57:34,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:57:34,623 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:57:34" (1/1) ... [2025-03-14 21:57:34,636 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:57:34" (1/1) ... [2025-03-14 21:57:34,658 INFO L138 Inliner]: procedures = 165, calls = 46, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 162 [2025-03-14 21:57:34,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:57:34,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:57:34,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:57:34,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:57:34,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:57:34,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:57:34,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:57:34,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:57:34,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (1/1) ... [2025-03-14 21:57:34,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:57:34,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:57:34,732 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:57:34,735 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:57:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:57:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:57:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 21:57:34,754 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 21:57:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:57:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:57:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:57:34,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:57:34,755 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:57:34,839 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:57:34,840 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:57:35,067 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:57:35,067 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:57:35,098 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:57:35,098 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:57:35,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:57:35 BoogieIcfgContainer [2025-03-14 21:57:35,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:57:35,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:57:35,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:57:35,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:57:35,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:57:34" (1/3) ... [2025-03-14 21:57:35,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ad458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:57:35, skipping insertion in model container [2025-03-14 21:57:35,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:57:34" (2/3) ... [2025-03-14 21:57:35,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ad458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:57:35, skipping insertion in model container [2025-03-14 21:57:35,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:57:35" (3/3) ... [2025-03-14 21:57:35,105 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-14 21:57:35,115 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:57:35,117 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 181 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-14 21:57:35,117 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:57:35,194 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 21:57:35,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:57:35,241 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;@1ac520de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:57:35,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 21:57:35,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:57:35,294 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2025-03-14 21:57:35,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:57:35,296 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:35,297 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] [2025-03-14 21:57:35,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:35,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 162113515, now seen corresponding path program 1 times [2025-03-14 21:57:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:35,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914984467] [2025-03-14 21:57:35,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:35,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:35,872 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:57:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:35,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914984467] [2025-03-14 21:57:35,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914984467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:35,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:35,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:57:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124009620] [2025-03-14 21:57:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:35,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:57:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:35,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:57:35,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:57:35,909 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 189 [2025-03-14 21:57:35,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 189 transitions, 382 flow. Second operand has 8 states, 8 states have (on average 132.75) internal successors, (1062), 8 states have internal predecessors, (1062), 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:57:35,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:35,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 189 [2025-03-14 21:57:35,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:36,690 INFO L124 PetriNetUnfolderBase]: 580/2990 cut-off events. [2025-03-14 21:57:36,691 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 21:57:36,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4220 conditions, 2990 events. 580/2990 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 23414 event pairs, 212 based on Foata normal form. 198/3009 useless extension candidates. Maximal degree in co-relation 4165. Up to 544 conditions per place. [2025-03-14 21:57:36,713 INFO L140 encePairwiseOnDemand]: 166/189 looper letters, 128 selfloop transitions, 38 changer transitions 27/318 dead transitions. [2025-03-14 21:57:36,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 318 transitions, 1015 flow [2025-03-14 21:57:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 21:57:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 21:57:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2711 transitions. [2025-03-14 21:57:36,736 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7549429128376497 [2025-03-14 21:57:36,738 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 14 predicate places. [2025-03-14 21:57:36,738 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 318 transitions, 1015 flow [2025-03-14 21:57:36,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 132.75) internal successors, (1062), 8 states have internal predecessors, (1062), 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:57:36,739 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:36,739 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] [2025-03-14 21:57:36,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:57:36,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:36,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash -562003318, now seen corresponding path program 1 times [2025-03-14 21:57:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:36,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113686323] [2025-03-14 21:57:36,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:36,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:36,941 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:57:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113686323] [2025-03-14 21:57:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113686323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 21:57:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824976712] [2025-03-14 21:57:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:36,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 21:57:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:36,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 21:57:36,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 21:57:36,944 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 189 [2025-03-14 21:57:36,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 318 transitions, 1015 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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:57:36,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:36,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 189 [2025-03-14 21:57:36,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:37,171 INFO L124 PetriNetUnfolderBase]: 349/1895 cut-off events. [2025-03-14 21:57:37,171 INFO L125 PetriNetUnfolderBase]: For 315/317 co-relation queries the response was YES. [2025-03-14 21:57:37,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 1895 events. 349/1895 cut-off events. For 315/317 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12678 event pairs, 116 based on Foata normal form. 40/1825 useless extension candidates. Maximal degree in co-relation 3052. Up to 442 conditions per place. [2025-03-14 21:57:37,180 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 39 selfloop transitions, 16 changer transitions 52/285 dead transitions. [2025-03-14 21:57:37,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 285 transitions, 1051 flow [2025-03-14 21:57:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 21:57:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 21:57:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 801 transitions. [2025-03-14 21:57:37,182 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-14 21:57:37,182 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 13 predicate places. [2025-03-14 21:57:37,182 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 285 transitions, 1051 flow [2025-03-14 21:57:37,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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:57:37,183 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:37,183 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] [2025-03-14 21:57:37,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:57:37,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:37,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1646125457, now seen corresponding path program 1 times [2025-03-14 21:57:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:37,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649424411] [2025-03-14 21:57:37,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:37,402 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:57:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649424411] [2025-03-14 21:57:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649424411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:37,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:37,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:57:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338676579] [2025-03-14 21:57:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:37,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:57:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:37,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:57:37,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:57:37,405 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 189 [2025-03-14 21:57:37,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 285 transitions, 1051 flow. Second operand has 8 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 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:57:37,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:37,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 189 [2025-03-14 21:57:37,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:37,855 INFO L124 PetriNetUnfolderBase]: 348/1890 cut-off events. [2025-03-14 21:57:37,855 INFO L125 PetriNetUnfolderBase]: For 626/666 co-relation queries the response was YES. [2025-03-14 21:57:37,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 1890 events. 348/1890 cut-off events. For 626/666 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12655 event pairs, 116 based on Foata normal form. 8/1790 useless extension candidates. Maximal degree in co-relation 3856. Up to 442 conditions per place. [2025-03-14 21:57:37,864 INFO L140 encePairwiseOnDemand]: 170/189 looper letters, 90 selfloop transitions, 19 changer transitions 52/286 dead transitions. [2025-03-14 21:57:37,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 286 transitions, 1371 flow [2025-03-14 21:57:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 21:57:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 21:57:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1966 transitions. [2025-03-14 21:57:37,870 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7430083144368859 [2025-03-14 21:57:37,871 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 26 predicate places. [2025-03-14 21:57:37,871 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 286 transitions, 1371 flow [2025-03-14 21:57:37,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 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:57:37,871 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:37,872 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] [2025-03-14 21:57:37,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:57:37,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:37,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1109200383, now seen corresponding path program 1 times [2025-03-14 21:57:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:37,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755190963] [2025-03-14 21:57:37,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:37,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:38,139 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:57:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755190963] [2025-03-14 21:57:38,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755190963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:38,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:38,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 21:57:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239500673] [2025-03-14 21:57:38,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:38,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 21:57:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:38,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 21:57:38,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-14 21:57:38,141 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 189 [2025-03-14 21:57:38,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 286 transitions, 1371 flow. Second operand has 13 states, 13 states have (on average 115.6923076923077) internal successors, (1504), 13 states have internal predecessors, (1504), 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:57:38,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:38,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 189 [2025-03-14 21:57:38,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:39,269 INFO L124 PetriNetUnfolderBase]: 656/2394 cut-off events. [2025-03-14 21:57:39,270 INFO L125 PetriNetUnfolderBase]: For 2098/2264 co-relation queries the response was YES. [2025-03-14 21:57:39,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 2394 events. 656/2394 cut-off events. For 2098/2264 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 16905 event pairs, 95 based on Foata normal form. 11/2246 useless extension candidates. Maximal degree in co-relation 6656. Up to 628 conditions per place. [2025-03-14 21:57:39,279 INFO L140 encePairwiseOnDemand]: 165/189 looper letters, 251 selfloop transitions, 38 changer transitions 163/560 dead transitions. [2025-03-14 21:57:39,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 560 transitions, 3981 flow [2025-03-14 21:57:39,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-14 21:57:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-14 21:57:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 4439 transitions. [2025-03-14 21:57:39,288 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6524103468547913 [2025-03-14 21:57:39,289 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 61 predicate places. [2025-03-14 21:57:39,290 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 560 transitions, 3981 flow [2025-03-14 21:57:39,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.6923076923077) internal successors, (1504), 13 states have internal predecessors, (1504), 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:57:39,291 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:39,291 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] [2025-03-14 21:57:39,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:57:39,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:39,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -587728966, now seen corresponding path program 1 times [2025-03-14 21:57:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775136612] [2025-03-14 21:57:39,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:39,423 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:57:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775136612] [2025-03-14 21:57:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775136612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:39,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:39,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:57:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962123839] [2025-03-14 21:57:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:39,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:57:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:39,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:57:39,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:57:39,425 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 189 [2025-03-14 21:57:39,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 560 transitions, 3981 flow. Second operand has 8 states, 8 states have (on average 128.25) internal successors, (1026), 8 states have internal predecessors, (1026), 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:57:39,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:39,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 189 [2025-03-14 21:57:39,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:39,980 INFO L124 PetriNetUnfolderBase]: 645/2357 cut-off events. [2025-03-14 21:57:39,980 INFO L125 PetriNetUnfolderBase]: For 3348/3610 co-relation queries the response was YES. [2025-03-14 21:57:39,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7904 conditions, 2357 events. 645/2357 cut-off events. For 3348/3610 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 16714 event pairs, 23 based on Foata normal form. 21/2234 useless extension candidates. Maximal degree in co-relation 7813. Up to 614 conditions per place. [2025-03-14 21:57:39,991 INFO L140 encePairwiseOnDemand]: 174/189 looper letters, 269 selfloop transitions, 37 changer transitions 164/589 dead transitions. [2025-03-14 21:57:39,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 589 transitions, 5155 flow [2025-03-14 21:57:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 21:57:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 21:57:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2582 transitions. [2025-03-14 21:57:39,996 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7190197716513506 [2025-03-14 21:57:39,997 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 77 predicate places. [2025-03-14 21:57:39,997 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 589 transitions, 5155 flow [2025-03-14 21:57:39,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.25) internal successors, (1026), 8 states have internal predecessors, (1026), 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:57:39,998 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:39,998 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] [2025-03-14 21:57:39,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 21:57:39,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1682662153, now seen corresponding path program 1 times [2025-03-14 21:57:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395644236] [2025-03-14 21:57:39,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:40,222 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:57:40,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:40,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395644236] [2025-03-14 21:57:40,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395644236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:40,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:40,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:57:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052742596] [2025-03-14 21:57:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:57:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:40,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:57:40,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:57:40,224 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 189 [2025-03-14 21:57:40,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 589 transitions, 5155 flow. Second operand has 8 states, 8 states have (on average 149.125) internal successors, (1193), 8 states have internal predecessors, (1193), 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:57:40,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:40,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 189 [2025-03-14 21:57:40,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:40,456 INFO L124 PetriNetUnfolderBase]: 546/1944 cut-off events. [2025-03-14 21:57:40,456 INFO L125 PetriNetUnfolderBase]: For 3983/4077 co-relation queries the response was YES. [2025-03-14 21:57:40,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6902 conditions, 1944 events. 546/1944 cut-off events. For 3983/4077 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 13117 event pairs, 22 based on Foata normal form. 10/1831 useless extension candidates. Maximal degree in co-relation 6791. Up to 434 conditions per place. [2025-03-14 21:57:40,465 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 80 selfloop transitions, 23 changer transitions 158/539 dead transitions. [2025-03-14 21:57:40,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 539 transitions, 4977 flow [2025-03-14 21:57:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:57:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:57:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 917 transitions. [2025-03-14 21:57:40,468 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2025-03-14 21:57:40,469 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 77 predicate places. [2025-03-14 21:57:40,469 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 539 transitions, 4977 flow [2025-03-14 21:57:40,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 149.125) internal successors, (1193), 8 states have internal predecessors, (1193), 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:57:40,470 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:40,470 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] [2025-03-14 21:57:40,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:57:40,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:40,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:40,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1080496408, now seen corresponding path program 1 times [2025-03-14 21:57:40,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:40,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134559217] [2025-03-14 21:57:40,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:40,711 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:57:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134559217] [2025-03-14 21:57:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134559217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 21:57:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432507203] [2025-03-14 21:57:40,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:40,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 21:57:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:40,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 21:57:40,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-14 21:57:40,715 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 189 [2025-03-14 21:57:40,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 539 transitions, 4977 flow. Second operand has 13 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 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:57:40,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:40,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 189 [2025-03-14 21:57:40,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:42,004 INFO L124 PetriNetUnfolderBase]: 1224/4085 cut-off events. [2025-03-14 21:57:42,004 INFO L125 PetriNetUnfolderBase]: For 13735/13851 co-relation queries the response was YES. [2025-03-14 21:57:42,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15656 conditions, 4085 events. 1224/4085 cut-off events. For 13735/13851 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 30904 event pairs, 76 based on Foata normal form. 51/3952 useless extension candidates. Maximal degree in co-relation 15541. Up to 739 conditions per place. [2025-03-14 21:57:42,025 INFO L140 encePairwiseOnDemand]: 164/189 looper letters, 312 selfloop transitions, 60 changer transitions 474/979 dead transitions. [2025-03-14 21:57:42,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 979 transitions, 11307 flow [2025-03-14 21:57:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-14 21:57:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-14 21:57:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 5195 transitions. [2025-03-14 21:57:42,033 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6704090850432314 [2025-03-14 21:57:42,035 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 117 predicate places. [2025-03-14 21:57:42,035 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 979 transitions, 11307 flow [2025-03-14 21:57:42,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 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:57:42,036 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:42,037 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] [2025-03-14 21:57:42,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 21:57:42,037 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash 275608974, now seen corresponding path program 1 times [2025-03-14 21:57:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650726420] [2025-03-14 21:57:42,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:42,176 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:57:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650726420] [2025-03-14 21:57:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650726420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:42,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:42,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:57:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845531475] [2025-03-14 21:57:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:42,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:57:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:42,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:57:42,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:57:42,178 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 189 [2025-03-14 21:57:42,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 979 transitions, 11307 flow. Second operand has 8 states, 8 states have (on average 129.25) internal successors, (1034), 8 states have internal predecessors, (1034), 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:57:42,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:42,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 189 [2025-03-14 21:57:42,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:42,929 INFO L124 PetriNetUnfolderBase]: 1216/4048 cut-off events. [2025-03-14 21:57:42,929 INFO L125 PetriNetUnfolderBase]: For 18395/18499 co-relation queries the response was YES. [2025-03-14 21:57:42,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17438 conditions, 4048 events. 1216/4048 cut-off events. For 18395/18499 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 30606 event pairs, 72 based on Foata normal form. 22/3896 useless extension candidates. Maximal degree in co-relation 17314. Up to 739 conditions per place. [2025-03-14 21:57:42,953 INFO L140 encePairwiseOnDemand]: 171/189 looper letters, 301 selfloop transitions, 47 changer transitions 475/987 dead transitions. [2025-03-14 21:57:42,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 987 transitions, 13003 flow [2025-03-14 21:57:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 21:57:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 21:57:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2570 transitions. [2025-03-14 21:57:42,957 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7156780840991367 [2025-03-14 21:57:42,958 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 133 predicate places. [2025-03-14 21:57:42,958 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 987 transitions, 13003 flow [2025-03-14 21:57:42,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.25) internal successors, (1034), 8 states have internal predecessors, (1034), 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:57:42,958 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:42,958 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] [2025-03-14 21:57:42,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 21:57:42,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:42,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:42,959 INFO L85 PathProgramCache]: Analyzing trace with hash 762178818, now seen corresponding path program 1 times [2025-03-14 21:57:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882228503] [2025-03-14 21:57:42,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:43,101 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:57:43,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:43,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882228503] [2025-03-14 21:57:43,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882228503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:43,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:43,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:57:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117745180] [2025-03-14 21:57:43,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:43,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:57:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:43,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:57:43,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:57:43,104 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 189 [2025-03-14 21:57:43,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 987 transitions, 13003 flow. Second operand has 8 states, 8 states have (on average 134.125) internal successors, (1073), 8 states have internal predecessors, (1073), 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:57:43,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:43,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 189 [2025-03-14 21:57:43,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:43,822 INFO L124 PetriNetUnfolderBase]: 1209/4024 cut-off events. [2025-03-14 21:57:43,823 INFO L125 PetriNetUnfolderBase]: For 24098/24277 co-relation queries the response was YES. [2025-03-14 21:57:43,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19265 conditions, 4024 events. 1209/4024 cut-off events. For 24098/24277 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 30293 event pairs, 76 based on Foata normal form. 29/3905 useless extension candidates. Maximal degree in co-relation 19137. Up to 715 conditions per place. [2025-03-14 21:57:43,838 INFO L140 encePairwiseOnDemand]: 172/189 looper letters, 257 selfloop transitions, 40 changer transitions 572/1041 dead transitions. [2025-03-14 21:57:43,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1041 transitions, 15467 flow [2025-03-14 21:57:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 21:57:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 21:57:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2934 transitions. [2025-03-14 21:57:43,841 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7392290249433107 [2025-03-14 21:57:43,842 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 153 predicate places. [2025-03-14 21:57:43,842 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 1041 transitions, 15467 flow [2025-03-14 21:57:43,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 134.125) internal successors, (1073), 8 states have internal predecessors, (1073), 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:57:43,842 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:43,842 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] [2025-03-14 21:57:43,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 21:57:43,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1592193751, now seen corresponding path program 1 times [2025-03-14 21:57:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:43,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887726209] [2025-03-14 21:57:43,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:43,993 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:57:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887726209] [2025-03-14 21:57:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887726209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 21:57:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307446855] [2025-03-14 21:57:43,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 21:57:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:43,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 21:57:43,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-14 21:57:43,995 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2025-03-14 21:57:43,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 1041 transitions, 15467 flow. Second operand has 11 states, 11 states have (on average 124.36363636363636) internal successors, (1368), 11 states have internal predecessors, (1368), 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:57:43,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:43,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2025-03-14 21:57:43,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:44,910 INFO L124 PetriNetUnfolderBase]: 1239/4160 cut-off events. [2025-03-14 21:57:44,911 INFO L125 PetriNetUnfolderBase]: For 29562/29903 co-relation queries the response was YES. [2025-03-14 21:57:44,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22065 conditions, 4160 events. 1239/4160 cut-off events. For 29562/29903 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 31571 event pairs, 76 based on Foata normal form. 105/4119 useless extension candidates. Maximal degree in co-relation 21934. Up to 748 conditions per place. [2025-03-14 21:57:44,925 INFO L140 encePairwiseOnDemand]: 167/189 looper letters, 237 selfloop transitions, 56 changer transitions 687/1118 dead transitions. [2025-03-14 21:57:44,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1118 transitions, 18569 flow [2025-03-14 21:57:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 21:57:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 21:57:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2637 transitions. [2025-03-14 21:57:44,927 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6976190476190476 [2025-03-14 21:57:44,928 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 172 predicate places. [2025-03-14 21:57:44,928 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 1118 transitions, 18569 flow [2025-03-14 21:57:44,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.36363636363636) internal successors, (1368), 11 states have internal predecessors, (1368), 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:57:44,928 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:57:44,928 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] [2025-03-14 21:57:44,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 21:57:44,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:57:44,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:57:44,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1269510922, now seen corresponding path program 1 times [2025-03-14 21:57:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:57:44,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189251984] [2025-03-14 21:57:44,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:57:44,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:57:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:57:45,179 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:57:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:57:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189251984] [2025-03-14 21:57:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189251984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:57:45,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:57:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:57:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735808461] [2025-03-14 21:57:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:57:45,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:57:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:57:45,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:57:45,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:57:45,181 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 189 [2025-03-14 21:57:45,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1118 transitions, 18569 flow. Second operand has 7 states, 7 states have (on average 150.28571428571428) internal successors, (1052), 7 states have internal predecessors, (1052), 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:57:45,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:57:45,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 189 [2025-03-14 21:57:45,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:57:45,537 INFO L124 PetriNetUnfolderBase]: 856/3110 cut-off events. [2025-03-14 21:57:45,538 INFO L125 PetriNetUnfolderBase]: For 29800/29934 co-relation queries the response was YES. [2025-03-14 21:57:45,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16091 conditions, 3110 events. 856/3110 cut-off events. For 29800/29934 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 22444 event pairs, 33 based on Foata normal form. 99/3074 useless extension candidates. Maximal degree in co-relation 15940. Up to 715 conditions per place. [2025-03-14 21:57:45,547 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 0 selfloop transitions, 0 changer transitions 897/897 dead transitions. [2025-03-14 21:57:45,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 897 transitions, 15221 flow [2025-03-14 21:57:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:57:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:57:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 917 transitions. [2025-03-14 21:57:45,548 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2025-03-14 21:57:45,549 INFO L298 CegarLoopForPetriNet]: 184 programPoint places, 171 predicate places. [2025-03-14 21:57:45,549 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 897 transitions, 15221 flow [2025-03-14 21:57:45,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 150.28571428571428) internal successors, (1052), 7 states have internal predecessors, (1052), 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:57:45,554 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i_petrified1_AllErrorsAtOnce [2025-03-14 21:57:45,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-14 21:57:45,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-14 21:57:45,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-03-14 21:57:45,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-14 21:57:45,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-14 21:57:45,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-14 21:57:45,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-14 21:57:45,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 21:57:45,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:57:45,627 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 21:57:45,627 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 21:57:45,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 09:57:45 BasicIcfg [2025-03-14 21:57:45,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 21:57:45,633 INFO L158 Benchmark]: Toolchain (without parser) took 11369.61ms. Allocated memory was 71.3MB in the beginning and 394.3MB in the end (delta: 323.0MB). Free memory was 43.2MB in the beginning and 296.0MB in the end (delta: -252.8MB). Peak memory consumption was 290.1MB. Max. memory is 8.0GB. [2025-03-14 21:57:45,633 INFO L158 Benchmark]: CDTParser took 1.24ms. Allocated memory is still 71.3MB. Free memory is still 36.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:57:45,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.60ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 22.3MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-14 21:57:45,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.94ms. Allocated memory is still 71.3MB. Free memory was 22.3MB in the beginning and 20.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:57:45,633 INFO L158 Benchmark]: Boogie Preprocessor took 33.95ms. Allocated memory is still 71.3MB. Free memory was 20.1MB in the beginning and 18.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:57:45,633 INFO L158 Benchmark]: RCFGBuilder took 404.39ms. Allocated memory is still 71.3MB. Free memory was 18.9MB in the beginning and 24.5MB in the end (delta: -5.7MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2025-03-14 21:57:45,634 INFO L158 Benchmark]: TraceAbstraction took 10532.25ms. Allocated memory was 71.3MB in the beginning and 394.3MB in the end (delta: 323.0MB). Free memory was 23.6MB in the beginning and 296.0MB in the end (delta: -272.4MB). Peak memory consumption was 270.5MB. Max. memory is 8.0GB. [2025-03-14 21:57:45,634 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.24ms. Allocated memory is still 71.3MB. Free memory is still 36.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 354.60ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 22.3MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.94ms. Allocated memory is still 71.3MB. Free memory was 22.3MB in the beginning and 20.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.95ms. Allocated memory is still 71.3MB. Free memory was 20.1MB in the beginning and 18.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 404.39ms. Allocated memory is still 71.3MB. Free memory was 18.9MB in the beginning and 24.5MB in the end (delta: -5.7MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * TraceAbstraction took 10532.25ms. Allocated memory was 71.3MB in the beginning and 394.3MB in the end (delta: 323.0MB). Free memory was 23.6MB in the beginning and 296.0MB in the end (delta: -272.4MB). Peak memory consumption was 270.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 267 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2384 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2384 mSDsluCounter, 3495 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2935 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5105 IncrementalHoareTripleChecker+Invalid, 5192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 560 mSDtfsCounter, 5105 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18569occurred in iteration=10, InterpolantAutomatonStates: 206, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1157 ConstructedInterpolants, 0 QuantifiedInterpolants, 4782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 21:57:45,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...