/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/pthread-wmm/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:08:30,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:08:30,992 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:08:30,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:08:30,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:08:31,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:08:31,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:08:31,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:08:31,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:08:31,018 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:08:31,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:08:31,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:08:31,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:08:31,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:08:31,018 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:08:31,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:08:31,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:08:31,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:08:31,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:08:31,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:08:31,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:08:31,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:08:31,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:08:31,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:08:31,020 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:08:31,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:08:31,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:08:31,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:08:31,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:08:31,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:08:31,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:08:31,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:08:31,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:08:31,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:08:31,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:08:31,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:08:31,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:08:31,022 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:08:31,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:08:31,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:08:31,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:08:31,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:08:31,272 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:08:31,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-14 00:08:32,688 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c05162e/7fab118064944250b0de941f8de7e1f0/FLAGb0769530d [2025-04-14 00:08:32,982 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:08:32,982 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-14 00:08:32,997 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c05162e/7fab118064944250b0de941f8de7e1f0/FLAGb0769530d [2025-04-14 00:08:33,737 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c05162e/7fab118064944250b0de941f8de7e1f0 [2025-04-14 00:08:33,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:08:33,744 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:08:33,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:08:33,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:08:33,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:08:33,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:08:33" (1/1) ... [2025-04-14 00:08:33,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d28b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:33, skipping insertion in model container [2025-04-14 00:08:33,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:08:33" (1/1) ... [2025-04-14 00:08:33,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:08:33,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i[1017,1030] [2025-04-14 00:08:34,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:08:34,108 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:08:34,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i[1017,1030] [2025-04-14 00:08:34,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:08:34,198 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:08:34,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34 WrapperNode [2025-04-14 00:08:34,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:08:34,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:08:34,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:08:34,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:08:34,205 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:08:34" (1/1) ... [2025-04-14 00:08:34,217 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:08:34" (1/1) ... [2025-04-14 00:08:34,233 INFO L138 Inliner]: procedures = 174, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2025-04-14 00:08:34,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:08:34,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:08:34,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:08:34,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:08:34,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,253 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:08:34,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:08:34,263 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:08:34,263 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:08:34,263 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:08:34,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (1/1) ... [2025-04-14 00:08:34,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:08:34,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:08:34,296 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:08:34,300 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:08:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:08:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:08:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:08:34,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:08:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:08:34,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:08:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:08:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:08:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:08:34,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:08:34,321 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:08:34,417 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:08:34,418 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:08:34,513 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:08:34,514 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:08:34,514 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:08:34,618 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:08:34,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:08:34 BoogieIcfgContainer [2025-04-14 00:08:34,619 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:08:34,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:08:34,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:08:34,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:08:34,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:08:33" (1/3) ... [2025-04-14 00:08:34,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b65d61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:08:34, skipping insertion in model container [2025-04-14 00:08:34,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:08:34" (2/3) ... [2025-04-14 00:08:34,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b65d61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:08:34, skipping insertion in model container [2025-04-14 00:08:34,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:08:34" (3/3) ... [2025-04-14 00:08:34,626 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-14 00:08:34,636 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:08:34,637 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_pso.oepc_pso.opt_tso.oepc_tso.opt-thin000_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 3 procedures, 26 locations, 23 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:08:34,638 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:08:34,665 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:08:34,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 58 flow [2025-04-14 00:08:34,721 INFO L116 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-04-14 00:08:34,724 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:08:34,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:08:34,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 58 flow [2025-04-14 00:08:34,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2025-04-14 00:08:34,740 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:08:34,753 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;@69c2b83e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:08:34,753 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:08:34,761 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:08:34,762 INFO L116 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-04-14 00:08:34,762 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:08:34,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:08:34,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:08:34,763 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:08:34,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:08:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1250615556, now seen corresponding path program 1 times [2025-04-14 00:08:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:08:34,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564912804] [2025-04-14 00:08:34,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:08:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:08:34,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 00:08:34,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 00:08:34,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:08:34,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:08:35,211 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:08:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:08:35,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564912804] [2025-04-14 00:08:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564912804] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:08:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:08:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:08:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586217068] [2025-04-14 00:08:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:08:35,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:08:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:08:35,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:08:35,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:08:35,240 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-04-14 00:08:35,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:08:35,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:08:35,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-04-14 00:08:35,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:08:35,476 INFO L116 PetriNetUnfolderBase]: 403/694 cut-off events. [2025-04-14 00:08:35,476 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:08:35,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 694 events. 403/694 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3019 event pairs, 68 based on Foata normal form. 36/729 useless extension candidates. Maximal degree in co-relation 1394. Up to 574 conditions per place. [2025-04-14 00:08:35,485 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 29 selfloop transitions, 2 changer transitions 16/49 dead transitions. [2025-04-14 00:08:35,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 201 flow [2025-04-14 00:08:35,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:08:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:08:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2025-04-14 00:08:35,496 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.552 [2025-04-14 00:08:35,497 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 5 states and 69 transitions. [2025-04-14 00:08:35,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 201 flow [2025-04-14 00:08:35,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:08:35,506 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 60 flow [2025-04-14 00:08:35,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2025-04-14 00:08:35,510 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2025-04-14 00:08:35,510 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 60 flow [2025-04-14 00:08:35,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:08:35,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:08:35,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:08:35,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:08:35,511 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:08:35,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:08:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1519331643, now seen corresponding path program 1 times [2025-04-14 00:08:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:08:35,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269593791] [2025-04-14 00:08:35,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:08:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:08:35,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:08:35,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:08:35,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:08:35,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:08:35,682 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:08:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:08:35,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269593791] [2025-04-14 00:08:35,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269593791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:08:35,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:08:35,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:08:35,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573046082] [2025-04-14 00:08:35,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:08:35,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:08:35,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:08:35,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:08:35,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:08:35,684 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-04-14 00:08:35,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:08:35,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:08:35,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-04-14 00:08:35,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:08:35,987 INFO L116 PetriNetUnfolderBase]: 594/1020 cut-off events. [2025-04-14 00:08:35,987 INFO L117 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-04-14 00:08:35,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2227 conditions, 1020 events. 594/1020 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4715 event pairs, 50 based on Foata normal form. 55/1074 useless extension candidates. Maximal degree in co-relation 2214. Up to 429 conditions per place. [2025-04-14 00:08:35,996 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 36 selfloop transitions, 3 changer transitions 40/81 dead transitions. [2025-04-14 00:08:35,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 81 transitions, 352 flow [2025-04-14 00:08:35,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:08:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:08:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2025-04-14 00:08:35,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5288888888888889 [2025-04-14 00:08:35,997 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 60 flow. Second operand 9 states and 119 transitions. [2025-04-14 00:08:35,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 81 transitions, 352 flow [2025-04-14 00:08:36,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 81 transitions, 336 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:08:36,003 INFO L231 Difference]: Finished difference. Result has 43 places, 22 transitions, 76 flow [2025-04-14 00:08:36,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=22} [2025-04-14 00:08:36,004 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2025-04-14 00:08:36,004 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 22 transitions, 76 flow [2025-04-14 00:08:36,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:08:36,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:08:36,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:08:36,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:08:36,007 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:08:36,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:08:36,008 INFO L85 PathProgramCache]: Analyzing trace with hash -407735034, now seen corresponding path program 1 times [2025-04-14 00:08:36,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:08:36,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923110890] [2025-04-14 00:08:36,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:08:36,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:08:36,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:08:36,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:08:36,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:08:36,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:08:36,146 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:08:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:08:36,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923110890] [2025-04-14 00:08:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923110890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:08:36,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:08:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:08:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250273194] [2025-04-14 00:08:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:08:36,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:08:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:08:36,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:08:36,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:08:36,147 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-04-14 00:08:36,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 22 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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:08:36,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:08:36,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-04-14 00:08:36,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:08:36,288 INFO L116 PetriNetUnfolderBase]: 507/868 cut-off events. [2025-04-14 00:08:36,288 INFO L117 PetriNetUnfolderBase]: For 661/661 co-relation queries the response was YES. [2025-04-14 00:08:36,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 868 events. 507/868 cut-off events. For 661/661 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3780 event pairs, 106 based on Foata normal form. 25/892 useless extension candidates. Maximal degree in co-relation 2140. Up to 358 conditions per place. [2025-04-14 00:08:36,292 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 28 selfloop transitions, 3 changer transitions 23/56 dead transitions. [2025-04-14 00:08:36,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 270 flow [2025-04-14 00:08:36,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:08:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:08:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-04-14 00:08:36,293 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-14 00:08:36,293 INFO L175 Difference]: Start difference. First operand has 43 places, 22 transitions, 76 flow. Second operand 6 states and 80 transitions. [2025-04-14 00:08:36,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 270 flow [2025-04-14 00:08:36,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 56 transitions, 248 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-14 00:08:36,296 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 78 flow [2025-04-14 00:08:36,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2025-04-14 00:08:36,297 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2025-04-14 00:08:36,297 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 78 flow [2025-04-14 00:08:36,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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:08:36,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:08:36,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:08:36,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:08:36,297 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:08:36,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:08:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1583196966, now seen corresponding path program 1 times [2025-04-14 00:08:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:08:36,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957351038] [2025-04-14 00:08:36,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:08:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:08:36,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:08:36,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:08:36,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:08:36,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:08:36,412 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:08:36,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:08:36,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957351038] [2025-04-14 00:08:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957351038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:08:36,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:08:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:08:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74024534] [2025-04-14 00:08:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:08:36,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:08:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:08:36,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:08:36,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:08:36,414 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-04-14 00:08:36,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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:08:36,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:08:36,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-04-14 00:08:36,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:08:36,509 INFO L116 PetriNetUnfolderBase]: 206/361 cut-off events. [2025-04-14 00:08:36,509 INFO L117 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-04-14 00:08:36,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 361 events. 206/361 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1240 event pairs, 51 based on Foata normal form. 20/381 useless extension candidates. Maximal degree in co-relation 905. Up to 204 conditions per place. [2025-04-14 00:08:36,510 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 0 selfloop transitions, 0 changer transitions 39/39 dead transitions. [2025-04-14 00:08:36,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 190 flow [2025-04-14 00:08:36,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:08:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:08:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-04-14 00:08:36,513 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42 [2025-04-14 00:08:36,513 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 78 flow. Second operand 6 states and 63 transitions. [2025-04-14 00:08:36,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 190 flow [2025-04-14 00:08:36,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 164 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-04-14 00:08:36,514 INFO L231 Difference]: Finished difference. Result has 35 places, 0 transitions, 0 flow [2025-04-14 00:08:36,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=35, PETRI_TRANSITIONS=0} [2025-04-14 00:08:36,515 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2025-04-14 00:08:36,515 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 0 transitions, 0 flow [2025-04-14 00:08:36,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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:08:36,518 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:08:36,519 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:08:36,519 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:08:36,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:08:36,519 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 00:08:36,522 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:08:36,522 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:08:36,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:08:36 BasicIcfg [2025-04-14 00:08:36,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:08:36,527 INFO L158 Benchmark]: Toolchain (without parser) took 2786.79ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 70.0MB in the end (delta: 29.8MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. [2025-04-14 00:08:36,527 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:08:36,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.06ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 76.3MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:08:36,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:08:36,528 INFO L158 Benchmark]: Boogie Preprocessor took 28.40ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 73.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:08:36,528 INFO L158 Benchmark]: IcfgBuilder took 355.70ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 51.8MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 00:08:36,528 INFO L158 Benchmark]: TraceAbstraction took 1906.95ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 70.0MB in the end (delta: -18.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:08:36,531 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 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 454.06ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 76.3MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.40ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 73.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 355.70ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 51.8MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1906.95ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 70.0MB in the end (delta: -18.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 42 locations, 39 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=3, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 195 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:08:36,544 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...