/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 ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:51:56,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:51:56,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:51:56,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:51:56,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:51:56,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:51:56,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:51:56,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:51:56,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:51:56,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:51:56,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:51:56,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:51:56,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:51:56,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:51:56,446 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:51:56,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:51:56,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:51:56,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:51:56,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:51:56,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:51:56,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:51:56,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:51:56,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:51:56,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:51:56,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:56,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:51:56,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:56,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:51:56,450 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:51:56,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:51:56,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:51:56,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:51:56,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:51:56,689 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:51:56,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2025-04-14 00:51:58,075 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546d09488/3bdaf3900b33462989f58c5331e596e8/FLAG9cde9412a [2025-04-14 00:51:58,265 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:51:58,265 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2025-04-14 00:51:58,272 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546d09488/3bdaf3900b33462989f58c5331e596e8/FLAG9cde9412a [2025-04-14 00:51:59,076 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546d09488/3bdaf3900b33462989f58c5331e596e8 [2025-04-14 00:51:59,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:51:59,079 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:51:59,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:51:59,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:51:59,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:51:59,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462654f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59, skipping insertion in model container [2025-04-14 00:51:59,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:51:59,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c[2491,2504] [2025-04-14 00:51:59,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:51:59,229 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:51:59,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c[2491,2504] [2025-04-14 00:51:59,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:51:59,263 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:51:59,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59 WrapperNode [2025-04-14 00:51:59,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:51:59,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:51:59,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:51:59,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:51:59,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,292 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 113 [2025-04-14 00:51:59,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:51:59,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:51:59,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:51:59,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:51:59,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,309 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:51:59,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:51:59,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:51:59,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:51:59,316 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:51:59,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (1/1) ... [2025-04-14 00:51:59,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:51:59,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:51:59,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:51:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:51:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:51:59,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:51:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:51:59,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:51:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:51:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:51:59,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:51:59,356 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:51:59,413 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:51:59,414 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:51:59,560 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:51:59,561 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:51:59,561 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:51:59,707 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:51:59,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:51:59 BoogieIcfgContainer [2025-04-14 00:51:59,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:51:59,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:51:59,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:51:59,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:51:59,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:51:59" (1/3) ... [2025-04-14 00:51:59,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a02dcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:51:59, skipping insertion in model container [2025-04-14 00:51:59,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:59" (2/3) ... [2025-04-14 00:51:59,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a02dcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:51:59, skipping insertion in model container [2025-04-14 00:51:59,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:51:59" (3/3) ... [2025-04-14 00:51:59,715 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bluetooth.wvr.c [2025-04-14 00:51:59,725 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:51:59,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bluetooth.wvr.c that has 3 procedures, 41 locations, 41 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:51:59,726 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:51:59,768 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:51:59,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 100 flow [2025-04-14 00:51:59,825 INFO L116 PetriNetUnfolderBase]: 3/41 cut-off events. [2025-04-14 00:51:59,827 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:51:59,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 3/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-04-14 00:51:59,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 100 flow [2025-04-14 00:51:59,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 40 transitions, 92 flow [2025-04-14 00:51:59,840 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:51:59,846 INFO L340 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=LoopHeads, 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;@3dcfc7d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:51:59,847 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:51:59,856 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:51:59,856 INFO L116 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-04-14 00:51:59,856 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:51:59,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:59,857 INFO L206 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] [2025-04-14 00:51:59,857 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:59,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1496296166, now seen corresponding path program 1 times [2025-04-14 00:51:59,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:59,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873593110] [2025-04-14 00:51:59,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:51:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:59,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:51:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:51:59,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:51:59,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:00,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873593110] [2025-04-14 00:52:00,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873593110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:00,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:00,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:52:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814034432] [2025-04-14 00:52:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:00,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:00,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:00,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:00,140 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 00:52:00,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-04-14 00:52:00,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:00,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 00:52:00,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:00,355 INFO L116 PetriNetUnfolderBase]: 304/551 cut-off events. [2025-04-14 00:52:00,355 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-14 00:52:00,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 551 events. 304/551 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2055 event pairs, 145 based on Foata normal form. 17/499 useless extension candidates. Maximal degree in co-relation 1013. Up to 276 conditions per place. [2025-04-14 00:52:00,364 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 52 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-04-14 00:52:00,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 250 flow [2025-04-14 00:52:00,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-14 00:52:00,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5426356589147286 [2025-04-14 00:52:00,379 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 92 flow. Second operand 3 states and 70 transitions. [2025-04-14 00:52:00,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 250 flow [2025-04-14 00:52:00,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:52:00,386 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 109 flow [2025-04-14 00:52:00,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2025-04-14 00:52:00,393 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-04-14 00:52:00,393 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 109 flow [2025-04-14 00:52:00,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-04-14 00:52:00,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:00,393 INFO L206 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] [2025-04-14 00:52:00,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:52:00,394 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:00,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:00,395 INFO L85 PathProgramCache]: Analyzing trace with hash 376656582, now seen corresponding path program 1 times [2025-04-14 00:52:00,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:00,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695944910] [2025-04-14 00:52:00,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:00,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:00,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:52:00,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:52:00,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:00,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:00,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:00,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695944910] [2025-04-14 00:52:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695944910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:00,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:00,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:52:00,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574846257] [2025-04-14 00:52:00,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:00,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:00,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:00,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:00,682 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 00:52:00,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04-14 00:52:00,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:00,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 00:52:00,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:00,902 INFO L116 PetriNetUnfolderBase]: 525/941 cut-off events. [2025-04-14 00:52:00,902 INFO L117 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-04-14 00:52:00,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 941 events. 525/941 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4238 event pairs, 323 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 943. Up to 513 conditions per place. [2025-04-14 00:52:00,907 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 39 selfloop transitions, 0 changer transitions 35/76 dead transitions. [2025-04-14 00:52:00,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 346 flow [2025-04-14 00:52:00,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:52:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:52:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-14 00:52:00,910 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5058139534883721 [2025-04-14 00:52:00,910 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 109 flow. Second operand 4 states and 87 transitions. [2025-04-14 00:52:00,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 346 flow [2025-04-14 00:52:00,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:00,912 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 106 flow [2025-04-14 00:52:00,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-04-14 00:52:00,912 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-04-14 00:52:00,912 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 106 flow [2025-04-14 00:52:00,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-04-14 00:52:00,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:00,913 INFO L206 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] [2025-04-14 00:52:00,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:52:00,913 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:00,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:00,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1867092571, now seen corresponding path program 1 times [2025-04-14 00:52:00,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:00,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770556507] [2025-04-14 00:52:00,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:00,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:52:00,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:52:00,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:00,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:00,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770556507] [2025-04-14 00:52:00,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770556507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:00,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:00,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:52:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796325496] [2025-04-14 00:52:00,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:00,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:00,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:00,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:00,961 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 00:52:00,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-04-14 00:52:00,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:00,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 00:52:00,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:01,066 INFO L116 PetriNetUnfolderBase]: 358/677 cut-off events. [2025-04-14 00:52:01,066 INFO L117 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-04-14 00:52:01,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 677 events. 358/677 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2869 event pairs, 153 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 1475. Up to 383 conditions per place. [2025-04-14 00:52:01,070 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 52 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2025-04-14 00:52:01,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 281 flow [2025-04-14 00:52:01,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-14 00:52:01,071 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-04-14 00:52:01,071 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 106 flow. Second operand 3 states and 72 transitions. [2025-04-14 00:52:01,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 281 flow [2025-04-14 00:52:01,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 273 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:01,074 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 162 flow [2025-04-14 00:52:01,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-14 00:52:01,074 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-04-14 00:52:01,074 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 162 flow [2025-04-14 00:52:01,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-04-14 00:52:01,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:01,075 INFO L206 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] [2025-04-14 00:52:01,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:52:01,075 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:01,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash 85682533, now seen corresponding path program 2 times [2025-04-14 00:52:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:01,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213074344] [2025-04-14 00:52:01,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:01,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:52:01,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:52:01,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:01,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:01,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213074344] [2025-04-14 00:52:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213074344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:01,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136637542] [2025-04-14 00:52:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:01,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:52:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:01,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:52:01,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:52:01,334 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 00:52:01,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-04-14 00:52:01,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:01,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 00:52:01,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:01,550 INFO L116 PetriNetUnfolderBase]: 392/750 cut-off events. [2025-04-14 00:52:01,550 INFO L117 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-04-14 00:52:01,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1916 conditions, 750 events. 392/750 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3287 event pairs, 68 based on Foata normal form. 2/752 useless extension candidates. Maximal degree in co-relation 1910. Up to 394 conditions per place. [2025-04-14 00:52:01,553 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 4 changer transitions 55/94 dead transitions. [2025-04-14 00:52:01,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 507 flow [2025-04-14 00:52:01,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:52:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:52:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2025-04-14 00:52:01,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3687707641196013 [2025-04-14 00:52:01,556 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 162 flow. Second operand 7 states and 111 transitions. [2025-04-14 00:52:01,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 507 flow [2025-04-14 00:52:01,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 94 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:01,561 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 130 flow [2025-04-14 00:52:01,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-04-14 00:52:01,562 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2025-04-14 00:52:01,562 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 130 flow [2025-04-14 00:52:01,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-04-14 00:52:01,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:01,562 INFO L206 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] [2025-04-14 00:52:01,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:52:01,563 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:01,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1093942190, now seen corresponding path program 1 times [2025-04-14 00:52:01,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:01,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282552299] [2025-04-14 00:52:01,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:01,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:01,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:52:01,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:52:01,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:01,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:01,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:01,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282552299] [2025-04-14 00:52:01,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282552299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:01,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:01,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:52:01,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698429936] [2025-04-14 00:52:01,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:01,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:52:01,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:01,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:52:01,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:52:01,645 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2025-04-14 00:52:01,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-04-14 00:52:01,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:01,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2025-04-14 00:52:01,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:01,678 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-14 00:52:01,678 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:52:01,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 29 events. 3/29 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 1 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 70. Up to 12 conditions per place. [2025-04-14 00:52:01,679 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 0 selfloop transitions, 0 changer transitions 24/24 dead transitions. [2025-04-14 00:52:01,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 24 transitions, 117 flow [2025-04-14 00:52:01,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2025-04-14 00:52:01,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2 [2025-04-14 00:52:01,680 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 130 flow. Second operand 5 states and 43 transitions. [2025-04-14 00:52:01,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 24 transitions, 117 flow [2025-04-14 00:52:01,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 94 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-04-14 00:52:01,680 INFO L231 Difference]: Finished difference. Result has 33 places, 0 transitions, 0 flow [2025-04-14 00:52:01,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=33, PETRI_TRANSITIONS=0} [2025-04-14 00:52:01,681 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -11 predicate places. [2025-04-14 00:52:01,681 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 0 transitions, 0 flow [2025-04-14 00:52:01,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-04-14 00:52:01,685 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:52:01,685 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:52:01,685 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:52:01,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:52:01,686 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-04-14 00:52:01,688 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:52:01,688 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:52:01,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:52:01 BasicIcfg [2025-04-14 00:52:01,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:52:01,693 INFO L158 Benchmark]: Toolchain (without parser) took 2613.79ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 79.0MB in the end (delta: 40.1MB). Peak memory consumption was 38.4MB. Max. memory is 8.0GB. [2025-04-14 00:52:01,693 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:52:01,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.87ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 104.3MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:52:01,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.52ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 102.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:52:01,695 INFO L158 Benchmark]: Boogie Preprocessor took 23.11ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 101.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:52:01,695 INFO L158 Benchmark]: IcfgBuilder took 390.84ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 67.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 00:52:01,696 INFO L158 Benchmark]: TraceAbstraction took 1984.16ms. Allocated memory is still 167.8MB. Free memory was 67.5MB in the beginning and 79.0MB in the end (delta: -11.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:52:01,697 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 163.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.87ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 104.3MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.52ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 102.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.11ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 101.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 390.84ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 67.5MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1984.16ms. Allocated memory is still 167.8MB. Free memory was 67.5MB in the beginning and 79.0MB in the end (delta: -11.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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, 62 locations, 67 edges, 3 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: 1.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 514 IncrementalHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=3, InterpolantAutomatonStates: 22, 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.7s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:52:01,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...