/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/13-privatized_24-multiple-protecting_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:49:42,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:49:42,522 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:49:42,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:49:42,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:49:42,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:49:42,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:49:42,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:49:42,587 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:49:42,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:49:42,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:49:42,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:49:42,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:49:42,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:49:42,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:49:42,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:49:42,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:49:42,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:49:42,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:49:42,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:49:42,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:49:42,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:49:42,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:49:42,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:49:42,590 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:49:42,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:49:42,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:49:42,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:49:42,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:49:42,829 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:49:42,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-03-14 21:49:43,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9d3c778/ad9b1d331db841d1b9d586cd8674cdbb/FLAGcc1f5e836 [2025-03-14 21:49:44,191 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:49:44,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-03-14 21:49:44,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9d3c778/ad9b1d331db841d1b9d586cd8674cdbb/FLAGcc1f5e836 [2025-03-14 21:49:44,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9d3c778/ad9b1d331db841d1b9d586cd8674cdbb [2025-03-14 21:49:44,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:49:44,230 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:49:44,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:49:44,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:49:44,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:49:44,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd52448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44, skipping insertion in model container [2025-03-14 21:49:44,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:49:44,369 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/13-privatized_24-multiple-protecting_true.i[1096,1109] [2025-03-14 21:49:44,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:49:44,508 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:49:44,515 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/13-privatized_24-multiple-protecting_true.i[1096,1109] [2025-03-14 21:49:44,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:49:44,561 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:49:44,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44 WrapperNode [2025-03-14 21:49:44,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:49:44,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:49:44,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:49:44,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:49:44,566 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:49:44" (1/1) ... [2025-03-14 21:49:44,577 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:49:44" (1/1) ... [2025-03-14 21:49:44,592 INFO L138 Inliner]: procedures = 162, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2025-03-14 21:49:44,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:49:44,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:49:44,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:49:44,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:49:44,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:49:44,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:49:44,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:49:44,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:49:44,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (1/1) ... [2025-03-14 21:49:44,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:49:44,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:49:44,657 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:49:44,660 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:49:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:49:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:49:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 21:49:44,679 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 21:49:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:49:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:49:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:49:44,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:49:44,680 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:49:44,782 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:49:44,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:49:45,017 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:49:45,017 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:49:45,068 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:49:45,069 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:49:45,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:49:45 BoogieIcfgContainer [2025-03-14 21:49:45,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:49:45,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:49:45,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:49:45,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:49:45,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:49:44" (1/3) ... [2025-03-14 21:49:45,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1647b9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:49:45, skipping insertion in model container [2025-03-14 21:49:45,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:44" (2/3) ... [2025-03-14 21:49:45,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1647b9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:49:45, skipping insertion in model container [2025-03-14 21:49:45,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:49:45" (3/3) ... [2025-03-14 21:49:45,078 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2025-03-14 21:49:45,088 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:49:45,090 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_24-multiple-protecting_true.i that has 2 procedures, 144 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-14 21:49:45,090 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:49:45,133 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 21:49:45,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:49:45,187 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;@473aac4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:49:45,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 21:49:45,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:49:45,219 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-03-14 21:49:45,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:49:45,220 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:45,221 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] [2025-03-14 21:49:45,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:49:45,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash 344196864, now seen corresponding path program 1 times [2025-03-14 21:49:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:45,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202055863] [2025-03-14 21:49:45,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:45,564 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:49:45,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:45,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202055863] [2025-03-14 21:49:45,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202055863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:45,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:45,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:49:45,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529326798] [2025-03-14 21:49:45,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:49:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:45,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:49:45,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:49:45,595 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 147 [2025-03-14 21:49:45,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 147 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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:49:45,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:45,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 147 [2025-03-14 21:49:45,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:46,244 INFO L124 PetriNetUnfolderBase]: 808/2501 cut-off events. [2025-03-14 21:49:46,244 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 21:49:46,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 2501 events. 808/2501 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 17111 event pairs, 243 based on Foata normal form. 56/2472 useless extension candidates. Maximal degree in co-relation 4147. Up to 975 conditions per place. [2025-03-14 21:49:46,263 INFO L140 encePairwiseOnDemand]: 121/147 looper letters, 113 selfloop transitions, 27 changer transitions 25/238 dead transitions. [2025-03-14 21:49:46,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 238 transitions, 800 flow [2025-03-14 21:49:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:49:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:49:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2025-03-14 21:49:46,278 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.672713529856387 [2025-03-14 21:49:46,283 INFO L298 CegarLoopForPetriNet]: 147 programPoint places, 3 predicate places. [2025-03-14 21:49:46,283 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 238 transitions, 800 flow [2025-03-14 21:49:46,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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:49:46,284 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:46,284 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] [2025-03-14 21:49:46,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:49:46,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:49:46,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1163973503, now seen corresponding path program 1 times [2025-03-14 21:49:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:46,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078037250] [2025-03-14 21:49:46,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:46,496 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:49:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078037250] [2025-03-14 21:49:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078037250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:46,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:46,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:49:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600809266] [2025-03-14 21:49:46,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:46,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:49:46,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:46,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:49:46,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:49:46,500 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 147 [2025-03-14 21:49:46,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 238 transitions, 800 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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:49:46,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:46,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 147 [2025-03-14 21:49:46,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:46,773 INFO L124 PetriNetUnfolderBase]: 397/1376 cut-off events. [2025-03-14 21:49:46,773 INFO L125 PetriNetUnfolderBase]: For 405/412 co-relation queries the response was YES. [2025-03-14 21:49:46,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 1376 events. 397/1376 cut-off events. For 405/412 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8622 event pairs, 159 based on Foata normal form. 36/1368 useless extension candidates. Maximal degree in co-relation 2766. Up to 648 conditions per place. [2025-03-14 21:49:46,780 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 57 selfloop transitions, 10 changer transitions 78/255 dead transitions. [2025-03-14 21:49:46,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 255 transitions, 1098 flow [2025-03-14 21:49:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 21:49:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 21:49:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2025-03-14 21:49:46,783 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2025-03-14 21:49:46,783 INFO L298 CegarLoopForPetriNet]: 147 programPoint places, 7 predicate places. [2025-03-14 21:49:46,784 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 255 transitions, 1098 flow [2025-03-14 21:49:46,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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:49:46,784 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:46,784 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] [2025-03-14 21:49:46,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:49:46,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:49:46,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:46,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1886405929, now seen corresponding path program 1 times [2025-03-14 21:49:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259801843] [2025-03-14 21:49:46,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:47,021 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:49:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259801843] [2025-03-14 21:49:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259801843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:49:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137309868] [2025-03-14 21:49:47,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:47,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:49:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:47,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:49:47,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:49:47,024 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 147 [2025-03-14 21:49:47,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 255 transitions, 1098 flow. Second operand has 8 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 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:49:47,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:47,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 147 [2025-03-14 21:49:47,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:47,645 INFO L124 PetriNetUnfolderBase]: 460/1525 cut-off events. [2025-03-14 21:49:47,645 INFO L125 PetriNetUnfolderBase]: For 877/910 co-relation queries the response was YES. [2025-03-14 21:49:47,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4172 conditions, 1525 events. 460/1525 cut-off events. For 877/910 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9666 event pairs, 47 based on Foata normal form. 4/1501 useless extension candidates. Maximal degree in co-relation 4103. Up to 712 conditions per place. [2025-03-14 21:49:47,651 INFO L140 encePairwiseOnDemand]: 122/147 looper letters, 100 selfloop transitions, 25 changer transitions 184/378 dead transitions. [2025-03-14 21:49:47,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 378 transitions, 2302 flow [2025-03-14 21:49:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 21:49:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 21:49:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2137 transitions. [2025-03-14 21:49:47,659 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5814965986394558 [2025-03-14 21:49:47,660 INFO L298 CegarLoopForPetriNet]: 147 programPoint places, 27 predicate places. [2025-03-14 21:49:47,660 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 378 transitions, 2302 flow [2025-03-14 21:49:47,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 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:49:47,660 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:47,660 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] [2025-03-14 21:49:47,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:49:47,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:49:47,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1809097241, now seen corresponding path program 1 times [2025-03-14 21:49:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529962977] [2025-03-14 21:49:47,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:47,749 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:49:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:47,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529962977] [2025-03-14 21:49:47,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529962977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:47,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:47,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:49:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755678364] [2025-03-14 21:49:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:47,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:49:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:47,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:49:47,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:49:47,751 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 147 [2025-03-14 21:49:47,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 378 transitions, 2302 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:49:47,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:47,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 147 [2025-03-14 21:49:47,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:48,067 INFO L124 PetriNetUnfolderBase]: 678/2011 cut-off events. [2025-03-14 21:49:48,068 INFO L125 PetriNetUnfolderBase]: For 2487/2497 co-relation queries the response was YES. [2025-03-14 21:49:48,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6613 conditions, 2011 events. 678/2011 cut-off events. For 2487/2497 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12674 event pairs, 71 based on Foata normal form. 2/1986 useless extension candidates. Maximal degree in co-relation 6540. Up to 906 conditions per place. [2025-03-14 21:49:48,075 INFO L140 encePairwiseOnDemand]: 133/147 looper letters, 129 selfloop transitions, 19 changer transitions 250/469 dead transitions. [2025-03-14 21:49:48,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 469 transitions, 3632 flow [2025-03-14 21:49:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:49:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:49:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 857 transitions. [2025-03-14 21:49:48,077 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6477702191987906 [2025-03-14 21:49:48,078 INFO L298 CegarLoopForPetriNet]: 147 programPoint places, 35 predicate places. [2025-03-14 21:49:48,078 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 469 transitions, 3632 flow [2025-03-14 21:49:48,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:49:48,078 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:48,079 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] [2025-03-14 21:49:48,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:49:48,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:49:48,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 890069274, now seen corresponding path program 1 times [2025-03-14 21:49:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:48,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311288087] [2025-03-14 21:49:48,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:48,254 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:49:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311288087] [2025-03-14 21:49:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311288087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:48,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:48,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 21:49:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581682138] [2025-03-14 21:49:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:48,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 21:49:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:48,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 21:49:48,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 21:49:48,256 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 147 [2025-03-14 21:49:48,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 469 transitions, 3632 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 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:49:48,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:48,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 147 [2025-03-14 21:49:48,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:48,415 INFO L124 PetriNetUnfolderBase]: 212/972 cut-off events. [2025-03-14 21:49:48,415 INFO L125 PetriNetUnfolderBase]: For 2185/2191 co-relation queries the response was YES. [2025-03-14 21:49:48,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 972 events. 212/972 cut-off events. For 2185/2191 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5200 event pairs, 32 based on Foata normal form. 104/1070 useless extension candidates. Maximal degree in co-relation 3496. Up to 495 conditions per place. [2025-03-14 21:49:48,418 INFO L140 encePairwiseOnDemand]: 127/147 looper letters, 35 selfloop transitions, 39 changer transitions 117/305 dead transitions. [2025-03-14 21:49:48,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 305 transitions, 2576 flow [2025-03-14 21:49:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 21:49:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 21:49:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2025-03-14 21:49:48,419 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2025-03-14 21:49:48,420 INFO L298 CegarLoopForPetriNet]: 147 programPoint places, 22 predicate places. [2025-03-14 21:49:48,420 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 305 transitions, 2576 flow [2025-03-14 21:49:48,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 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:49:48,420 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:48,420 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] [2025-03-14 21:49:48,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 21:49:48,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:49:48,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1999236491, now seen corresponding path program 1 times [2025-03-14 21:49:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:48,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759984946] [2025-03-14 21:49:48,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:48,674 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:49:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759984946] [2025-03-14 21:49:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759984946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:49:48,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884087576] [2025-03-14 21:49:48,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:48,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:49:48,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:48,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:49:48,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:49:48,676 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 147 [2025-03-14 21:49:48,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 305 transitions, 2576 flow. Second operand has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 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:49:48,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:48,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 147 [2025-03-14 21:49:48,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:48,855 INFO L124 PetriNetUnfolderBase]: 182/867 cut-off events. [2025-03-14 21:49:48,855 INFO L125 PetriNetUnfolderBase]: For 2554/2562 co-relation queries the response was YES. [2025-03-14 21:49:48,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3458 conditions, 867 events. 182/867 cut-off events. For 2554/2562 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4332 event pairs, 37 based on Foata normal form. 10/872 useless extension candidates. Maximal degree in co-relation 3349. Up to 445 conditions per place. [2025-03-14 21:49:48,859 INFO L140 encePairwiseOnDemand]: 140/147 looper letters, 61 selfloop transitions, 9 changer transitions 124/276 dead transitions. [2025-03-14 21:49:48,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 276 transitions, 2538 flow [2025-03-14 21:49:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:49:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:49:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 621 transitions. [2025-03-14 21:49:48,861 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7040816326530612 [2025-03-14 21:49:48,861 INFO L298 CegarLoopForPetriNet]: 147 programPoint places, 24 predicate places. [2025-03-14 21:49:48,861 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 276 transitions, 2538 flow [2025-03-14 21:49:48,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 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:49:48,862 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:48,862 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] [2025-03-14 21:49:48,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:49:48,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:49:48,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:48,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1091304994, now seen corresponding path program 1 times [2025-03-14 21:49:48,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:48,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525867622] [2025-03-14 21:49:48,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:48,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:49,083 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:49:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:49,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525867622] [2025-03-14 21:49:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525867622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:49:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494550358] [2025-03-14 21:49:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:49,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:49:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:49,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:49:49,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:49:49,085 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 147 [2025-03-14 21:49:49,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 276 transitions, 2538 flow. Second operand has 8 states, 8 states have (on average 99.375) internal successors, (795), 8 states have internal predecessors, (795), 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:49:49,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:49,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 147 [2025-03-14 21:49:49,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:49,253 INFO L124 PetriNetUnfolderBase]: 58/498 cut-off events. [2025-03-14 21:49:49,254 INFO L125 PetriNetUnfolderBase]: For 2287/2292 co-relation queries the response was YES. [2025-03-14 21:49:49,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 498 events. 58/498 cut-off events. For 2287/2292 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1775 event pairs, 2 based on Foata normal form. 26/522 useless extension candidates. Maximal degree in co-relation 1985. Up to 237 conditions per place. [2025-03-14 21:49:49,255 INFO L140 encePairwiseOnDemand]: 140/147 looper letters, 53 selfloop transitions, 17 changer transitions 112/258 dead transitions. [2025-03-14 21:49:49,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 258 transitions, 2570 flow [2025-03-14 21:49:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:49:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:49:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 622 transitions. [2025-03-14 21:49:49,257 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7052154195011338 [2025-03-14 21:49:49,257 INFO L298 CegarLoopForPetriNet]: 147 programPoint places, 29 predicate places. [2025-03-14 21:49:49,257 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 258 transitions, 2570 flow [2025-03-14 21:49:49,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.375) internal successors, (795), 8 states have internal predecessors, (795), 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:49:49,258 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:49,258 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:49:49,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 21:49:49,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:49:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1982693433, now seen corresponding path program 1 times [2025-03-14 21:49:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653259241] [2025-03-14 21:49:49,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:49,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:49,406 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:49:49,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:49,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653259241] [2025-03-14 21:49:49,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653259241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:49,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:49:49,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568141588] [2025-03-14 21:49:49,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:49,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:49:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:49,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:49:49,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:49:49,408 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 147 [2025-03-14 21:49:49,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 258 transitions, 2570 flow. Second operand has 8 states, 8 states have (on average 83.375) internal successors, (667), 8 states have internal predecessors, (667), 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:49:49,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:49,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 147 [2025-03-14 21:49:49,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:49,631 INFO L124 PetriNetUnfolderBase]: 62/498 cut-off events. [2025-03-14 21:49:49,632 INFO L125 PetriNetUnfolderBase]: For 2677/2684 co-relation queries the response was YES. [2025-03-14 21:49:49,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 498 events. 62/498 cut-off events. For 2677/2684 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1776 event pairs, 2 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 2337. Up to 239 conditions per place. [2025-03-14 21:49:49,633 INFO L140 encePairwiseOnDemand]: 129/147 looper letters, 0 selfloop transitions, 0 changer transitions 284/284 dead transitions. [2025-03-14 21:49:49,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 284 transitions, 3334 flow [2025-03-14 21:49:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:49:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:49:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1022 transitions. [2025-03-14 21:49:49,635 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2025-03-14 21:49:49,636 INFO L298 CegarLoopForPetriNet]: 147 programPoint places, 38 predicate places. [2025-03-14 21:49:49,636 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 284 transitions, 3334 flow [2025-03-14 21:49:49,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.375) internal successors, (667), 8 states have internal predecessors, (667), 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:49:49,643 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_24-multiple-protecting_true.i_petrified1_AllErrorsAtOnce [2025-03-14 21:49:49,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-03-14 21:49:49,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 21:49:49,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-14 21:49:49,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 21:49:49,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-14 21:49:49,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 21:49:49,670 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:49:49,672 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 21:49:49,672 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 21:49:49,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 09:49:49 BasicIcfg [2025-03-14 21:49:49,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 21:49:49,677 INFO L158 Benchmark]: Toolchain (without parser) took 5447.27ms. Allocated memory was 71.3MB in the beginning and 306.2MB in the end (delta: 234.9MB). Free memory was 42.2MB in the beginning and 129.1MB in the end (delta: -86.9MB). Peak memory consumption was 144.1MB. Max. memory is 8.0GB. [2025-03-14 21:49:49,677 INFO L158 Benchmark]: CDTParser took 1.20ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:49:49,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.28ms. Allocated memory is still 71.3MB. Free memory was 42.0MB in the beginning and 21.6MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-14 21:49:49,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.07ms. Allocated memory is still 71.3MB. Free memory was 21.6MB in the beginning and 19.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 21:49:49,679 INFO L158 Benchmark]: Boogie Preprocessor took 20.92ms. Allocated memory is still 71.3MB. Free memory was 19.8MB in the beginning and 18.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:49:49,679 INFO L158 Benchmark]: RCFGBuilder took 455.15ms. Allocated memory is still 71.3MB. Free memory was 18.6MB in the beginning and 24.0MB in the end (delta: -5.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2025-03-14 21:49:49,680 INFO L158 Benchmark]: TraceAbstraction took 4604.56ms. Allocated memory was 71.3MB in the beginning and 306.2MB in the end (delta: 234.9MB). Free memory was 23.0MB in the beginning and 129.1MB in the end (delta: -106.1MB). Peak memory consumption was 128.5MB. Max. memory is 8.0GB. [2025-03-14 21:49:49,681 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.20ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 330.28ms. Allocated memory is still 71.3MB. Free memory was 42.0MB in the beginning and 21.6MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.07ms. Allocated memory is still 71.3MB. Free memory was 21.6MB in the beginning and 19.8MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.92ms. Allocated memory is still 71.3MB. Free memory was 19.8MB in the beginning and 18.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 455.15ms. Allocated memory is still 71.3MB. Free memory was 18.6MB in the beginning and 24.0MB in the end (delta: -5.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * TraceAbstraction took 4604.56ms. Allocated memory was 71.3MB in the beginning and 306.2MB in the end (delta: 234.9MB). Free memory was 23.0MB in the beginning and 129.1MB in the end (delta: -106.1MB). Peak memory consumption was 128.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 - 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, 185 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1666 IncrementalHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 165 mSDtfsCounter, 1666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3632occurred in iteration=4, InterpolantAutomatonStates: 77, 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, 1.4s InterpolantComputationTime, 614 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 606 ConstructedInterpolants, 0 QuantifiedInterpolants, 2633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 21:49:49,698 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...