/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_33-traces-v-matters_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:13:28,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:13:28,426 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:28,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:13:28,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:13:28,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:13:28,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:13:28,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:13:28,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:13:28,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:13:28,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:13:28,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:13:28,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:13:28,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:28,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:28,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:13:28,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:13:28,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:13:28,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:13:28,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:13:28,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:13:28,446 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:28,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:13:28,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:13:28,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:13:28,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:13:28,652 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:13:28,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_33-traces-v-matters_true.i [2025-04-14 00:13:29,933 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca6736366/b67f707d9cde45368087ca0e7b3af0ac/FLAG802f1c8a2 [2025-04-14 00:13:30,120 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:13:30,120 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_33-traces-v-matters_true.i [2025-04-14 00:13:30,129 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca6736366/b67f707d9cde45368087ca0e7b3af0ac/FLAG802f1c8a2 [2025-04-14 00:13:30,934 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca6736366/b67f707d9cde45368087ca0e7b3af0ac [2025-04-14 00:13:30,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:13:30,937 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:13:30,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:30,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:13:30,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:13:30,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:30" (1/1) ... [2025-04-14 00:13:30,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61907bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:30, skipping insertion in model container [2025-04-14 00:13:30,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:30" (1/1) ... [2025-04-14 00:13:30,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:13:31,104 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_33-traces-v-matters_true.i[1093,1106] [2025-04-14 00:13:31,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:31,243 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:13:31,263 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_33-traces-v-matters_true.i[1093,1106] [2025-04-14 00:13:31,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:31,315 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:13:31,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:31 WrapperNode [2025-04-14 00:13:31,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:31,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:31,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:13:31,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:13:31,322 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:31" (1/1) ... [2025-04-14 00:13:31,335 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:31" (1/1) ... [2025-04-14 00:13:31,353 INFO L138 Inliner]: procedures = 162, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-04-14 00:13:31,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:31,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:13:31,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:13:31,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:13:31,360 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:31" (1/1) ... [2025-04-14 00:13:31,360 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:31" (1/1) ... [2025-04-14 00:13:31,364 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:31" (1/1) ... [2025-04-14 00:13:31,376 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-04-14 00:13:31,377 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:31" (1/1) ... [2025-04-14 00:13:31,377 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:31" (1/1) ... [2025-04-14 00:13:31,384 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:31" (1/1) ... [2025-04-14 00:13:31,384 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:31" (1/1) ... [2025-04-14 00:13:31,385 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:31" (1/1) ... [2025-04-14 00:13:31,386 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:31" (1/1) ... [2025-04-14 00:13:31,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:13:31,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:13:31,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:13:31,393 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:13:31,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:31" (1/1) ... [2025-04-14 00:13:31,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:31,421 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:31,423 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:31,440 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:13:31,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:13:31,440 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:13:31,441 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:13:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:13:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:13:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:13:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 00:13:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:13:31,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:13:31,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:13:31,442 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:31,524 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:13:31,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:13:31,631 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:13:31,632 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:13:31,632 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:13:31,744 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:13:31,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:31 BoogieIcfgContainer [2025-04-14 00:13:31,744 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:13:31,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:13:31,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:13:31,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:13:31,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:13:30" (1/3) ... [2025-04-14 00:13:31,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367c7475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:31, skipping insertion in model container [2025-04-14 00:13:31,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:31" (2/3) ... [2025-04-14 00:13:31,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367c7475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:31, skipping insertion in model container [2025-04-14 00:13:31,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:31" (3/3) ... [2025-04-14 00:13:31,751 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_33-traces-v-matters_true.i [2025-04-14 00:13:31,761 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:13:31,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_33-traces-v-matters_true.i that has 2 procedures, 27 locations, 25 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:13:31,762 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:13:31,795 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:13:31,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 56 flow [2025-04-14 00:13:31,861 INFO L116 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-04-14 00:13:31,863 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:31,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:13:31,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 56 flow [2025-04-14 00:13:31,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 24 transitions, 51 flow [2025-04-14 00:13:31,876 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:13:31,885 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;@5aacdd7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:13:31,885 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 00:13:31,896 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:13:31,896 INFO L116 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-04-14 00:13:31,896 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:31,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:31,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:31,897 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:31,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash 181481195, now seen corresponding path program 1 times [2025-04-14 00:13:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:31,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643436456] [2025-04-14 00:13:31,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:31,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:13:31,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:13:31,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:31,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:32,136 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:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:32,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643436456] [2025-04-14 00:13:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643436456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:32,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:32,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:13:32,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508772675] [2025-04-14 00:13:32,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:32,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:32,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:32,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:32,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:32,161 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2025-04-14 00:13:32,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 51 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:32,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:32,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2025-04-14 00:13:32,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:32,288 INFO L116 PetriNetUnfolderBase]: 62/185 cut-off events. [2025-04-14 00:13:32,288 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:32,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 185 events. 62/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 764 event pairs, 29 based on Foata normal form. 9/192 useless extension candidates. Maximal degree in co-relation 331. Up to 103 conditions per place. [2025-04-14 00:13:32,290 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 19 selfloop transitions, 2 changer transitions 6/34 dead transitions. [2025-04-14 00:13:32,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 125 flow [2025-04-14 00:13:32,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-04-14 00:13:32,301 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-14 00:13:32,302 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 51 flow. Second operand 3 states and 52 transitions. [2025-04-14 00:13:32,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 125 flow [2025-04-14 00:13:32,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:32,307 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 58 flow [2025-04-14 00:13:32,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-04-14 00:13:32,311 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-04-14 00:13:32,312 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 58 flow [2025-04-14 00:13:32,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:32,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:32,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:32,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:13:32,313 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:32,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:32,314 INFO L85 PathProgramCache]: Analyzing trace with hash 358186179, now seen corresponding path program 1 times [2025-04-14 00:13:32,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:32,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280779964] [2025-04-14 00:13:32,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:32,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:32,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:13:32,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:13:32,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:32,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:32,499 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:32,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:32,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280779964] [2025-04-14 00:13:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280779964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:13:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260138190] [2025-04-14 00:13:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:32,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:13:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:32,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:13:32,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:13:32,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2025-04-14 00:13:32,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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:13:32,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:32,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2025-04-14 00:13:32,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:32,570 INFO L116 PetriNetUnfolderBase]: 15/63 cut-off events. [2025-04-14 00:13:32,570 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:13:32,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 63 events. 15/63 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 5 based on Foata normal form. 5/66 useless extension candidates. Maximal degree in co-relation 119. Up to 29 conditions per place. [2025-04-14 00:13:32,572 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 14 selfloop transitions, 5 changer transitions 1/27 dead transitions. [2025-04-14 00:13:32,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 106 flow [2025-04-14 00:13:32,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-14 00:13:32,573 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2025-04-14 00:13:32,574 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 58 flow. Second operand 4 states and 54 transitions. [2025-04-14 00:13:32,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 106 flow [2025-04-14 00:13:32,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:32,575 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 66 flow [2025-04-14 00:13:32,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-04-14 00:13:32,575 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-04-14 00:13:32,575 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 66 flow [2025-04-14 00:13:32,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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:13:32,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:32,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:32,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:13:32,576 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:32,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:32,577 INFO L85 PathProgramCache]: Analyzing trace with hash 976356803, now seen corresponding path program 2 times [2025-04-14 00:13:32,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:32,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503430340] [2025-04-14 00:13:32,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:13:32,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:32,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:13:32,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:13:32,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:13:32,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:32,730 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:32,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:32,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503430340] [2025-04-14 00:13:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503430340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:32,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:13:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403172668] [2025-04-14 00:13:32,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:32,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:13:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:32,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:13:32,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:13:32,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2025-04-14 00:13:32,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:32,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:32,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2025-04-14 00:13:32,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:32,793 INFO L116 PetriNetUnfolderBase]: 9/50 cut-off events. [2025-04-14 00:13:32,793 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 00:13:32,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 50 events. 9/50 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 1 based on Foata normal form. 4/52 useless extension candidates. Maximal degree in co-relation 105. Up to 21 conditions per place. [2025-04-14 00:13:32,794 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 16 selfloop transitions, 5 changer transitions 2/30 dead transitions. [2025-04-14 00:13:32,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 130 flow [2025-04-14 00:13:32,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-14 00:13:32,796 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5480769230769231 [2025-04-14 00:13:32,796 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 66 flow. Second operand 4 states and 57 transitions. [2025-04-14 00:13:32,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 130 flow [2025-04-14 00:13:32,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 123 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:13:32,797 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 79 flow [2025-04-14 00:13:32,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2025-04-14 00:13:32,798 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2025-04-14 00:13:32,798 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 79 flow [2025-04-14 00:13:32,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:32,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:32,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:32,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:13:32,798 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:32,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 14912751, now seen corresponding path program 1 times [2025-04-14 00:13:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:32,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909309397] [2025-04-14 00:13:32,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:32,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:13:32,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:13:32,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:32,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:32,943 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:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:32,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909309397] [2025-04-14 00:13:32,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909309397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:32,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:32,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:13:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100728796] [2025-04-14 00:13:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:32,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:13:32,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:32,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:13:32,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:13:32,944 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2025-04-14 00:13:32,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 79 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:32,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:32,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2025-04-14 00:13:32,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:32,972 INFO L116 PetriNetUnfolderBase]: 3/25 cut-off events. [2025-04-14 00:13:32,972 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-14 00:13:32,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 25 events. 3/25 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 3 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2025-04-14 00:13:32,973 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2025-04-14 00:13:32,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 17 transitions, 82 flow [2025-04-14 00:13:32,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-14 00:13:32,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4423076923076923 [2025-04-14 00:13:32,974 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 79 flow. Second operand 4 states and 46 transitions. [2025-04-14 00:13:32,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 17 transitions, 82 flow [2025-04-14 00:13:32,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 17 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:13:32,975 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2025-04-14 00:13:32,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=22, 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=4, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2025-04-14 00:13:32,975 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-04-14 00:13:32,975 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 0 transitions, 0 flow [2025-04-14 00:13:32,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:32,977 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-14 00:13:32,977 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 00:13:32,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:13:32,978 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-14 00:13:32,980 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:13:32,980 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:13:32,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:13:32 BasicIcfg [2025-04-14 00:13:32,983 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:13:32,983 INFO L158 Benchmark]: Toolchain (without parser) took 2046.11ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 47.1MB in the end (delta: 49.1MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB. [2025-04-14 00:13:32,985 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:32,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.89ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 72.8MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:13:32,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.60ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 70.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:32,988 INFO L158 Benchmark]: Boogie Preprocessor took 37.30ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 69.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:13:32,988 INFO L158 Benchmark]: IcfgBuilder took 352.01ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 32.2MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 00:13:32,989 INFO L158 Benchmark]: TraceAbstraction took 1236.96ms. Allocated memory is still 142.6MB. Free memory was 31.6MB in the beginning and 47.1MB in the end (delta: -15.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:32,989 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 378.89ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 72.8MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.60ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 70.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 37.30ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 69.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 352.01ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 32.2MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1236.96ms. Allocated memory is still 142.6MB. Free memory was 31.6MB in the beginning and 47.1MB in the end (delta: -15.6MB). There was no memory consumed. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 42 locations, 40 edges, 2 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.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 0 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=3, InterpolantAutomatonStates: 15, 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.6s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:13:33,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...