/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:55:53,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:55:53,904 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-13 20:55:53,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:55:53,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:55:53,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:55:53,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:55:53,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:55:53,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:55:53,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:55:53,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:55:53,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:55:53,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:55:53,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:55:53,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:55:53,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:55:53,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:53,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:53,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:55:53,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:55:53,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:55:53,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:55:53,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:55:53,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:55:53,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:55:53,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:55:53,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:55:53,932 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 [2025-04-13 20:55:54,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:55:54,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:55:54,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:55:54,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:55:54,176 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:55:54,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2025-04-13 20:55:55,491 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301a49817/12d20c4cc82a4fc6813c66fe5c0001d3/FLAG9189e53bf [2025-04-13 20:55:55,676 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:55:55,676 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2025-04-13 20:55:55,681 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301a49817/12d20c4cc82a4fc6813c66fe5c0001d3/FLAG9189e53bf [2025-04-13 20:55:56,542 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301a49817/12d20c4cc82a4fc6813c66fe5c0001d3 [2025-04-13 20:55:56,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:55:56,545 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:55:56,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:55:56,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:55:56,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:55:56,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311989fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56, skipping insertion in model container [2025-04-13 20:55:56,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:55:56,725 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/popl20-simple-queue.wvr.c[2464,2477] [2025-04-13 20:55:56,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:55:56,743 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:55:56,772 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/popl20-simple-queue.wvr.c[2464,2477] [2025-04-13 20:55:56,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:55:56,791 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:55:56,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56 WrapperNode [2025-04-13 20:55:56,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:55:56,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:55:56,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:55:56,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:55:56,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,823 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 120 [2025-04-13 20:55:56,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:55:56,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:55:56,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:55:56,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:55:56,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,854 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:55:56,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:55:56,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:55:56,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:55:56,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:55:56,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (1/1) ... [2025-04-13 20:55:56,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:56,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:56,900 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-13 20:55:56,902 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-13 20:55:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:55:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:55:56,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:55:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:55:56,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:55:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:55:56,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:55:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:55:56,919 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:55:56,985 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:55:56,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:55:57,147 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:55:57,147 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:55:57,147 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:55:57,295 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 20:55:57,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:55:57 BoogieIcfgContainer [2025-04-13 20:55:57,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:55:57,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:55:57,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:55:57,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:55:57,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:55:56" (1/3) ... [2025-04-13 20:55:57,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209e3b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:55:57, skipping insertion in model container [2025-04-13 20:55:57,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:56" (2/3) ... [2025-04-13 20:55:57,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209e3b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:55:57, skipping insertion in model container [2025-04-13 20:55:57,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:55:57" (3/3) ... [2025-04-13 20:55:57,302 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2025-04-13 20:55:57,311 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:55:57,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-queue.wvr.c that has 3 procedures, 19 locations, 19 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:55:57,312 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:55:57,342 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:55:57,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2025-04-13 20:55:57,383 INFO L116 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-04-13 20:55:57,384 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:55:57,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-13 20:55:57,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2025-04-13 20:55:57,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2025-04-13 20:55:57,396 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:55:57,405 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;@efc3045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:55:57,405 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:55:57,415 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:55:57,415 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 20:55:57,415 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:55:57,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:57,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:57,416 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-13 20:55:57,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1602585591, now seen corresponding path program 1 times [2025-04-13 20:55:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:57,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924566911] [2025-04-13 20:55:57,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:57,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:55:57,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:55:57,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:57,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:57,645 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-13 20:55:57,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:57,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924566911] [2025-04-13 20:55:57,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924566911] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:57,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:57,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:55:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831084426] [2025-04-13 20:55:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:57,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:55:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:57,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:55:57,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:55:57,674 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:55:57,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:57,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:57,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:55:57,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:57,761 INFO L116 PetriNetUnfolderBase]: 100/170 cut-off events. [2025-04-13 20:55:57,761 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 20:55:57,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 170 events. 100/170 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 550 event pairs, 30 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 306. Up to 84 conditions per place. [2025-04-13 20:55:57,763 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2025-04-13 20:55:57,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 122 flow [2025-04-13 20:55:57,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:55:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:55:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 20:55:57,775 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-04-13 20:55:57,776 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 48 flow. Second operand 3 states and 38 transitions. [2025-04-13 20:55:57,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 122 flow [2025-04-13 20:55:57,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:55:57,781 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 52 flow [2025-04-13 20:55:57,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-04-13 20:55:57,785 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2025-04-13 20:55:57,785 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 52 flow [2025-04-13 20:55:57,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:57,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:57,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:57,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:55:57,786 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-13 20:55:57,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1941144907, now seen corresponding path program 1 times [2025-04-13 20:55:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:57,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662124497] [2025-04-13 20:55:57,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:57,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:55:57,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:55:57,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:57,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:57,889 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-13 20:55:57,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:57,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662124497] [2025-04-13 20:55:57,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662124497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:57,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:57,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:55:57,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089608391] [2025-04-13 20:55:57,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:57,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:55:57,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:57,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:55:57,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:55:57,891 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:55:57,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 20:55:57,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:57,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:55:57,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:57,953 INFO L116 PetriNetUnfolderBase]: 97/182 cut-off events. [2025-04-13 20:55:57,953 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-13 20:55:57,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 182 events. 97/182 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 653 event pairs, 37 based on Foata normal form. 7/142 useless extension candidates. Maximal degree in co-relation 245. Up to 126 conditions per place. [2025-04-13 20:55:57,955 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2025-04-13 20:55:57,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 29 transitions, 129 flow [2025-04-13 20:55:57,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:55:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:55:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-13 20:55:57,957 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-04-13 20:55:57,957 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 52 flow. Second operand 3 states and 39 transitions. [2025-04-13 20:55:57,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 29 transitions, 129 flow [2025-04-13 20:55:57,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 29 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:55:57,958 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 62 flow [2025-04-13 20:55:57,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-04-13 20:55:57,958 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2025-04-13 20:55:57,958 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 62 flow [2025-04-13 20:55:57,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 20:55:57,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:57,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:57,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:55:57,959 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-13 20:55:57,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2112468181, now seen corresponding path program 1 times [2025-04-13 20:55:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:57,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602054158] [2025-04-13 20:55:57,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:57,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:55:57,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:55:57,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:57,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:58,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-13 20:55:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:58,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602054158] [2025-04-13 20:55:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602054158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:58,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:58,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:55:58,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173742260] [2025-04-13 20:55:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:58,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:55:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:58,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:55:58,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:55:58,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:55:58,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 20:55:58,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:58,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:55:58,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:58,172 INFO L116 PetriNetUnfolderBase]: 119/238 cut-off events. [2025-04-13 20:55:58,172 INFO L117 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-04-13 20:55:58,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 238 events. 119/238 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 991 event pairs, 97 based on Foata normal form. 8/183 useless extension candidates. Maximal degree in co-relation 381. Up to 179 conditions per place. [2025-04-13 20:55:58,174 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 17 selfloop transitions, 2 changer transitions 11/32 dead transitions. [2025-04-13 20:55:58,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 32 transitions, 150 flow [2025-04-13 20:55:58,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:55:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:55:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-13 20:55:58,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-04-13 20:55:58,175 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 62 flow. Second operand 4 states and 45 transitions. [2025-04-13 20:55:58,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 32 transitions, 150 flow [2025-04-13 20:55:58,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:55:58,176 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 74 flow [2025-04-13 20:55:58,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2025-04-13 20:55:58,177 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2025-04-13 20:55:58,177 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 74 flow [2025-04-13 20:55:58,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 20:55:58,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:58,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:58,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:55:58,177 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-13 20:55:58,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1911702446, now seen corresponding path program 1 times [2025-04-13 20:55:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:58,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358614545] [2025-04-13 20:55:58,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:58,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:58,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:55:58,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:55:58,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:58,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:58,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358614545] [2025-04-13 20:55:58,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358614545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:58,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272362233] [2025-04-13 20:55:58,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:58,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:58,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:55:58,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:55:58,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:55:58,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:55:58,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:58,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:58,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:55:58,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:58,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:55:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:58,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:59,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-04-13 20:55:59,201 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:55:59,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2025-04-13 20:55:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272362233] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:59,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:59,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 20:55:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651936338] [2025-04-13 20:55:59,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:59,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:55:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:59,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:55:59,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:55:59,256 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:55:59,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 74 flow. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 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-13 20:55:59,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:59,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:55:59,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:59,818 INFO L116 PetriNetUnfolderBase]: 439/816 cut-off events. [2025-04-13 20:55:59,818 INFO L117 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-04-13 20:55:59,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 816 events. 439/816 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4129 event pairs, 137 based on Foata normal form. 5/618 useless extension candidates. Maximal degree in co-relation 1868. Up to 184 conditions per place. [2025-04-13 20:55:59,822 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 79 selfloop transitions, 21 changer transitions 20/122 dead transitions. [2025-04-13 20:55:59,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 122 transitions, 602 flow [2025-04-13 20:55:59,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:55:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:55:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 177 transitions. [2025-04-13 20:55:59,823 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-04-13 20:55:59,823 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 74 flow. Second operand 14 states and 177 transitions. [2025-04-13 20:55:59,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 122 transitions, 602 flow [2025-04-13 20:55:59,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 122 transitions, 590 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:59,825 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 248 flow [2025-04-13 20:55:59,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=248, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-04-13 20:55:59,826 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 23 predicate places. [2025-04-13 20:55:59,826 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 248 flow [2025-04-13 20:55:59,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 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-13 20:55:59,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:59,826 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:59,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:56:00,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:00,027 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-13 20:56:00,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1574792695, now seen corresponding path program 2 times [2025-04-13 20:56:00,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:00,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493367270] [2025-04-13 20:56:00,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:56:00,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:00,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:56:00,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-04-13 20:56:00,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:56:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 20:56:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:00,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493367270] [2025-04-13 20:56:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493367270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:56:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792072634] [2025-04-13 20:56:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:00,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:56:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:00,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:56:00,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:56:00,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:56:00,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-13 20:56:00,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:00,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:56:00,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:00,262 INFO L116 PetriNetUnfolderBase]: 499/920 cut-off events. [2025-04-13 20:56:00,262 INFO L117 PetriNetUnfolderBase]: For 1004/1004 co-relation queries the response was YES. [2025-04-13 20:56:00,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2514 conditions, 920 events. 499/920 cut-off events. For 1004/1004 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4736 event pairs, 116 based on Foata normal form. 1/687 useless extension candidates. Maximal degree in co-relation 2156. Up to 291 conditions per place. [2025-04-13 20:56:00,268 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 45 selfloop transitions, 12 changer transitions 8/67 dead transitions. [2025-04-13 20:56:00,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 464 flow [2025-04-13 20:56:00,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:56:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:56:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-04-13 20:56:00,270 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-04-13 20:56:00,270 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 248 flow. Second operand 5 states and 65 transitions. [2025-04-13 20:56:00,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 464 flow [2025-04-13 20:56:00,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 442 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:00,277 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 276 flow [2025-04-13 20:56:00,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-04-13 20:56:00,278 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 27 predicate places. [2025-04-13 20:56:00,278 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 276 flow [2025-04-13 20:56:00,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-13 20:56:00,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:00,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:00,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:56:00,278 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-13 20:56:00,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1670152183, now seen corresponding path program 3 times [2025-04-13 20:56:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:00,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985960832] [2025-04-13 20:56:00,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:56:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:00,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:56:00,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:56:00,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:56:00,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:56:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:00,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985960832] [2025-04-13 20:56:00,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985960832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:00,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:00,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:56:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018640546] [2025-04-13 20:56:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:00,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:56:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:00,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:56:00,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:56:00,348 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:56:00,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:56:00,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:00,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:56:00,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:00,511 INFO L116 PetriNetUnfolderBase]: 872/1599 cut-off events. [2025-04-13 20:56:00,511 INFO L117 PetriNetUnfolderBase]: For 2608/2608 co-relation queries the response was YES. [2025-04-13 20:56:00,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 1599 events. 872/1599 cut-off events. For 2608/2608 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9041 event pairs, 302 based on Foata normal form. 35/1225 useless extension candidates. Maximal degree in co-relation 3714. Up to 717 conditions per place. [2025-04-13 20:56:00,520 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 55 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2025-04-13 20:56:00,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 600 flow [2025-04-13 20:56:00,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:56:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:56:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-13 20:56:00,522 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 20:56:00,522 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 276 flow. Second operand 4 states and 56 transitions. [2025-04-13 20:56:00,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 600 flow [2025-04-13 20:56:00,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 562 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 20:56:00,530 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 442 flow [2025-04-13 20:56:00,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=442, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2025-04-13 20:56:00,530 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 28 predicate places. [2025-04-13 20:56:00,531 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 442 flow [2025-04-13 20:56:00,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:56:00,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:00,531 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:00,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:56:00,531 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-13 20:56:00,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2051554491, now seen corresponding path program 4 times [2025-04-13 20:56:00,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:00,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972807451] [2025-04-13 20:56:00,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:56:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:00,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:56:00,555 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:56:00,555 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:56:00,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:56:00,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:00,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972807451] [2025-04-13 20:56:00,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972807451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:00,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420040897] [2025-04-13 20:56:00,664 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:56:00,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:00,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:00,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:56:00,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:56:00,708 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:56:00,724 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:56:00,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:56:00,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:00,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:56:00,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:00,760 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:56:00,925 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:56:00,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-04-13 20:56:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:56:00,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:01,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-04-13 20:56:01,265 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 20:56:01,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2025-04-13 20:56:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:56:01,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420040897] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:56:01,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:56:01,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 18 [2025-04-13 20:56:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879701136] [2025-04-13 20:56:01,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:56:01,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:56:01,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:01,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:56:01,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:56:01,360 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:56:01,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 442 flow. Second operand has 20 states, 20 states have (on average 6.55) internal successors, (131), 20 states have internal predecessors, (131), 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-13 20:56:01,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:01,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:56:01,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:02,247 INFO L116 PetriNetUnfolderBase]: 1426/2627 cut-off events. [2025-04-13 20:56:02,248 INFO L117 PetriNetUnfolderBase]: For 7016/7016 co-relation queries the response was YES. [2025-04-13 20:56:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7980 conditions, 2627 events. 1426/2627 cut-off events. For 7016/7016 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16015 event pairs, 185 based on Foata normal form. 84/2031 useless extension candidates. Maximal degree in co-relation 3487. Up to 450 conditions per place. [2025-04-13 20:56:02,260 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 91 selfloop transitions, 37 changer transitions 70/200 dead transitions. [2025-04-13 20:56:02,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 200 transitions, 1480 flow [2025-04-13 20:56:02,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:56:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:56:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 254 transitions. [2025-04-13 20:56:02,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6047619047619047 [2025-04-13 20:56:02,264 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 442 flow. Second operand 20 states and 254 transitions. [2025-04-13 20:56:02,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 200 transitions, 1480 flow [2025-04-13 20:56:02,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 200 transitions, 1450 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-04-13 20:56:02,276 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 661 flow [2025-04-13 20:56:02,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=661, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2025-04-13 20:56:02,276 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 59 predicate places. [2025-04-13 20:56:02,277 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 661 flow [2025-04-13 20:56:02,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.55) internal successors, (131), 20 states have internal predecessors, (131), 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-13 20:56:02,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:02,277 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:02,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:56:02,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-13 20:56:02,477 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-13 20:56:02,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1917343989, now seen corresponding path program 5 times [2025-04-13 20:56:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:02,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572416346] [2025-04-13 20:56:02,478 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:56:02,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:02,486 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:56:02,500 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:56:02,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:56:02,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:56:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:02,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572416346] [2025-04-13 20:56:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572416346] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:02,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957966683] [2025-04-13 20:56:02,858 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:56:02,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:02,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:56:02,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:56:02,902 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:56:02,919 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:56:02,919 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:56:02,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:02,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 20:56:02,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:03,122 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:56:03,122 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-04-13 20:56:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:56:03,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:03,174 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 20:56:03,174 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2025-04-13 20:56:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:56:03,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957966683] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:56:03,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:56:03,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 20:56:03,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269670727] [2025-04-13 20:56:03,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:56:03,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:56:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:03,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:56:03,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:56:03,436 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:56:03,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 661 flow. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 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-13 20:56:03,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:03,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:56:03,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:04,090 INFO L116 PetriNetUnfolderBase]: 1234/2284 cut-off events. [2025-04-13 20:56:04,090 INFO L117 PetriNetUnfolderBase]: For 11553/11553 co-relation queries the response was YES. [2025-04-13 20:56:04,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7810 conditions, 2284 events. 1234/2284 cut-off events. For 11553/11553 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 13314 event pairs, 423 based on Foata normal form. 5/1700 useless extension candidates. Maximal degree in co-relation 7267. Up to 893 conditions per place. [2025-04-13 20:56:04,102 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 103 selfloop transitions, 27 changer transitions 21/153 dead transitions. [2025-04-13 20:56:04,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 153 transitions, 1438 flow [2025-04-13 20:56:04,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:56:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:56:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 180 transitions. [2025-04-13 20:56:04,106 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-04-13 20:56:04,107 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 661 flow. Second operand 15 states and 180 transitions. [2025-04-13 20:56:04,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 153 transitions, 1438 flow [2025-04-13 20:56:04,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 153 transitions, 1212 flow, removed 84 selfloop flow, removed 9 redundant places. [2025-04-13 20:56:04,127 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 640 flow [2025-04-13 20:56:04,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=640, PETRI_PLACES=86, PETRI_TRANSITIONS=66} [2025-04-13 20:56:04,128 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 64 predicate places. [2025-04-13 20:56:04,128 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 640 flow [2025-04-13 20:56:04,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 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-13 20:56:04,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:04,128 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:04,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:56:04,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:04,332 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:56:04,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2065817388, now seen corresponding path program 6 times [2025-04-13 20:56:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:04,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225867350] [2025-04-13 20:56:04,333 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:56:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:04,341 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 3 equivalence classes. [2025-04-13 20:56:04,368 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:56:04,368 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:56:04,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:56:04,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:04,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225867350] [2025-04-13 20:56:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225867350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:04,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57035269] [2025-04-13 20:56:04,476 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:56:04,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:04,478 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:56:04,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:56:04,522 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 3 equivalence classes. [2025-04-13 20:56:04,541 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:56:04,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:56:04,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:04,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:56:04,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:56:04,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:04,720 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:56:04,720 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2025-04-13 20:56:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:56:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57035269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:56:04,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:56:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 20:56:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226426213] [2025-04-13 20:56:04,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:56:04,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:56:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:04,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:56:04,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:56:04,785 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:56:04,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 640 flow. Second operand has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 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-13 20:56:04,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:04,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:56:04,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:05,347 INFO L116 PetriNetUnfolderBase]: 2001/3640 cut-off events. [2025-04-13 20:56:05,348 INFO L117 PetriNetUnfolderBase]: For 15218/15218 co-relation queries the response was YES. [2025-04-13 20:56:05,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11721 conditions, 3640 events. 2001/3640 cut-off events. For 15218/15218 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 22244 event pairs, 208 based on Foata normal form. 37/2736 useless extension candidates. Maximal degree in co-relation 10551. Up to 649 conditions per place. [2025-04-13 20:56:05,360 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 0 selfloop transitions, 0 changer transitions 176/176 dead transitions. [2025-04-13 20:56:05,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 176 transitions, 1580 flow [2025-04-13 20:56:05,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:56:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:56:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2025-04-13 20:56:05,361 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.63003663003663 [2025-04-13 20:56:05,361 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 640 flow. Second operand 13 states and 172 transitions. [2025-04-13 20:56:05,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 176 transitions, 1580 flow [2025-04-13 20:56:05,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 176 transitions, 1371 flow, removed 46 selfloop flow, removed 17 redundant places. [2025-04-13 20:56:05,374 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2025-04-13 20:56:05,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2025-04-13 20:56:05,375 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 58 predicate places. [2025-04-13 20:56:05,375 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2025-04-13 20:56:05,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 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-13 20:56:05,377 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:56:05,377 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:56:05,377 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:56:05,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:56:05,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:05,578 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2025-04-13 20:56:05,581 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:56:05,581 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:56:05,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:56:05 BasicIcfg [2025-04-13 20:56:05,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:56:05,584 INFO L158 Benchmark]: Toolchain (without parser) took 9038.89ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 108.3MB in the beginning and 261.0MB in the end (delta: -152.6MB). Peak memory consumption was 229.7MB. Max. memory is 8.0GB. [2025-04-13 20:56:05,584 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:56:05,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.37ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 93.5MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:56:05,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.03ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:56:05,584 INFO L158 Benchmark]: Boogie Preprocessor took 50.11ms. Allocated memory is still 155.2MB. Free memory was 91.6MB in the beginning and 89.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:56:05,584 INFO L158 Benchmark]: RCFGBuilder took 421.25ms. Allocated memory is still 155.2MB. Free memory was 89.8MB in the beginning and 47.9MB in the end (delta: 41.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 20:56:05,584 INFO L158 Benchmark]: TraceAbstraction took 8286.15ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 47.3MB in the beginning and 261.0MB in the end (delta: -213.6MB). Peak memory consumption was 175.2MB. Max. memory is 8.0GB. [2025-04-13 20:56:05,585 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.16ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.37ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 93.5MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.03ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.11ms. Allocated memory is still 155.2MB. Free memory was 91.6MB in the beginning and 89.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 421.25ms. Allocated memory is still 155.2MB. Free memory was 89.8MB in the beginning and 47.9MB in the end (delta: 41.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8286.15ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 47.3MB in the beginning and 261.0MB in the end (delta: -213.6MB). Peak memory consumption was 175.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: 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, 29 locations, 33 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: 8.2s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 904 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1782 IncrementalHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 0 mSDtfsCounter, 1782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=661occurred in iteration=7, InterpolantAutomatonStates: 81, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 263 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 334 ConstructedInterpolants, 24 QuantifiedInterpolants, 3721 SizeOfPredicates, 41 NumberOfNonLiveVariables, 651 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 39/84 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-13 20:56:05,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...