/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:36:35,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:36:35,588 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 01:36:35,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:36:35,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:36:35,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:36:35,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:36:35,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:36:35,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:36:35,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:36:35,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:36:35,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:36:35,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:36:35,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:36:35,621 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:36:35,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:36:35,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:36:35,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:36:35,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:36:35,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:36:35,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:36:35,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:36:35,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:36:35,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:36:35,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:36:35,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:36:35,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:36:35,623 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 01:36:35,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:36:35,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:36:35,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:36:35,845 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:36:35,846 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:36:35,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c [2025-04-14 01:36:37,154 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f6d15ea/476055d9faf8457aa4dbfe7f619f39f1/FLAG264e81040 [2025-04-14 01:36:37,346 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:36:37,347 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2025-04-14 01:36:37,358 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f6d15ea/476055d9faf8457aa4dbfe7f619f39f1/FLAG264e81040 [2025-04-14 01:36:38,154 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f6d15ea/476055d9faf8457aa4dbfe7f619f39f1 [2025-04-14 01:36:38,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:36:38,158 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:36:38,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:36:38,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:36:38,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:36:38,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31626ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38, skipping insertion in model container [2025-04-14 01:36:38,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:36:38,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c[2032,2045] [2025-04-14 01:36:38,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:36:38,334 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:36:38,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c[2032,2045] [2025-04-14 01:36:38,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:36:38,363 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:36:38,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38 WrapperNode [2025-04-14 01:36:38,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:36:38,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:36:38,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:36:38,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:36:38,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,391 INFO L138 Inliner]: procedures = 18, calls = 13, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 92 [2025-04-14 01:36:38,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:36:38,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:36:38,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:36:38,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:36:38,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,407 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 01:36:38,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:36:38,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:36:38,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:36:38,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:36:38,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (1/1) ... [2025-04-14 01:36:38,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:36:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:36:38,451 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 01:36:38,452 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 01:36:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:36:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:36:38,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:36:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:36:38,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:36:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:36:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:36:38,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:36:38,469 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 01:36:38,532 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:36:38,533 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:36:38,645 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:36:38,646 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:36:38,647 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:36:38,753 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:36:38,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:36:38 BoogieIcfgContainer [2025-04-14 01:36:38,753 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:36:38,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:36:38,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:36:38,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:36:38,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:36:38" (1/3) ... [2025-04-14 01:36:38,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb55546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:36:38, skipping insertion in model container [2025-04-14 01:36:38,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:36:38" (2/3) ... [2025-04-14 01:36:38,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb55546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:36:38, skipping insertion in model container [2025-04-14 01:36:38,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:36:38" (3/3) ... [2025-04-14 01:36:38,760 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2025-04-14 01:36:38,769 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:36:38,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy6.wvr.c that has 3 procedures, 32 locations, 29 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 01:36:38,771 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:36:38,808 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:36:38,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 76 flow [2025-04-14 01:36:38,855 INFO L116 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-04-14 01:36:38,857 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:36:38,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 0/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-14 01:36:38,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 76 flow [2025-04-14 01:36:38,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 68 flow [2025-04-14 01:36:38,870 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:36:38,881 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;@20c9d0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:36:38,881 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:36:38,892 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:36:38,893 INFO L116 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-04-14 01:36:38,893 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:36:38,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:38,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:38,894 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 01:36:38,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash 316419958, now seen corresponding path program 1 times [2025-04-14 01:36:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:38,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023616282] [2025-04-14 01:36:38,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:36:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:38,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:36:38,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:38,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:36:38,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:39,237 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 01:36:39,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:39,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023616282] [2025-04-14 01:36:39,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023616282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:39,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:39,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:36:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939016044] [2025-04-14 01:36:39,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:39,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:36:39,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:39,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:36:39,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:36:39,260 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-04-14 01:36:39,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:39,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:39,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-04-14 01:36:39,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:39,520 INFO L116 PetriNetUnfolderBase]: 354/671 cut-off events. [2025-04-14 01:36:39,520 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-14 01:36:39,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 671 events. 354/671 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2724 event pairs, 132 based on Foata normal form. 1/669 useless extension candidates. Maximal degree in co-relation 1269. Up to 245 conditions per place. [2025-04-14 01:36:39,527 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 48 selfloop transitions, 6 changer transitions 17/73 dead transitions. [2025-04-14 01:36:39,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 73 transitions, 321 flow [2025-04-14 01:36:39,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:36:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:36:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-04-14 01:36:39,539 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4608294930875576 [2025-04-14 01:36:39,539 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 68 flow. Second operand 7 states and 100 transitions. [2025-04-14 01:36:39,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 73 transitions, 321 flow [2025-04-14 01:36:39,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 73 transitions, 299 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:36:39,549 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 95 flow [2025-04-14 01:36:39,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-04-14 01:36:39,554 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-04-14 01:36:39,554 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 95 flow [2025-04-14 01:36:39,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:39,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:39,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:39,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:36:39,555 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 01:36:39,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:39,555 INFO L85 PathProgramCache]: Analyzing trace with hash -190593170, now seen corresponding path program 2 times [2025-04-14 01:36:39,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:39,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372355495] [2025-04-14 01:36:39,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:36:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:39,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:36:39,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:39,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:36:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:39,633 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 01:36:39,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:39,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372355495] [2025-04-14 01:36:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372355495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:39,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:39,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:36:39,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868432246] [2025-04-14 01:36:39,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:39,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:36:39,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:39,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:36:39,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:36:39,635 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-04-14 01:36:39,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:39,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:39,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-04-14 01:36:39,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:39,714 INFO L116 PetriNetUnfolderBase]: 318/607 cut-off events. [2025-04-14 01:36:39,714 INFO L117 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-04-14 01:36:39,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 607 events. 318/607 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2431 event pairs, 237 based on Foata normal form. 6/610 useless extension candidates. Maximal degree in co-relation 1324. Up to 461 conditions per place. [2025-04-14 01:36:39,718 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 38 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-04-14 01:36:39,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 201 flow [2025-04-14 01:36:39,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:36:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:36:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-14 01:36:39,719 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2025-04-14 01:36:39,719 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 95 flow. Second operand 3 states and 49 transitions. [2025-04-14 01:36:39,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 201 flow [2025-04-14 01:36:39,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 199 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:36:39,721 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 101 flow [2025-04-14 01:36:39,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-04-14 01:36:39,722 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-04-14 01:36:39,722 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 101 flow [2025-04-14 01:36:39,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:39,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:39,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:39,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:36:39,722 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 01:36:39,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2090805672, now seen corresponding path program 3 times [2025-04-14 01:36:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:39,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370827375] [2025-04-14 01:36:39,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:36:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:39,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:36:39,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:39,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:36:39,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:39,845 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 01:36:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:39,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370827375] [2025-04-14 01:36:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370827375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:36:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365910131] [2025-04-14 01:36:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:39,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:36:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:39,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:36:39,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:36:39,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-04-14 01:36:39,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 101 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:39,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:39,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-04-14 01:36:39,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:40,086 INFO L116 PetriNetUnfolderBase]: 512/994 cut-off events. [2025-04-14 01:36:40,086 INFO L117 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2025-04-14 01:36:40,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 994 events. 512/994 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4767 event pairs, 110 based on Foata normal form. 8/999 useless extension candidates. Maximal degree in co-relation 831. Up to 207 conditions per place. [2025-04-14 01:36:40,092 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 74 selfloop transitions, 11 changer transitions 17/104 dead transitions. [2025-04-14 01:36:40,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 540 flow [2025-04-14 01:36:40,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:36:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:36:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2025-04-14 01:36:40,095 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2025-04-14 01:36:40,095 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 101 flow. Second operand 9 states and 126 transitions. [2025-04-14 01:36:40,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 540 flow [2025-04-14 01:36:40,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 104 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:36:40,101 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 171 flow [2025-04-14 01:36:40,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=171, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-04-14 01:36:40,102 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-14 01:36:40,102 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 171 flow [2025-04-14 01:36:40,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:40,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:40,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:40,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:36:40,102 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 01:36:40,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1189680876, now seen corresponding path program 4 times [2025-04-14 01:36:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:40,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938633706] [2025-04-14 01:36:40,104 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:36:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:40,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:36:40,121 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:40,121 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:36:40,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:40,217 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 01:36:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:40,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938633706] [2025-04-14 01:36:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938633706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:36:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536552758] [2025-04-14 01:36:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:40,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:36:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:40,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:36:40,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:36:40,218 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-04-14 01:36:40,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:40,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:40,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-04-14 01:36:40,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:40,429 INFO L116 PetriNetUnfolderBase]: 467/917 cut-off events. [2025-04-14 01:36:40,430 INFO L117 PetriNetUnfolderBase]: For 666/666 co-relation queries the response was YES. [2025-04-14 01:36:40,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 917 events. 467/917 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4310 event pairs, 146 based on Foata normal form. 2/916 useless extension candidates. Maximal degree in co-relation 2133. Up to 293 conditions per place. [2025-04-14 01:36:40,434 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 44 selfloop transitions, 5 changer transitions 33/84 dead transitions. [2025-04-14 01:36:40,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 516 flow [2025-04-14 01:36:40,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:36:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:36:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2025-04-14 01:36:40,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2025-04-14 01:36:40,435 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 171 flow. Second operand 7 states and 91 transitions. [2025-04-14 01:36:40,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 516 flow [2025-04-14 01:36:40,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 510 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:36:40,442 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 172 flow [2025-04-14 01:36:40,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2025-04-14 01:36:40,443 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2025-04-14 01:36:40,444 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 172 flow [2025-04-14 01:36:40,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:40,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:40,444 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:40,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:36:40,444 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:36:40,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 87349178, now seen corresponding path program 5 times [2025-04-14 01:36:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:40,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614084] [2025-04-14 01:36:40,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:36:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:40,450 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:36:40,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:40,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:36:40,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:40,549 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 01:36:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:40,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614084] [2025-04-14 01:36:40,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:40,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:40,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:36:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429495428] [2025-04-14 01:36:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:40,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:36:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:40,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:36:40,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:36:40,551 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-04-14 01:36:40,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:40,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:40,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-04-14 01:36:40,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:40,775 INFO L116 PetriNetUnfolderBase]: 422/852 cut-off events. [2025-04-14 01:36:40,775 INFO L117 PetriNetUnfolderBase]: For 661/661 co-relation queries the response was YES. [2025-04-14 01:36:40,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 852 events. 422/852 cut-off events. For 661/661 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4063 event pairs, 114 based on Foata normal form. 10/859 useless extension candidates. Maximal degree in co-relation 2356. Up to 301 conditions per place. [2025-04-14 01:36:40,781 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 58 selfloop transitions, 8 changer transitions 15/83 dead transitions. [2025-04-14 01:36:40,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 503 flow [2025-04-14 01:36:40,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:36:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:36:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2025-04-14 01:36:40,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2025-04-14 01:36:40,784 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 172 flow. Second operand 6 states and 100 transitions. [2025-04-14 01:36:40,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 503 flow [2025-04-14 01:36:40,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 472 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-14 01:36:40,790 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 171 flow [2025-04-14 01:36:40,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2025-04-14 01:36:40,791 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2025-04-14 01:36:40,791 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 171 flow [2025-04-14 01:36:40,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:40,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:40,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:40,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:36:40,792 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:36:40,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2035350402, now seen corresponding path program 6 times [2025-04-14 01:36:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:40,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749794903] [2025-04-14 01:36:40,792 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:36:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:40,799 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:36:40,805 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:40,806 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:36:40,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:40,881 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 01:36:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:40,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749794903] [2025-04-14 01:36:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749794903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:36:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196305985] [2025-04-14 01:36:40,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:40,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:36:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:40,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:36:40,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:36:40,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-04-14 01:36:40,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:40,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:40,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-04-14 01:36:40,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:41,036 INFO L116 PetriNetUnfolderBase]: 300/616 cut-off events. [2025-04-14 01:36:41,036 INFO L117 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2025-04-14 01:36:41,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 616 events. 300/616 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2644 event pairs, 92 based on Foata normal form. 10/623 useless extension candidates. Maximal degree in co-relation 998. Up to 201 conditions per place. [2025-04-14 01:36:41,039 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 34 selfloop transitions, 7 changer transitions 25/68 dead transitions. [2025-04-14 01:36:41,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 408 flow [2025-04-14 01:36:41,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:36:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:36:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2025-04-14 01:36:41,040 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2025-04-14 01:36:41,040 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 171 flow. Second operand 8 states and 94 transitions. [2025-04-14 01:36:41,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 408 flow [2025-04-14 01:36:41,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 378 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-04-14 01:36:41,043 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 134 flow [2025-04-14 01:36:41,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=134, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2025-04-14 01:36:41,043 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2025-04-14 01:36:41,043 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 134 flow [2025-04-14 01:36:41,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:41,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:41,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:41,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:36:41,044 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:36:41,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1278640764, now seen corresponding path program 7 times [2025-04-14 01:36:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:41,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34557832] [2025-04-14 01:36:41,044 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:36:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:41,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:36:41,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:41,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:36:41,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:41,089 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 01:36:41,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:41,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34557832] [2025-04-14 01:36:41,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34557832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:41,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:41,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:36:41,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639941354] [2025-04-14 01:36:41,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:41,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:36:41,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:41,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:36:41,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:36:41,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-04-14 01:36:41,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:41,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:41,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-04-14 01:36:41,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:41,160 INFO L116 PetriNetUnfolderBase]: 164/360 cut-off events. [2025-04-14 01:36:41,161 INFO L117 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-04-14 01:36:41,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 360 events. 164/360 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1304 event pairs, 117 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 367. Up to 270 conditions per place. [2025-04-14 01:36:41,162 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 34 selfloop transitions, 2 changer transitions 5/43 dead transitions. [2025-04-14 01:36:41,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 260 flow [2025-04-14 01:36:41,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:36:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:36:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-04-14 01:36:41,163 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2025-04-14 01:36:41,163 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 134 flow. Second operand 3 states and 50 transitions. [2025-04-14 01:36:41,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 260 flow [2025-04-14 01:36:41,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 222 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-04-14 01:36:41,165 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 114 flow [2025-04-14 01:36:41,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-04-14 01:36:41,165 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2025-04-14 01:36:41,165 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 114 flow [2025-04-14 01:36:41,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:41,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:41,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:41,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:36:41,166 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:36:41,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:41,166 INFO L85 PathProgramCache]: Analyzing trace with hash 875348832, now seen corresponding path program 8 times [2025-04-14 01:36:41,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:41,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177404771] [2025-04-14 01:36:41,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:36:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:41,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:36:41,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:41,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:36:41,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:41,289 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 01:36:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:41,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177404771] [2025-04-14 01:36:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177404771] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:36:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:36:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:36:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199809145] [2025-04-14 01:36:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:36:41,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:36:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:41,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:36:41,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:36:41,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-04-14 01:36:41,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:41,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:41,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-04-14 01:36:41,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:41,387 INFO L116 PetriNetUnfolderBase]: 70/158 cut-off events. [2025-04-14 01:36:41,387 INFO L117 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-04-14 01:36:41,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 158 events. 70/158 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 462 event pairs, 29 based on Foata normal form. 8/163 useless extension candidates. Maximal degree in co-relation 277. Up to 61 conditions per place. [2025-04-14 01:36:41,388 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 0 selfloop transitions, 0 changer transitions 33/33 dead transitions. [2025-04-14 01:36:41,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 175 flow [2025-04-14 01:36:41,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:36:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:36:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2025-04-14 01:36:41,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2025-04-14 01:36:41,389 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 114 flow. Second operand 6 states and 56 transitions. [2025-04-14 01:36:41,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 175 flow [2025-04-14 01:36:41,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 159 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-14 01:36:41,390 INFO L231 Difference]: Finished difference. Result has 41 places, 0 transitions, 0 flow [2025-04-14 01:36:41,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=41, PETRI_TRANSITIONS=0} [2025-04-14 01:36:41,390 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2025-04-14 01:36:41,390 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 0 transitions, 0 flow [2025-04-14 01:36:41,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:36:41,394 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:36:41,395 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:36:41,395 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:36:41,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:36:41,396 INFO L422 BasicCegarLoop]: Path program histogram: [8] [2025-04-14 01:36:41,400 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:36:41,400 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:36:41,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:36:41 BasicIcfg [2025-04-14 01:36:41,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:36:41,407 INFO L158 Benchmark]: Toolchain (without parser) took 3248.94ms. Allocated memory was 142.6MB in the beginning and 339.7MB in the end (delta: 197.1MB). Free memory was 102.0MB in the beginning and 261.1MB in the end (delta: -159.1MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. [2025-04-14 01:36:41,407 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:36:41,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.01ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 87.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:36:41,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.23ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:36:41,409 INFO L158 Benchmark]: Boogie Preprocessor took 25.82ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 84.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:36:41,410 INFO L158 Benchmark]: IcfgBuilder took 335.30ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 57.9MB in the end (delta: 26.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 01:36:41,410 INFO L158 Benchmark]: TraceAbstraction took 2651.43ms. Allocated memory was 142.6MB in the beginning and 339.7MB in the end (delta: 197.1MB). Free memory was 57.3MB in the beginning and 261.1MB in the end (delta: -203.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:36:41,412 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 155.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.01ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 87.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.23ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.82ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 84.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 335.30ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 57.9MB in the end (delta: 26.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2651.43ms. Allocated memory was 142.6MB in the beginning and 339.7MB in the end (delta: 197.1MB). Free memory was 57.3MB in the beginning and 261.1MB in the end (delta: -203.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: 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, 56 locations, 55 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: 2.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 484 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 484 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1210 IncrementalHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 0 mSDtfsCounter, 1210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, InterpolantAutomatonStates: 49, 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.8s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 01:36:41,425 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...