/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_25-struct_nr_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:49:51,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:49:51,816 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:51,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:49:51,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:49:51,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:49:51,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:49:51,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:49:51,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:49:51,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:49:51,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:49:51,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:49:51,841 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:52,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:49:52,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:49:52,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:49:52,083 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:49:52,083 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:49:52,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.i [2025-03-14 21:49:53,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c653a4a05/c08fb2cdf35e48eb93b7349ef1799510/FLAG1e243f1f6 [2025-03-14 21:49:53,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:49:53,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_25-struct_nr_true.i [2025-03-14 21:49:53,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c653a4a05/c08fb2cdf35e48eb93b7349ef1799510/FLAG1e243f1f6 [2025-03-14 21:49:53,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c653a4a05/c08fb2cdf35e48eb93b7349ef1799510 [2025-03-14 21:49:53,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:49:53,538 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:49:53,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:49:53,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:49:53,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:49:53,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:49:53" (1/1) ... [2025-03-14 21:49:53,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63236330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:53, skipping insertion in model container [2025-03-14 21:49:53,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:49:53" (1/1) ... [2025-03-14 21:49:53,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:49:53,675 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_25-struct_nr_true.i[1086,1099] [2025-03-14 21:49:53,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:49:53,772 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:49:53,781 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_25-struct_nr_true.i[1086,1099] [2025-03-14 21:49:53,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:49:53,823 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:49:53,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:53 WrapperNode [2025-03-14 21:49:53,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:49:53,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:49:53,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:49:53,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:49:53,830 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:53" (1/1) ... [2025-03-14 21:49:53,839 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:53" (1/1) ... [2025-03-14 21:49:53,853 INFO L138 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 75 [2025-03-14 21:49:53,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:49:53,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:49:53,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:49:53,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:49:53,860 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:53" (1/1) ... [2025-03-14 21:49:53,860 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:53" (1/1) ... [2025-03-14 21:49:53,862 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:53" (1/1) ... [2025-03-14 21:49:53,862 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:53" (1/1) ... [2025-03-14 21:49:53,866 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:53" (1/1) ... [2025-03-14 21:49:53,866 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:53" (1/1) ... [2025-03-14 21:49:53,871 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:53" (1/1) ... [2025-03-14 21:49:53,874 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:53" (1/1) ... [2025-03-14 21:49:53,874 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:53" (1/1) ... [2025-03-14 21:49:53,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:49:53,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:49:53,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:49:53,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:49:53,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:53" (1/1) ... [2025-03-14 21:49:53,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:49:53,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:49:53,910 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:53,919 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:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:49:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:49:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 21:49:53,935 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 21:49:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:49:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:49:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:49:53,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:49:53,936 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:54,011 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:49:54,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:49:54,127 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:49:54,127 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:49:54,145 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:49:54,145 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:49:54,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:49:54 BoogieIcfgContainer [2025-03-14 21:49:54,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:49:54,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:49:54,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:49:54,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:49:54,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:49:53" (1/3) ... [2025-03-14 21:49:54,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd88163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:49:54, skipping insertion in model container [2025-03-14 21:49:54,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:49:53" (2/3) ... [2025-03-14 21:49:54,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd88163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:49:54, skipping insertion in model container [2025-03-14 21:49:54,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:49:54" (3/3) ... [2025-03-14 21:49:54,156 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.i [2025-03-14 21:49:54,168 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:49:54,169 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_25-struct_nr_true.i that has 2 procedures, 87 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-14 21:49:54,169 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:49:54,207 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 21:49:54,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:49:54,256 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;@5ef85a03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:49:54,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 21:49:54,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:49:54,280 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-14 21:49:54,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:49:54,281 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:54,282 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] [2025-03-14 21:49:54,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:49:54,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1261909099, now seen corresponding path program 1 times [2025-03-14 21:49:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725422193] [2025-03-14 21:49:54,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:54,601 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:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:54,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725422193] [2025-03-14 21:49:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725422193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:54,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:49:54,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653685315] [2025-03-14 21:49:54,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:54,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:49:54,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:54,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:49:54,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:49:54,632 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 90 [2025-03-14 21:49:54,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 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:54,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:54,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 90 [2025-03-14 21:49:54,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:54,819 INFO L124 PetriNetUnfolderBase]: 78/344 cut-off events. [2025-03-14 21:49:54,819 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 21:49:54,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 344 events. 78/344 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1590 event pairs, 40 based on Foata normal form. 31/352 useless extension candidates. Maximal degree in co-relation 487. Up to 152 conditions per place. [2025-03-14 21:49:54,826 INFO L140 encePairwiseOnDemand]: 77/90 looper letters, 28 selfloop transitions, 9 changer transitions 7/91 dead transitions. [2025-03-14 21:49:54,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 91 transitions, 268 flow [2025-03-14 21:49:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:49:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:49:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 365 transitions. [2025-03-14 21:49:54,837 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2025-03-14 21:49:54,840 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, -2 predicate places. [2025-03-14 21:49:54,841 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 268 flow [2025-03-14 21:49:54,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 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:54,842 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:54,842 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:49:54,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:49:54,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:49:54,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:54,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2035098425, now seen corresponding path program 1 times [2025-03-14 21:49:54,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:54,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888633759] [2025-03-14 21:49:54,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:54,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:55,025 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:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888633759] [2025-03-14 21:49:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888633759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 21:49:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323116779] [2025-03-14 21:49:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:55,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 21:49:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:55,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 21:49:55,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 21:49:55,027 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 90 [2025-03-14 21:49:55,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 52.666666666666664) internal successors, (316), 6 states have internal predecessors, (316), 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:55,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:55,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 90 [2025-03-14 21:49:55,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:55,320 INFO L124 PetriNetUnfolderBase]: 269/939 cut-off events. [2025-03-14 21:49:55,321 INFO L125 PetriNetUnfolderBase]: For 194/210 co-relation queries the response was YES. [2025-03-14 21:49:55,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2045 conditions, 939 events. 269/939 cut-off events. For 194/210 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5800 event pairs, 141 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1977. Up to 431 conditions per place. [2025-03-14 21:49:55,331 INFO L140 encePairwiseOnDemand]: 76/90 looper letters, 76 selfloop transitions, 23 changer transitions 18/161 dead transitions. [2025-03-14 21:49:55,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 161 transitions, 742 flow [2025-03-14 21:49:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 21:49:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 21:49:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 662 transitions. [2025-03-14 21:49:55,335 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6686868686868687 [2025-03-14 21:49:55,340 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2025-03-14 21:49:55,340 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 161 transitions, 742 flow [2025-03-14 21:49:55,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.666666666666664) internal successors, (316), 6 states have internal predecessors, (316), 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:55,340 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:55,340 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] [2025-03-14 21:49:55,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:49:55,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:49:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -530646704, now seen corresponding path program 1 times [2025-03-14 21:49:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596195251] [2025-03-14 21:49:55,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:55,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:55,477 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:55,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596195251] [2025-03-14 21:49:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596195251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:55,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:55,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:49:55,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845222562] [2025-03-14 21:49:55,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:55,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:49:55,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:55,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:49:55,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:49:55,479 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 90 [2025-03-14 21:49:55,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 161 transitions, 742 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 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:55,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:55,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 90 [2025-03-14 21:49:55,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:55,741 INFO L124 PetriNetUnfolderBase]: 372/1253 cut-off events. [2025-03-14 21:49:55,742 INFO L125 PetriNetUnfolderBase]: For 618/751 co-relation queries the response was YES. [2025-03-14 21:49:55,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 1253 events. 372/1253 cut-off events. For 618/751 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8610 event pairs, 114 based on Foata normal form. 17/1205 useless extension candidates. Maximal degree in co-relation 3388. Up to 610 conditions per place. [2025-03-14 21:49:55,747 INFO L140 encePairwiseOnDemand]: 73/90 looper letters, 89 selfloop transitions, 49 changer transitions 44/246 dead transitions. [2025-03-14 21:49:55,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 246 transitions, 1582 flow [2025-03-14 21:49:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 21:49:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 21:49:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 794 transitions. [2025-03-14 21:49:55,749 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6301587301587301 [2025-03-14 21:49:55,750 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, 21 predicate places. [2025-03-14 21:49:55,750 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 246 transitions, 1582 flow [2025-03-14 21:49:55,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 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:55,750 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:55,750 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] [2025-03-14 21:49:55,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:49:55,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:49:55,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash -883934608, now seen corresponding path program 1 times [2025-03-14 21:49:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969624099] [2025-03-14 21:49:55,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:55,825 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:55,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:55,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969624099] [2025-03-14 21:49:55,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969624099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:55,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:55,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:49:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175495769] [2025-03-14 21:49:55,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:55,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:49:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:55,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:49:55,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:49:55,827 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2025-03-14 21:49:55,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 246 transitions, 1582 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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:55,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:55,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2025-03-14 21:49:55,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:55,861 INFO L124 PetriNetUnfolderBase]: 7/145 cut-off events. [2025-03-14 21:49:55,861 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-14 21:49:55,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 145 events. 7/145 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 207 event pairs, 2 based on Foata normal form. 29/169 useless extension candidates. Maximal degree in co-relation 285. Up to 43 conditions per place. [2025-03-14 21:49:55,862 INFO L140 encePairwiseOnDemand]: 86/90 looper letters, 7 selfloop transitions, 6 changer transitions 17/112 dead transitions. [2025-03-14 21:49:55,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 112 transitions, 579 flow [2025-03-14 21:49:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:49:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:49:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2025-03-14 21:49:55,863 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2025-03-14 21:49:55,864 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, 18 predicate places. [2025-03-14 21:49:55,864 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 112 transitions, 579 flow [2025-03-14 21:49:55,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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:55,864 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:55,864 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] [2025-03-14 21:49:55,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:49:55,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:49:55,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:55,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1385871984, now seen corresponding path program 1 times [2025-03-14 21:49:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:55,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679756079] [2025-03-14 21:49:55,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:55,936 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:55,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679756079] [2025-03-14 21:49:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679756079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:55,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:55,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:49:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778552104] [2025-03-14 21:49:55,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:55,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:49:55,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:55,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:49:55,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:49:55,938 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 90 [2025-03-14 21:49:55,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 112 transitions, 579 flow. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 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:55,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:55,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 90 [2025-03-14 21:49:55,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:56,000 INFO L124 PetriNetUnfolderBase]: 7/141 cut-off events. [2025-03-14 21:49:56,000 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-03-14 21:49:56,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 141 events. 7/141 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 191 event pairs, 2 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 335. Up to 46 conditions per place. [2025-03-14 21:49:56,001 INFO L140 encePairwiseOnDemand]: 81/90 looper letters, 29 selfloop transitions, 8 changer transitions 24/109 dead transitions. [2025-03-14 21:49:56,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 109 transitions, 677 flow [2025-03-14 21:49:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:49:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:49:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 342 transitions. [2025-03-14 21:49:56,003 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-14 21:49:56,003 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, 21 predicate places. [2025-03-14 21:49:56,003 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 677 flow [2025-03-14 21:49:56,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 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:56,003 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:56,003 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:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 21:49:56,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:49:56,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1146179008, now seen corresponding path program 1 times [2025-03-14 21:49:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985161431] [2025-03-14 21:49:56,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:56,165 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:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985161431] [2025-03-14 21:49:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985161431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 21:49:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187093987] [2025-03-14 21:49:56,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:56,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 21:49:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:56,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 21:49:56,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-14 21:49:56,167 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 90 [2025-03-14 21:49:56,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 677 flow. Second operand has 9 states, 9 states have (on average 49.22222222222222) internal successors, (443), 9 states have internal predecessors, (443), 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:56,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:56,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 90 [2025-03-14 21:49:56,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:56,342 INFO L124 PetriNetUnfolderBase]: 9/141 cut-off events. [2025-03-14 21:49:56,342 INFO L125 PetriNetUnfolderBase]: For 237/239 co-relation queries the response was YES. [2025-03-14 21:49:56,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 141 events. 9/141 cut-off events. For 237/239 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 189 event pairs, 1 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 406. Up to 45 conditions per place. [2025-03-14 21:49:56,343 INFO L140 encePairwiseOnDemand]: 73/90 looper letters, 14 selfloop transitions, 13 changer transitions 51/113 dead transitions. [2025-03-14 21:49:56,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 113 transitions, 823 flow [2025-03-14 21:49:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 21:49:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 21:49:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 894 transitions. [2025-03-14 21:49:56,345 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5518518518518518 [2025-03-14 21:49:56,345 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, 36 predicate places. [2025-03-14 21:49:56,345 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 113 transitions, 823 flow [2025-03-14 21:49:56,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 49.22222222222222) internal successors, (443), 9 states have internal predecessors, (443), 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:56,346 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:49:56,346 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] [2025-03-14 21:49:56,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:49:56,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 21:49:56,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:49:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1258765538, now seen corresponding path program 1 times [2025-03-14 21:49:56,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:49:56,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668232559] [2025-03-14 21:49:56,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:49:56,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:49:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:49:56,484 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:56,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:49:56,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668232559] [2025-03-14 21:49:56,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668232559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:49:56,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:49:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 21:49:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184348022] [2025-03-14 21:49:56,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:49:56,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 21:49:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:49:56,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 21:49:56,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 21:49:56,486 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 90 [2025-03-14 21:49:56,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 113 transitions, 823 flow. Second operand has 8 states, 8 states have (on average 51.125) internal successors, (409), 8 states have internal predecessors, (409), 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:56,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:49:56,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 90 [2025-03-14 21:49:56,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:49:56,649 INFO L124 PetriNetUnfolderBase]: 14/144 cut-off events. [2025-03-14 21:49:56,649 INFO L125 PetriNetUnfolderBase]: For 350/354 co-relation queries the response was YES. [2025-03-14 21:49:56,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 144 events. 14/144 cut-off events. For 350/354 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 204 event pairs, 1 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 485. Up to 45 conditions per place. [2025-03-14 21:49:56,650 INFO L140 encePairwiseOnDemand]: 73/90 looper letters, 0 selfloop transitions, 0 changer transitions 114/114 dead transitions. [2025-03-14 21:49:56,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 114 transitions, 957 flow [2025-03-14 21:49:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 21:49:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 21:49:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 877 transitions. [2025-03-14 21:49:56,652 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5732026143790849 [2025-03-14 21:49:56,652 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, 50 predicate places. [2025-03-14 21:49:56,652 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 114 transitions, 957 flow [2025-03-14 21:49:56,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 51.125) internal successors, (409), 8 states have internal predecessors, (409), 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:56,656 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_25-struct_nr_true.i_petrified1_AllErrorsAtOnce [2025-03-14 21:49:56,669 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-14 21:49:56,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-14 21:49:56,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-14 21:49:56,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-14 21:49:56,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-14 21:49:56,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-14 21:49:56,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-14 21:49:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 21:49:56,670 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:49:56,673 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 21:49:56,673 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 21:49:56,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 09:49:56 BasicIcfg [2025-03-14 21:49:56,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 21:49:56,676 INFO L158 Benchmark]: Toolchain (without parser) took 3138.87ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 42.6MB in the beginning and 44.7MB in the end (delta: -2.2MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2025-03-14 21:49:56,676 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:49:56,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.74ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 23.1MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-14 21:49:56,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.11ms. Allocated memory is still 71.3MB. Free memory was 23.1MB in the beginning and 21.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 21:49:56,677 INFO L158 Benchmark]: Boogie Preprocessor took 20.89ms. Allocated memory is still 71.3MB. Free memory was 21.3MB in the beginning and 20.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 21:49:56,677 INFO L158 Benchmark]: RCFGBuilder took 269.54ms. Allocated memory is still 71.3MB. Free memory was 20.3MB in the beginning and 33.6MB in the end (delta: -13.3MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2025-03-14 21:49:56,677 INFO L158 Benchmark]: TraceAbstraction took 2525.95ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 32.4MB in the beginning and 44.7MB in the end (delta: -12.4MB). Peak memory consumption was 27.8MB. Max. memory is 8.0GB. [2025-03-14 21:49:56,678 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.74ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 23.1MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.11ms. Allocated memory is still 71.3MB. Free memory was 23.1MB in the beginning and 21.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.89ms. Allocated memory is still 71.3MB. Free memory was 21.3MB in the beginning and 20.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 269.54ms. Allocated memory is still 71.3MB. Free memory was 20.3MB in the beginning and 33.6MB in the end (delta: -13.3MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2525.95ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 32.4MB in the beginning and 44.7MB in the end (delta: -12.4MB). Peak memory consumption was 27.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 3 procedures, 118 locations, 7 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: 2.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 788 IncrementalHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 154 mSDtfsCounter, 788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1582occurred in iteration=3, InterpolantAutomatonStates: 75, 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, 0.9s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:56,688 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...