/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_27-multiple-protecting2_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:49:58,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:49:58,710 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:58,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:49:58,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:49:58,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:49:58,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:49:58,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:49:58,733 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:49:58,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:49:58,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:49:58,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:49:58,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:49:58,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:49:58,735 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:58,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:49:58,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:49:58,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:49:58,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:49:58,996 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:49:58,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-03-14 21:50:00,173 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881ceadc8/cc60f6a24ac148f7a1f0ac1fdbb4dd61/FLAGf95136cb4 [2025-03-14 21:50:00,414 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:50:00,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-03-14 21:50:00,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881ceadc8/cc60f6a24ac148f7a1f0ac1fdbb4dd61/FLAGf95136cb4 [2025-03-14 21:50:00,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881ceadc8/cc60f6a24ac148f7a1f0ac1fdbb4dd61 [2025-03-14 21:50:00,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:50:00,445 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:50:00,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:50:00,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:50:00,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:50:00,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9c7831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00, skipping insertion in model container [2025-03-14 21:50:00,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:50:00,592 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_27-multiple-protecting2_true.i[1097,1110] [2025-03-14 21:50:00,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:50:00,740 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:50:00,749 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_27-multiple-protecting2_true.i[1097,1110] [2025-03-14 21:50:00,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:50:00,796 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:50:00,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00 WrapperNode [2025-03-14 21:50:00,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:50:00,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:50:00,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:50:00,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:50:00,803 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:50:00" (1/1) ... [2025-03-14 21:50:00,819 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:50:00" (1/1) ... [2025-03-14 21:50:00,833 INFO L138 Inliner]: procedures = 163, calls = 54, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 109 [2025-03-14 21:50:00,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:50:00,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:50:00,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:50:00,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:50:00,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:50:00,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:50:00,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:50:00,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:50:00,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (1/1) ... [2025-03-14 21:50:00,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:50:00,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:50:00,896 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:50:00,899 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:50:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-14 21:50:00,913 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-14 21:50:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:50:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:50:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 21:50:00,913 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 21:50:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:50:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:50:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:50:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:50:00,914 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:50:00,991 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:50:00,992 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:50:01,183 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:50:01,183 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:50:01,223 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:50:01,224 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:50:01,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:50:01 BoogieIcfgContainer [2025-03-14 21:50:01,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:50:01,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:50:01,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:50:01,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:50:01,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:50:00" (1/3) ... [2025-03-14 21:50:01,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e0aa6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:50:01, skipping insertion in model container [2025-03-14 21:50:01,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:50:00" (2/3) ... [2025-03-14 21:50:01,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e0aa6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:50:01, skipping insertion in model container [2025-03-14 21:50:01,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:50:01" (3/3) ... [2025-03-14 21:50:01,235 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2025-03-14 21:50:01,244 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:50:01,245 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_27-multiple-protecting2_true.i that has 3 procedures, 156 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-14 21:50:01,246 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:50:01,316 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 21:50:01,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:50:01,362 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;@46e6fc75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:50:01,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 21:50:01,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:50:01,404 INFO L124 PetriNetUnfolderBase]: 0/81 cut-off events. [2025-03-14 21:50:01,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:50:01,408 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:01,408 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:50:01,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:01,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1082301462, now seen corresponding path program 1 times [2025-03-14 21:50:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968286646] [2025-03-14 21:50:01,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:01,810 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:50:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:01,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968286646] [2025-03-14 21:50:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968286646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:01,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:50:01,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738279777] [2025-03-14 21:50:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:01,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:50:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:01,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:50:01,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:50:01,837 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 159 [2025-03-14 21:50:01,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 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:50:01,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:01,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 159 [2025-03-14 21:50:01,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:03,448 INFO L124 PetriNetUnfolderBase]: 6620/13013 cut-off events. [2025-03-14 21:50:03,448 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-14 21:50:03,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23497 conditions, 13013 events. 6620/13013 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 110140 event pairs, 1596 based on Foata normal form. 224/12961 useless extension candidates. Maximal degree in co-relation 23412. Up to 5202 conditions per place. [2025-03-14 21:50:03,522 INFO L140 encePairwiseOnDemand]: 133/159 looper letters, 139 selfloop transitions, 27 changer transitions 26/274 dead transitions. [2025-03-14 21:50:03,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 274 transitions, 935 flow [2025-03-14 21:50:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:50:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:50:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1007 transitions. [2025-03-14 21:50:03,533 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2025-03-14 21:50:03,535 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 2 predicate places. [2025-03-14 21:50:03,536 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 274 transitions, 935 flow [2025-03-14 21:50:03,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 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:50:03,536 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:03,536 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] [2025-03-14 21:50:03,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:50:03,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2028190130, now seen corresponding path program 1 times [2025-03-14 21:50:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314740124] [2025-03-14 21:50:03,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:03,720 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:50:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:03,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314740124] [2025-03-14 21:50:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314740124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:03,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:50:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523647551] [2025-03-14 21:50:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:50:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:03,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:50:03,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:50:03,725 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 159 [2025-03-14 21:50:03,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 274 transitions, 935 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 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:50:03,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:03,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 159 [2025-03-14 21:50:03,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:04,431 INFO L124 PetriNetUnfolderBase]: 2735/6127 cut-off events. [2025-03-14 21:50:04,431 INFO L125 PetriNetUnfolderBase]: For 2278/2393 co-relation queries the response was YES. [2025-03-14 21:50:04,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13864 conditions, 6127 events. 2735/6127 cut-off events. For 2278/2393 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 49268 event pairs, 448 based on Foata normal form. 251/6250 useless extension candidates. Maximal degree in co-relation 13751. Up to 2414 conditions per place. [2025-03-14 21:50:04,457 INFO L140 encePairwiseOnDemand]: 151/159 looper letters, 112 selfloop transitions, 20 changer transitions 86/359 dead transitions. [2025-03-14 21:50:04,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 359 transitions, 1677 flow [2025-03-14 21:50:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 21:50:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 21:50:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2025-03-14 21:50:04,459 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.779874213836478 [2025-03-14 21:50:04,460 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 6 predicate places. [2025-03-14 21:50:04,460 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 359 transitions, 1677 flow [2025-03-14 21:50:04,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 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:50:04,460 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:04,460 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] [2025-03-14 21:50:04,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:50:04,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:04,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1360142495, now seen corresponding path program 1 times [2025-03-14 21:50:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:04,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908306005] [2025-03-14 21:50:04,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:04,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:04,750 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:50:04,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:04,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908306005] [2025-03-14 21:50:04,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908306005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:04,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:04,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:50:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677381378] [2025-03-14 21:50:04,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:04,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:50:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:04,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:50:04,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:50:04,753 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 159 [2025-03-14 21:50:04,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 359 transitions, 1677 flow. Second operand has 8 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 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:50:04,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:04,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 159 [2025-03-14 21:50:04,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:06,401 INFO L124 PetriNetUnfolderBase]: 3531/7403 cut-off events. [2025-03-14 21:50:06,402 INFO L125 PetriNetUnfolderBase]: For 4443/4733 co-relation queries the response was YES. [2025-03-14 21:50:06,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22763 conditions, 7403 events. 3531/7403 cut-off events. For 4443/4733 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 59759 event pairs, 103 based on Foata normal form. 8/7278 useless extension candidates. Maximal degree in co-relation 22633. Up to 3084 conditions per place. [2025-03-14 21:50:06,428 INFO L140 encePairwiseOnDemand]: 132/159 looper letters, 351 selfloop transitions, 117 changer transitions 334/882 dead transitions. [2025-03-14 21:50:06,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 882 transitions, 5944 flow [2025-03-14 21:50:06,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 21:50:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 21:50:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2802 transitions. [2025-03-14 21:50:06,433 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6777939042089985 [2025-03-14 21:50:06,433 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 31 predicate places. [2025-03-14 21:50:06,434 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 882 transitions, 5944 flow [2025-03-14 21:50:06,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.625) internal successors, (725), 8 states have internal predecessors, (725), 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:50:06,434 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:06,434 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] [2025-03-14 21:50:06,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:50:06,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:06,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash -806163844, now seen corresponding path program 1 times [2025-03-14 21:50:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574783465] [2025-03-14 21:50:06,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:06,563 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:50:06,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:06,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574783465] [2025-03-14 21:50:06,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574783465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:06,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:06,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:50:06,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59495543] [2025-03-14 21:50:06,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:06,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:50:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:06,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:50:06,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:50:06,565 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 159 [2025-03-14 21:50:06,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 882 transitions, 5944 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 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:50:06,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:06,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 159 [2025-03-14 21:50:06,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:07,749 INFO L124 PetriNetUnfolderBase]: 5355/11031 cut-off events. [2025-03-14 21:50:07,749 INFO L125 PetriNetUnfolderBase]: For 14681/15006 co-relation queries the response was YES. [2025-03-14 21:50:07,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39326 conditions, 11031 events. 5355/11031 cut-off events. For 14681/15006 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 89012 event pairs, 420 based on Foata normal form. 52/10847 useless extension candidates. Maximal degree in co-relation 39139. Up to 4816 conditions per place. [2025-03-14 21:50:07,788 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 507 selfloop transitions, 98 changer transitions 544/1249 dead transitions. [2025-03-14 21:50:07,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1249 transitions, 10791 flow [2025-03-14 21:50:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:50:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:50:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 976 transitions. [2025-03-14 21:50:07,791 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6820405310971349 [2025-03-14 21:50:07,791 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 39 predicate places. [2025-03-14 21:50:07,792 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 1249 transitions, 10791 flow [2025-03-14 21:50:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 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:50:07,792 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:07,792 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] [2025-03-14 21:50:07,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:50:07,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:07,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:07,793 INFO L85 PathProgramCache]: Analyzing trace with hash 571485503, now seen corresponding path program 1 times [2025-03-14 21:50:07,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:07,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586001419] [2025-03-14 21:50:07,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:07,935 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:50:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586001419] [2025-03-14 21:50:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586001419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:07,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:50:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948213591] [2025-03-14 21:50:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:07,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:50:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:07,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:50:07,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:50:07,936 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 159 [2025-03-14 21:50:07,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 1249 transitions, 10791 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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:50:07,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:07,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 159 [2025-03-14 21:50:07,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:08,844 INFO L124 PetriNetUnfolderBase]: 2968/7412 cut-off events. [2025-03-14 21:50:08,845 INFO L125 PetriNetUnfolderBase]: For 19872/19990 co-relation queries the response was YES. [2025-03-14 21:50:08,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29169 conditions, 7412 events. 2968/7412 cut-off events. For 19872/19990 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 61441 event pairs, 214 based on Foata normal form. 828/8116 useless extension candidates. Maximal degree in co-relation 28893. Up to 3810 conditions per place. [2025-03-14 21:50:08,874 INFO L140 encePairwiseOnDemand]: 139/159 looper letters, 147 selfloop transitions, 157 changer transitions 425/1081 dead transitions. [2025-03-14 21:50:08,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1081 transitions, 10626 flow [2025-03-14 21:50:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 21:50:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 21:50:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2025-03-14 21:50:08,876 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7811320754716982 [2025-03-14 21:50:08,877 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 41 predicate places. [2025-03-14 21:50:08,877 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 1081 transitions, 10626 flow [2025-03-14 21:50:08,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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:50:08,877 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:08,877 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] [2025-03-14 21:50:08,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 21:50:08,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:08,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash -556487681, now seen corresponding path program 2 times [2025-03-14 21:50:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226400480] [2025-03-14 21:50:08,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:50:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:08,903 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:50:08,904 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:50:09,150 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:50:09,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:09,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226400480] [2025-03-14 21:50:09,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226400480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:09,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:09,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:50:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316712025] [2025-03-14 21:50:09,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:09,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:50:09,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:09,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:50:09,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:50:09,152 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 159 [2025-03-14 21:50:09,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 1081 transitions, 10626 flow. Second operand has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 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:50:09,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:09,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 159 [2025-03-14 21:50:09,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:09,499 INFO L124 PetriNetUnfolderBase]: 543/2141 cut-off events. [2025-03-14 21:50:09,499 INFO L125 PetriNetUnfolderBase]: For 8495/8551 co-relation queries the response was YES. [2025-03-14 21:50:09,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8807 conditions, 2141 events. 543/2141 cut-off events. For 8495/8551 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14582 event pairs, 91 based on Foata normal form. 204/2331 useless extension candidates. Maximal degree in co-relation 8485. Up to 936 conditions per place. [2025-03-14 21:50:09,508 INFO L140 encePairwiseOnDemand]: 152/159 looper letters, 140 selfloop transitions, 20 changer transitions 190/469 dead transitions. [2025-03-14 21:50:09,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 469 transitions, 5030 flow [2025-03-14 21:50:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:50:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:50:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 685 transitions. [2025-03-14 21:50:09,510 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7180293501048218 [2025-03-14 21:50:09,510 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 23 predicate places. [2025-03-14 21:50:09,510 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 469 transitions, 5030 flow [2025-03-14 21:50:09,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 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:50:09,511 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:09,511 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] [2025-03-14 21:50:09,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:50:09,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1174104962, now seen corresponding path program 1 times [2025-03-14 21:50:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:09,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608167885] [2025-03-14 21:50:09,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:09,779 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:50:09,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:09,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608167885] [2025-03-14 21:50:09,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608167885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:09,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:09,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:50:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086551566] [2025-03-14 21:50:09,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:09,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:50:09,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:09,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:50:09,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:50:09,781 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 159 [2025-03-14 21:50:09,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 469 transitions, 5030 flow. Second operand has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 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:50:09,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:09,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 159 [2025-03-14 21:50:09,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:10,003 INFO L124 PetriNetUnfolderBase]: 225/1256 cut-off events. [2025-03-14 21:50:10,004 INFO L125 PetriNetUnfolderBase]: For 6361/6425 co-relation queries the response was YES. [2025-03-14 21:50:10,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5511 conditions, 1256 events. 225/1256 cut-off events. For 6361/6425 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7335 event pairs, 7 based on Foata normal form. 53/1305 useless extension candidates. Maximal degree in co-relation 5216. Up to 466 conditions per place. [2025-03-14 21:50:10,009 INFO L140 encePairwiseOnDemand]: 152/159 looper letters, 129 selfloop transitions, 43 changer transitions 148/427 dead transitions. [2025-03-14 21:50:10,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 427 transitions, 5002 flow [2025-03-14 21:50:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:50:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:50:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 691 transitions. [2025-03-14 21:50:10,010 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7243186582809225 [2025-03-14 21:50:10,011 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 28 predicate places. [2025-03-14 21:50:10,011 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 427 transitions, 5002 flow [2025-03-14 21:50:10,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 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:50:10,011 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:10,011 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] [2025-03-14 21:50:10,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 21:50:10,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:10,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash -710497693, now seen corresponding path program 1 times [2025-03-14 21:50:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:10,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916490747] [2025-03-14 21:50:10,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:50:10,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:50:10,163 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:50:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:10,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916490747] [2025-03-14 21:50:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916490747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:10,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:10,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:50:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723037198] [2025-03-14 21:50:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:10,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:50:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:10,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:50:10,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:50:10,165 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 159 [2025-03-14 21:50:10,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 427 transitions, 5002 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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:50:10,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:10,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 159 [2025-03-14 21:50:10,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:10,517 INFO L124 PetriNetUnfolderBase]: 243/1255 cut-off events. [2025-03-14 21:50:10,517 INFO L125 PetriNetUnfolderBase]: For 7747/7800 co-relation queries the response was YES. [2025-03-14 21:50:10,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6448 conditions, 1255 events. 243/1255 cut-off events. For 7747/7800 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7314 event pairs, 4 based on Foata normal form. 0/1255 useless extension candidates. Maximal degree in co-relation 6107. Up to 519 conditions per place. [2025-03-14 21:50:10,521 INFO L140 encePairwiseOnDemand]: 141/159 looper letters, 0 selfloop transitions, 0 changer transitions 502/502 dead transitions. [2025-03-14 21:50:10,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 502 transitions, 6898 flow [2025-03-14 21:50:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:50:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:50:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1163 transitions. [2025-03-14 21:50:10,523 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.609538784067086 [2025-03-14 21:50:10,523 INFO L298 CegarLoopForPetriNet]: 162 programPoint places, 37 predicate places. [2025-03-14 21:50:10,523 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 502 transitions, 6898 flow [2025-03-14 21:50:10,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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:50:10,528 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_27-multiple-protecting2_true.i_petrified1_AllErrorsAtOnce [2025-03-14 21:50:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-14 21:50:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 21:50:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-14 21:50:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 21:50:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-14 21:50:10,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-14 21:50:10,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 21:50:10,548 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:10,550 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 21:50:10,550 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 21:50:10,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 09:50:10 BasicIcfg [2025-03-14 21:50:10,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 21:50:10,554 INFO L158 Benchmark]: Toolchain (without parser) took 10108.63ms. Allocated memory was 71.3MB in the beginning and 801.1MB in the end (delta: 729.8MB). Free memory was 42.5MB in the beginning and 347.0MB in the end (delta: -304.5MB). Peak memory consumption was 421.5MB. Max. memory is 8.0GB. [2025-03-14 21:50:10,554 INFO L158 Benchmark]: CDTParser took 1.17ms. Allocated memory is still 71.3MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:50:10,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.95ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 21.9MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-14 21:50:10,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.05ms. Allocated memory is still 71.3MB. Free memory was 21.9MB in the beginning and 20.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 21:50:10,555 INFO L158 Benchmark]: Boogie Preprocessor took 20.99ms. Allocated memory is still 71.3MB. Free memory was 20.1MB in the beginning and 18.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:50:10,555 INFO L158 Benchmark]: RCFGBuilder took 366.89ms. Allocated memory is still 71.3MB. Free memory was 18.8MB in the beginning and 23.2MB in the end (delta: -4.4MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2025-03-14 21:50:10,556 INFO L158 Benchmark]: TraceAbstraction took 9327.63ms. Allocated memory was 71.3MB in the beginning and 801.1MB in the end (delta: 729.8MB). Free memory was 22.2MB in the beginning and 347.0MB in the end (delta: -324.8MB). Peak memory consumption was 401.8MB. Max. memory is 8.0GB. [2025-03-14 21:50:10,557 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.17ms. Allocated memory is still 71.3MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 350.95ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 21.9MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.05ms. Allocated memory is still 71.3MB. Free memory was 21.9MB in the beginning and 20.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.99ms. Allocated memory is still 71.3MB. Free memory was 20.1MB in the beginning and 18.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 366.89ms. Allocated memory is still 71.3MB. Free memory was 18.8MB in the beginning and 23.2MB in the end (delta: -4.4MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * TraceAbstraction took 9327.63ms. Allocated memory was 71.3MB in the beginning and 801.1MB in the end (delta: 729.8MB). Free memory was 22.2MB in the beginning and 347.0MB in the end (delta: -324.8MB). Peak memory consumption was 401.8MB. 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 5 procedures, 202 locations, 6 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: 9.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1104 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1104 mSDsluCounter, 967 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 712 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2604 IncrementalHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 255 mSDtfsCounter, 2604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10791occurred in iteration=4, InterpolantAutomatonStates: 78, 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.6s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 592 ConstructedInterpolants, 0 QuantifiedInterpolants, 2444 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:50:10,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...