/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/goblint-regression/13-privatized_20-publish-regression_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:13:17,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:13:17,805 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:13:17,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:13:17,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:13:17,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:13:17,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:13:17,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:13:17,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:13:17,831 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:13:17,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:13:17,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:13:17,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:13:17,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:13:17,832 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:13:17,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:13:17,833 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:17,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:13:17,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:17,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:13:17,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:13:17,834 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:13:18,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:13:18,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:13:18,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:13:18,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:13:18,074 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:13:18,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_20-publish-regression_true.i [2025-04-14 00:13:19,438 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f68a41cd5/f00619c3edda4c3da63a43857ef3b8e6/FLAG79770cdef [2025-04-14 00:13:19,725 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:13:19,728 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_20-publish-regression_true.i [2025-04-14 00:13:19,743 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f68a41cd5/f00619c3edda4c3da63a43857ef3b8e6/FLAG79770cdef [2025-04-14 00:13:20,639 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f68a41cd5/f00619c3edda4c3da63a43857ef3b8e6 [2025-04-14 00:13:20,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:13:20,641 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:13:20,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:20,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:13:20,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:13:20,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:20" (1/1) ... [2025-04-14 00:13:20,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11232187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:20, skipping insertion in model container [2025-04-14 00:13:20,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:20" (1/1) ... [2025-04-14 00:13:20,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:13:20,826 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_20-publish-regression_true.i[1095,1108] [2025-04-14 00:13:20,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:20,955 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:13:20,973 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_20-publish-regression_true.i[1095,1108] [2025-04-14 00:13:20,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:21,026 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:13:21,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21 WrapperNode [2025-04-14 00:13:21,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:21,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:21,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:13:21,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:13:21,032 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:13:21" (1/1) ... [2025-04-14 00:13:21,041 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:13:21" (1/1) ... [2025-04-14 00:13:21,057 INFO L138 Inliner]: procedures = 162, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-04-14 00:13:21,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:21,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:13:21,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:13:21,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:13:21,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,077 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-04-14 00:13:21,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:13:21,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:13:21,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:13:21,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:13:21,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:21,113 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:13:21,115 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:13:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:13:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:13:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:13:21,131 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:13:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:13:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:13:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:13:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:13:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:13:21,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:13:21,132 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:13:21,218 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:13:21,220 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:13:21,357 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:13:21,357 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:13:21,358 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:13:21,488 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:13:21,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:21 BoogieIcfgContainer [2025-04-14 00:13:21,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:13:21,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:13:21,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:13:21,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:13:21,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:13:20" (1/3) ... [2025-04-14 00:13:21,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a9475e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:21, skipping insertion in model container [2025-04-14 00:13:21,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21" (2/3) ... [2025-04-14 00:13:21,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a9475e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:21, skipping insertion in model container [2025-04-14 00:13:21,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:21" (3/3) ... [2025-04-14 00:13:21,498 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_20-publish-regression_true.i [2025-04-14 00:13:21,509 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:13:21,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_20-publish-regression_true.i that has 2 procedures, 27 locations, 25 edges, 1 initial locations, 0 loop locations, and 3 error locations. [2025-04-14 00:13:21,511 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:13:21,543 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 00:13:21,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 59 flow [2025-04-14 00:13:21,586 INFO L116 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-04-14 00:13:21,591 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:13:21,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 25 events. 0/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-14 00:13:21,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 59 flow [2025-04-14 00:13:21,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 23 transitions, 49 flow [2025-04-14 00:13:21,599 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:13:21,605 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;@63132836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:13:21,605 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:13:21,607 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:13:21,607 INFO L116 PetriNetUnfolderBase]: 0/0 cut-off events. [2025-04-14 00:13:21,607 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:21,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:21,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-14 00:13:21,608 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:13:21,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash 228, now seen corresponding path program 1 times [2025-04-14 00:13:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:21,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695324907] [2025-04-14 00:13:21,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:21,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-14 00:13:21,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-14 00:13:21,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:21,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:21,821 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:13:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:21,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695324907] [2025-04-14 00:13:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695324907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-14 00:13:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200797773] [2025-04-14 00:13:21,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:21,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:13:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:21,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:13:21,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:13:21,852 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-04-14 00:13:21,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:13:21,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:21,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-04-14 00:13:21,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:21,933 INFO L116 PetriNetUnfolderBase]: 50/134 cut-off events. [2025-04-14 00:13:21,933 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:21,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 134 events. 50/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 406 event pairs, 50 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 247. Up to 118 conditions per place. [2025-04-14 00:13:21,938 INFO L140 encePairwiseOnDemand]: 25/26 looper letters, 17 selfloop transitions, 0 changer transitions 0/22 dead transitions. [2025-04-14 00:13:21,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 81 flow [2025-04-14 00:13:21,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:13:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:13:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2025-04-14 00:13:21,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2025-04-14 00:13:21,951 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 49 flow. Second operand 2 states and 30 transitions. [2025-04-14 00:13:21,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 81 flow [2025-04-14 00:13:21,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:21,958 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 46 flow [2025-04-14 00:13:21,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=25, 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=2, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-04-14 00:13:21,962 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2025-04-14 00:13:21,963 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 46 flow [2025-04-14 00:13:21,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:13:21,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:21,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 00:13:21,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:13:21,963 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:13:21,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash 218387176, now seen corresponding path program 1 times [2025-04-14 00:13:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:21,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773480726] [2025-04-14 00:13:21,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:21,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 00:13:21,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 00:13:21,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:21,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:22,116 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:13:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:22,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773480726] [2025-04-14 00:13:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773480726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:13:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294009139] [2025-04-14 00:13:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:22,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:22,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:22,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:22,118 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-04-14 00:13:22,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:13:22,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:22,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-04-14 00:13:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:22,192 INFO L116 PetriNetUnfolderBase]: 45/137 cut-off events. [2025-04-14 00:13:22,194 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:22,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 137 events. 45/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 490 event pairs, 27 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 256. Up to 78 conditions per place. [2025-04-14 00:13:22,196 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 20 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-04-14 00:13:22,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 108 flow [2025-04-14 00:13:22,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-14 00:13:22,197 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2025-04-14 00:13:22,197 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 46 flow. Second operand 3 states and 44 transitions. [2025-04-14 00:13:22,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 108 flow [2025-04-14 00:13:22,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:13:22,200 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 68 flow [2025-04-14 00:13:22,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2025-04-14 00:13:22,200 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2025-04-14 00:13:22,200 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 68 flow [2025-04-14 00:13:22,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:13:22,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:22,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:22,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:13:22,201 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:13:22,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash 472642942, now seen corresponding path program 1 times [2025-04-14 00:13:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:22,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172912007] [2025-04-14 00:13:22,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:22,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 00:13:22,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 00:13:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:22,337 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:13:22,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:22,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172912007] [2025-04-14 00:13:22,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172912007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:22,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:22,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:13:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194227809] [2025-04-14 00:13:22,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:22,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:13:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:22,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:13:22,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:13:22,339 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-04-14 00:13:22,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:13:22,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:22,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-04-14 00:13:22,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:22,388 INFO L116 PetriNetUnfolderBase]: 17/70 cut-off events. [2025-04-14 00:13:22,388 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:13:22,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 70 events. 17/70 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 158 event pairs, 6 based on Foata normal form. 9/78 useless extension candidates. Maximal degree in co-relation 149. Up to 40 conditions per place. [2025-04-14 00:13:22,388 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 9 selfloop transitions, 4 changer transitions 7/24 dead transitions. [2025-04-14 00:13:22,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 102 flow [2025-04-14 00:13:22,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-14 00:13:22,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2025-04-14 00:13:22,389 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 68 flow. Second operand 4 states and 45 transitions. [2025-04-14 00:13:22,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 102 flow [2025-04-14 00:13:22,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 88 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-14 00:13:22,390 INFO L231 Difference]: Finished difference. Result has 28 places, 16 transitions, 42 flow [2025-04-14 00:13:22,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=42, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2025-04-14 00:13:22,391 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2025-04-14 00:13:22,391 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 42 flow [2025-04-14 00:13:22,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:13:22,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:22,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:22,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:13:22,391 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:13:22,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1781093178, now seen corresponding path program 1 times [2025-04-14 00:13:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:22,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944474348] [2025-04-14 00:13:22,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:22,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:13:22,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:13:22,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:22,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:22,466 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:13:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:22,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944474348] [2025-04-14 00:13:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944474348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:13:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965329712] [2025-04-14 00:13:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:22,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:22,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:22,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:22,468 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-04-14 00:13:22,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 16 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:13:22,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:22,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-04-14 00:13:22,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:22,494 INFO L116 PetriNetUnfolderBase]: 5/33 cut-off events. [2025-04-14 00:13:22,494 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:13:22,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 33 events. 5/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 2 based on Foata normal form. 3/35 useless extension candidates. Maximal degree in co-relation 67. Up to 15 conditions per place. [2025-04-14 00:13:22,494 INFO L140 encePairwiseOnDemand]: 24/26 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-04-14 00:13:22,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 16 transitions, 66 flow [2025-04-14 00:13:22,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-14 00:13:22,495 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-04-14 00:13:22,495 INFO L175 Difference]: Start difference. First operand has 28 places, 16 transitions, 42 flow. Second operand 3 states and 31 transitions. [2025-04-14 00:13:22,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 16 transitions, 66 flow [2025-04-14 00:13:22,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 16 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:13:22,496 INFO L231 Difference]: Finished difference. Result has 22 places, 0 transitions, 0 flow [2025-04-14 00:13:22,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=22, PETRI_TRANSITIONS=0} [2025-04-14 00:13:22,496 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -5 predicate places. [2025-04-14 00:13:22,496 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 0 transitions, 0 flow [2025-04-14 00:13:22,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:13:22,500 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 00:13:22,501 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-14 00:13:22,501 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-14 00:13:22,501 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-14 00:13:22,501 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-14 00:13:22,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:13:22,501 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 00:13:22,506 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:13:22,506 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:13:22,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:13:22 BasicIcfg [2025-04-14 00:13:22,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:13:22,510 INFO L158 Benchmark]: Toolchain (without parser) took 1868.75ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 31.1MB in the end (delta: 66.5MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. [2025-04-14 00:13:22,510 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:22,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.76ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 75.3MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 00:13:22,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.40ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 73.2MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:13:22,511 INFO L158 Benchmark]: Boogie Preprocessor took 25.78ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 71.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:22,511 INFO L158 Benchmark]: IcfgBuilder took 404.66ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 39.0MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 00:13:22,511 INFO L158 Benchmark]: TraceAbstraction took 1019.55ms. Allocated memory is still 142.6MB. Free memory was 38.4MB in the beginning and 31.1MB in the end (delta: 7.3MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-04-14 00:13:22,512 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.20ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 384.76ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 75.3MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.40ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 73.2MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.78ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 71.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 404.66ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 39.0MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1019.55ms. Allocated memory is still 142.6MB. Free memory was 38.4MB in the beginning and 31.1MB in the end (delta: 7.3MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 43 locations, 42 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 0 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=2, InterpolantAutomatonStates: 12, 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.4s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:13:22,523 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...