/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/chl-nzb-file-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:01:57,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:01:57,559 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:01:57,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:01:57,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:01:57,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:01:57,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:01:57,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:01:57,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:01:57,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:01:57,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:01:57,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:01:57,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:01:57,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:01:57,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:01:57,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:01:57,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:01:57,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:01:57,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:01:57,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:01:57,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:01:57,590 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:01:57,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:01:57,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:01:57,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:01:57,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:01:57,817 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:01:57,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2025-04-13 20:01:59,140 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5761a20/ea23770e78444af2befb92899c0c8f61/FLAGd3d5c479d [2025-04-13 20:01:59,354 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:01:59,354 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2025-04-13 20:01:59,363 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5761a20/ea23770e78444af2befb92899c0c8f61/FLAGd3d5c479d [2025-04-13 20:02:00,141 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5761a20/ea23770e78444af2befb92899c0c8f61 [2025-04-13 20:02:00,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:02:00,144 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:02:00,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:02:00,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:02:00,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:02:00,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e10549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00, skipping insertion in model container [2025-04-13 20:02:00,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:02:00,363 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/chl-nzb-file-symm.wvr.c[4955,4968] [2025-04-13 20:02:00,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:02:00,383 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:02:00,422 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/chl-nzb-file-symm.wvr.c[4955,4968] [2025-04-13 20:02:00,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:02:00,443 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:02:00,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00 WrapperNode [2025-04-13 20:02:00,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:02:00,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:02:00,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:02:00,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:02:00,448 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:02:00" (1/1) ... [2025-04-13 20:02:00,458 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:02:00" (1/1) ... [2025-04-13 20:02:00,491 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 399 [2025-04-13 20:02:00,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:02:00,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:02:00,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:02:00,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:02:00,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,524 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 20:02:00,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:02:00,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:02:00,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:02:00,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:02:00,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (1/1) ... [2025-04-13 20:02:00,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:02:00,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:00,570 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:02:00,572 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:02:00,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:02:00,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:02:00,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:02:00,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:02:00,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:02:00,590 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:02:00,679 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:02:00,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:02:01,142 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:02:01,143 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:02:01,143 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:02:01,738 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 20:02:01,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:02:01 BoogieIcfgContainer [2025-04-13 20:02:01,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:02:01,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:02:01,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:02:01,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:02:01,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:02:00" (1/3) ... [2025-04-13 20:02:01,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd7abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:02:01, skipping insertion in model container [2025-04-13 20:02:01,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:02:00" (2/3) ... [2025-04-13 20:02:01,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd7abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:02:01, skipping insertion in model container [2025-04-13 20:02:01,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:02:01" (3/3) ... [2025-04-13 20:02:01,744 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-04-13 20:02:01,754 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:02:01,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 18 locations, 21 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:02:01,755 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:02:01,815 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:02:01,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 60 flow [2025-04-13 20:02:01,861 INFO L116 PetriNetUnfolderBase]: 6/21 cut-off events. [2025-04-13 20:02:01,863 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:02:01,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 6/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-13 20:02:01,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 23 transitions, 60 flow [2025-04-13 20:02:01,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 20 transitions, 52 flow [2025-04-13 20:02:01,877 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:02:01,887 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;@612b248a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:02:01,887 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:02:01,897 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:02:01,897 INFO L116 PetriNetUnfolderBase]: 6/19 cut-off events. [2025-04-13 20:02:01,897 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:02:01,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:01,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:01,899 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:02:01,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2018569772, now seen corresponding path program 1 times [2025-04-13 20:02:01,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:01,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646974659] [2025-04-13 20:02:01,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:01,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:02:02,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:02:02,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:02,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:02,234 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:02:02,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:02,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646974659] [2025-04-13 20:02:02,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646974659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:02:02,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:02:02,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:02:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896706611] [2025-04-13 20:02:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:02:02,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:02:02,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:02,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:02:02,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:02:02,265 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:02,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:02:02,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:02,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:02,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:02,414 INFO L116 PetriNetUnfolderBase]: 54/88 cut-off events. [2025-04-13 20:02:02,414 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:02:02,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 88 events. 54/88 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 143 event pairs, 22 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 87 conditions per place. [2025-04-13 20:02:02,416 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 18 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2025-04-13 20:02:02,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 22 transitions, 100 flow [2025-04-13 20:02:02,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:02:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:02:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-04-13 20:02:02,426 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2025-04-13 20:02:02,428 INFO L175 Difference]: Start difference. First operand has 21 places, 20 transitions, 52 flow. Second operand 3 states and 30 transitions. [2025-04-13 20:02:02,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 22 transitions, 100 flow [2025-04-13 20:02:02,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:02:02,435 INFO L231 Difference]: Finished difference. Result has 20 places, 22 transitions, 66 flow [2025-04-13 20:02:02,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=20, PETRI_TRANSITIONS=22} [2025-04-13 20:02:02,440 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-04-13 20:02:02,440 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 22 transitions, 66 flow [2025-04-13 20:02:02,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:02:02,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:02,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:02,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:02:02,441 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:02:02,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash 96918062, now seen corresponding path program 1 times [2025-04-13 20:02:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:02,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158491470] [2025-04-13 20:02:02,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:02,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:02,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:02:02,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:02:02,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:02,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:02:02,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:02,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158491470] [2025-04-13 20:02:02,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158491470] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:02,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002436938] [2025-04-13 20:02:02,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:02,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:02,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:02,634 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:02:02,635 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:02:02,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:02:02,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:02:02,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:02,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:02,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:02:02,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:02:02,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:02:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002436938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:02,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:02,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-13 20:02:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922556311] [2025-04-13 20:02:02,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:02,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:02:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:02,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:02:02,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:02:02,838 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:02,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 22 transitions, 66 flow. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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:02:02,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:02,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:02,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:02,967 INFO L116 PetriNetUnfolderBase]: 54/94 cut-off events. [2025-04-13 20:02:02,967 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:02:02,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 94 events. 54/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 22 based on Foata normal form. 3/66 useless extension candidates. Maximal degree in co-relation 181. Up to 87 conditions per place. [2025-04-13 20:02:02,968 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 18 selfloop transitions, 10 changer transitions 0/28 dead transitions. [2025-04-13 20:02:02,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 146 flow [2025-04-13 20:02:02,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:02:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:02:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-04-13 20:02:02,970 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:02:02,970 INFO L175 Difference]: Start difference. First operand has 20 places, 22 transitions, 66 flow. Second operand 6 states and 46 transitions. [2025-04-13 20:02:02,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 146 flow [2025-04-13 20:02:02,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:02:02,971 INFO L231 Difference]: Finished difference. Result has 27 places, 28 transitions, 128 flow [2025-04-13 20:02:02,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=27, PETRI_TRANSITIONS=28} [2025-04-13 20:02:02,971 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2025-04-13 20:02:02,971 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 28 transitions, 128 flow [2025-04-13 20:02:02,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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:02:02,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:02,972 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:02,979 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:02:03,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:03,176 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:02:03,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:03,177 INFO L85 PathProgramCache]: Analyzing trace with hash 38483828, now seen corresponding path program 2 times [2025-04-13 20:02:03,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:03,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432584338] [2025-04-13 20:02:03,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:02:03,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:03,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:02:03,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 20 statements. [2025-04-13 20:02:03,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:02:03,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 20:02:03,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:03,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432584338] [2025-04-13 20:02:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432584338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:02:03,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:02:03,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:02:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815914909] [2025-04-13 20:02:03,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:02:03,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:02:03,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:03,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:02:03,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:02:03,922 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:03,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:02:03,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:03,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:03,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:04,100 INFO L116 PetriNetUnfolderBase]: 89/158 cut-off events. [2025-04-13 20:02:04,101 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:02:04,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 158 events. 89/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 409 event pairs, 17 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 302. Up to 87 conditions per place. [2025-04-13 20:02:04,102 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 37 selfloop transitions, 8 changer transitions 2/47 dead transitions. [2025-04-13 20:02:04,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 47 transitions, 265 flow [2025-04-13 20:02:04,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:02:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:02:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-04-13 20:02:04,104 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2025-04-13 20:02:04,104 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 128 flow. Second operand 4 states and 48 transitions. [2025-04-13 20:02:04,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 47 transitions, 265 flow [2025-04-13 20:02:04,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 249 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 20:02:04,105 INFO L231 Difference]: Finished difference. Result has 32 places, 36 transitions, 174 flow [2025-04-13 20:02:04,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=32, PETRI_TRANSITIONS=36} [2025-04-13 20:02:04,106 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2025-04-13 20:02:04,106 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 36 transitions, 174 flow [2025-04-13 20:02:04,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:02:04,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:04,106 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:04,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:02:04,106 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:02:04,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1963316690, now seen corresponding path program 3 times [2025-04-13 20:02:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:04,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72552220] [2025-04-13 20:02:04,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:02:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:04,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:02:04,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 20 statements. [2025-04-13 20:02:04,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:02:04,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 20:02:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:04,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72552220] [2025-04-13 20:02:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72552220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:02:04,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:02:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:02:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459276338] [2025-04-13 20:02:04,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:02:04,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:02:04,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:04,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:02:04,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:02:04,611 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:04,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 36 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:02:04,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:04,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:04,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:04,781 INFO L116 PetriNetUnfolderBase]: 129/226 cut-off events. [2025-04-13 20:02:04,782 INFO L117 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-04-13 20:02:04,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 226 events. 129/226 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 691 event pairs, 16 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 593. Up to 118 conditions per place. [2025-04-13 20:02:04,783 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 48 selfloop transitions, 10 changer transitions 3/61 dead transitions. [2025-04-13 20:02:04,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 61 transitions, 389 flow [2025-04-13 20:02:04,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:02:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:02:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-04-13 20:02:04,787 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2025-04-13 20:02:04,787 INFO L175 Difference]: Start difference. First operand has 32 places, 36 transitions, 174 flow. Second operand 4 states and 48 transitions. [2025-04-13 20:02:04,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 61 transitions, 389 flow [2025-04-13 20:02:04,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 61 transitions, 389 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:02:04,789 INFO L231 Difference]: Finished difference. Result has 38 places, 46 transitions, 272 flow [2025-04-13 20:02:04,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=38, PETRI_TRANSITIONS=46} [2025-04-13 20:02:04,792 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-04-13 20:02:04,792 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 46 transitions, 272 flow [2025-04-13 20:02:04,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:02:04,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:04,792 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:04,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:02:04,792 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:02:04,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1191927533, now seen corresponding path program 1 times [2025-04-13 20:02:04,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:04,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323875447] [2025-04-13 20:02:04,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:04,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:04,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:02:04,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:02:04,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:04,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 20:02:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:04,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323875447] [2025-04-13 20:02:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323875447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:02:04,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:02:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:02:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748546553] [2025-04-13 20:02:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:02:04,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:02:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:04,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:02:04,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:02:04,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:04,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 46 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:02:04,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:04,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:04,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:04,976 INFO L116 PetriNetUnfolderBase]: 127/231 cut-off events. [2025-04-13 20:02:04,976 INFO L117 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-04-13 20:02:04,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 231 events. 127/231 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 706 event pairs, 40 based on Foata normal form. 5/177 useless extension candidates. Maximal degree in co-relation 739. Up to 174 conditions per place. [2025-04-13 20:02:04,978 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 46 selfloop transitions, 4 changer transitions 4/54 dead transitions. [2025-04-13 20:02:04,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 399 flow [2025-04-13 20:02:04,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:02:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:02:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 20:02:04,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2025-04-13 20:02:04,979 INFO L175 Difference]: Start difference. First operand has 38 places, 46 transitions, 272 flow. Second operand 3 states and 38 transitions. [2025-04-13 20:02:04,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 399 flow [2025-04-13 20:02:04,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 381 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:02:04,982 INFO L231 Difference]: Finished difference. Result has 38 places, 42 transitions, 234 flow [2025-04-13 20:02:04,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=38, PETRI_TRANSITIONS=42} [2025-04-13 20:02:04,982 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-04-13 20:02:04,982 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 42 transitions, 234 flow [2025-04-13 20:02:04,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:02:04,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:04,982 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:04,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:02:04,983 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:02:04,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2145429527, now seen corresponding path program 1 times [2025-04-13 20:02:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:04,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924701333] [2025-04-13 20:02:04,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:04,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:02:05,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:02:05,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:05,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 20:02:05,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:05,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924701333] [2025-04-13 20:02:05,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924701333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:02:05,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:02:05,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:02:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011494025] [2025-04-13 20:02:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:02:05,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:02:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:05,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:02:05,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:02:05,064 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:05,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 42 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:02:05,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:05,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:05,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:05,157 INFO L116 PetriNetUnfolderBase]: 96/173 cut-off events. [2025-04-13 20:02:05,158 INFO L117 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-04-13 20:02:05,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 173 events. 96/173 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 442 event pairs, 13 based on Foata normal form. 13/137 useless extension candidates. Maximal degree in co-relation 580. Up to 156 conditions per place. [2025-04-13 20:02:05,159 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 35 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-04-13 20:02:05,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 265 flow [2025-04-13 20:02:05,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:02:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:02:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-13 20:02:05,160 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2025-04-13 20:02:05,160 INFO L175 Difference]: Start difference. First operand has 38 places, 42 transitions, 234 flow. Second operand 3 states and 31 transitions. [2025-04-13 20:02:05,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 265 flow [2025-04-13 20:02:05,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 245 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:02:05,162 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 168 flow [2025-04-13 20:02:05,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-04-13 20:02:05,162 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2025-04-13 20:02:05,162 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 168 flow [2025-04-13 20:02:05,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:02:05,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:05,162 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:05,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:02:05,163 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:02:05,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1321777534, now seen corresponding path program 1 times [2025-04-13 20:02:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:05,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441440208] [2025-04-13 20:02:05,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:05,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:05,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:02:05,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:02:05,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:05,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 20:02:05,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:05,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441440208] [2025-04-13 20:02:05,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441440208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:05,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267272809] [2025-04-13 20:02:05,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:05,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:05,293 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:02:05,295 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:02:05,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:02:05,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:02:05,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:05,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:05,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:02:05,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 20:02:05,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 20:02:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267272809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:05,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:05,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:02:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632359869] [2025-04-13 20:02:05,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:05,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:02:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:05,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:02:05,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:02:05,532 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:05,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 168 flow. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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:02:05,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:05,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:05,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:05,640 INFO L116 PetriNetUnfolderBase]: 96/175 cut-off events. [2025-04-13 20:02:05,640 INFO L117 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-04-13 20:02:05,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 175 events. 96/175 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 431 event pairs, 40 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 525. Up to 166 conditions per place. [2025-04-13 20:02:05,642 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 24 selfloop transitions, 12 changer transitions 0/36 dead transitions. [2025-04-13 20:02:05,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 252 flow [2025-04-13 20:02:05,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:02:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:02:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2025-04-13 20:02:05,645 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2732919254658385 [2025-04-13 20:02:05,645 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 168 flow. Second operand 7 states and 44 transitions. [2025-04-13 20:02:05,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 252 flow [2025-04-13 20:02:05,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:02:05,646 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 214 flow [2025-04-13 20:02:05,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-04-13 20:02:05,647 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2025-04-13 20:02:05,647 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 214 flow [2025-04-13 20:02:05,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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:02:05,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:05,647 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:05,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:02:05,854 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:02:05,854 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:02:05,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash -154378964, now seen corresponding path program 2 times [2025-04-13 20:02:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:05,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390163835] [2025-04-13 20:02:05,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:02:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:05,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:02:05,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-13 20:02:05,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:02:05,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:02:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:05,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390163835] [2025-04-13 20:02:05,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390163835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:02:05,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:02:05,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:02:05,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641542800] [2025-04-13 20:02:05,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:02:05,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:02:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:05,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:02:05,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:02:05,935 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:05,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:02:05,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:05,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:05,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:06,021 INFO L116 PetriNetUnfolderBase]: 101/186 cut-off events. [2025-04-13 20:02:06,022 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-13 20:02:06,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 186 events. 101/186 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 476 event pairs, 32 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 572. Up to 160 conditions per place. [2025-04-13 20:02:06,023 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 40 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-04-13 20:02:06,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 329 flow [2025-04-13 20:02:06,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:02:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:02:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-04-13 20:02:06,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.463768115942029 [2025-04-13 20:02:06,023 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 214 flow. Second operand 3 states and 32 transitions. [2025-04-13 20:02:06,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 329 flow [2025-04-13 20:02:06,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 20:02:06,025 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 210 flow [2025-04-13 20:02:06,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-13 20:02:06,025 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2025-04-13 20:02:06,025 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 210 flow [2025-04-13 20:02:06,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:02:06,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:06,026 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:06,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:02:06,026 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:02:06,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1788794009, now seen corresponding path program 1 times [2025-04-13 20:02:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:06,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637721337] [2025-04-13 20:02:06,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:06,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:06,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:02:06,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:02:06,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:06,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 20:02:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:06,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637721337] [2025-04-13 20:02:06,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637721337] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:02:06,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:02:06,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:02:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560830496] [2025-04-13 20:02:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:02:06,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:02:06,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:06,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:02:06,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:02:06,151 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:06,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 210 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:02:06,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:06,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:06,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:06,229 INFO L116 PetriNetUnfolderBase]: 104/196 cut-off events. [2025-04-13 20:02:06,229 INFO L117 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-04-13 20:02:06,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 196 events. 104/196 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 512 event pairs, 34 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 636. Up to 168 conditions per place. [2025-04-13 20:02:06,231 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 41 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-04-13 20:02:06,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 336 flow [2025-04-13 20:02:06,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:02:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:02:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-13 20:02:06,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2025-04-13 20:02:06,233 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 210 flow. Second operand 3 states and 31 transitions. [2025-04-13 20:02:06,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 336 flow [2025-04-13 20:02:06,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 327 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:02:06,235 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 224 flow [2025-04-13 20:02:06,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-04-13 20:02:06,236 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2025-04-13 20:02:06,236 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 224 flow [2025-04-13 20:02:06,236 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:02:06,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:06,237 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:06,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:02:06,237 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:02:06,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2053257898, now seen corresponding path program 1 times [2025-04-13 20:02:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:06,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072528127] [2025-04-13 20:02:06,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:06,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:02:06,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:02:06,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:02:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:11,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072528127] [2025-04-13 20:02:11,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072528127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:11,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328896944] [2025-04-13 20:02:11,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:02:11,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:11,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:11,650 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:02:11,651 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:02:11,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:02:11,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:02:11,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:02:11,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:11,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 20:02:11,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:12,627 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:02:12,628 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 326 treesize of output 278 [2025-04-13 20:02:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:02:13,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:15,233 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:02:15,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 388 treesize of output 360 [2025-04-13 20:02:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:02:16,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328896944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:16,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:16,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 32 [2025-04-13 20:02:16,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948335472] [2025-04-13 20:02:16,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:16,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:02:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:16,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:02:16,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:02:16,188 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:16,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 224 flow. Second operand has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 33 states have internal predecessors, (121), 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:02:16,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:16,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:16,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:18,037 INFO L116 PetriNetUnfolderBase]: 278/540 cut-off events. [2025-04-13 20:02:18,038 INFO L117 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2025-04-13 20:02:18,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 540 events. 278/540 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2214 event pairs, 30 based on Foata normal form. 2/420 useless extension candidates. Maximal degree in co-relation 1714. Up to 181 conditions per place. [2025-04-13 20:02:18,041 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 99 selfloop transitions, 61 changer transitions 4/164 dead transitions. [2025-04-13 20:02:18,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 164 transitions, 1108 flow [2025-04-13 20:02:18,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 20:02:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-13 20:02:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 210 transitions. [2025-04-13 20:02:18,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2536231884057971 [2025-04-13 20:02:18,044 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 224 flow. Second operand 36 states and 210 transitions. [2025-04-13 20:02:18,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 164 transitions, 1108 flow [2025-04-13 20:02:18,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 164 transitions, 1076 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-13 20:02:18,050 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 664 flow [2025-04-13 20:02:18,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=664, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2025-04-13 20:02:18,051 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 63 predicate places. [2025-04-13 20:02:18,051 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 664 flow [2025-04-13 20:02:18,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 33 states have internal predecessors, (121), 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:02:18,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:18,051 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:18,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:02:18,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:18,252 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:02:18,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash -396671358, now seen corresponding path program 2 times [2025-04-13 20:02:18,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:18,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229046219] [2025-04-13 20:02:18,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:02:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:18,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:02:18,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:02:18,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:02:18,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:02:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:22,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229046219] [2025-04-13 20:02:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229046219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:22,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912255159] [2025-04-13 20:02:22,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:02:22,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:22,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:22,849 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:02:22,852 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:02:22,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:02:23,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:02:23,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:02:23,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:23,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-04-13 20:02:23,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:23,068 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 15 treesize of output 1 [2025-04-13 20:02:23,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 58 treesize of output 42 [2025-04-13 20:02:23,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:02:23,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2025-04-13 20:02:23,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:02:23,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:02:23,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-04-13 20:02:23,238 INFO L325 Elim1Store]: treesize reduction 76, result has 28.3 percent of original size [2025-04-13 20:02:23,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 69 [2025-04-13 20:02:23,402 INFO L325 Elim1Store]: treesize reduction 76, result has 28.3 percent of original size [2025-04-13 20:02:23,403 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 69 [2025-04-13 20:02:23,545 INFO L325 Elim1Store]: treesize reduction 76, result has 28.3 percent of original size [2025-04-13 20:02:23,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 69 [2025-04-13 20:02:24,967 INFO L325 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-04-13 20:02:24,968 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 346 treesize of output 294 [2025-04-13 20:02:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:02:25,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:02:27,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912255159] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:27,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:27,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 7] total 40 [2025-04-13 20:02:27,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651745190] [2025-04-13 20:02:27,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:27,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 20:02:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:27,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 20:02:27,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1495, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 20:02:27,877 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:27,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 664 flow. Second operand has 41 states, 41 states have (on average 3.6097560975609757) internal successors, (148), 41 states have internal predecessors, (148), 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:02:27,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:27,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:27,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:30,394 INFO L116 PetriNetUnfolderBase]: 436/852 cut-off events. [2025-04-13 20:02:30,395 INFO L117 PetriNetUnfolderBase]: For 1552/1552 co-relation queries the response was YES. [2025-04-13 20:02:30,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 852 events. 436/852 cut-off events. For 1552/1552 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4210 event pairs, 54 based on Foata normal form. 4/856 useless extension candidates. Maximal degree in co-relation 3230. Up to 297 conditions per place. [2025-04-13 20:02:30,401 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 86 selfloop transitions, 44 changer transitions 15/145 dead transitions. [2025-04-13 20:02:30,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 145 transitions, 1285 flow [2025-04-13 20:02:30,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:02:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:02:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 103 transitions. [2025-04-13 20:02:30,403 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23569794050343248 [2025-04-13 20:02:30,403 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 664 flow. Second operand 19 states and 103 transitions. [2025-04-13 20:02:30,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 145 transitions, 1285 flow [2025-04-13 20:02:30,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 145 transitions, 1127 flow, removed 46 selfloop flow, removed 10 redundant places. [2025-04-13 20:02:30,434 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 674 flow [2025-04-13 20:02:30,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=674, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-04-13 20:02:30,434 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 75 predicate places. [2025-04-13 20:02:30,435 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 674 flow [2025-04-13 20:02:30,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.6097560975609757) internal successors, (148), 41 states have internal predecessors, (148), 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:02:30,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:30,435 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:30,444 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:02:30,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:30,636 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:02:30,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2018646372, now seen corresponding path program 3 times [2025-04-13 20:02:30,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:30,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295868595] [2025-04-13 20:02:30,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:02:30,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:30,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 20:02:30,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 20:02:30,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:02:30,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:02:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:33,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295868595] [2025-04-13 20:02:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295868595] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:33,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93038216] [2025-04-13 20:02:33,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:02:33,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:33,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:33,059 INFO L229 MonitoredProcess]: Starting monitored process 6 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:02:33,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:02:33,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 20:02:33,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 20:02:33,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:02:33,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:33,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 20:02:33,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:34,121 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:02:34,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 347 treesize of output 283 [2025-04-13 20:02:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:02:34,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:02:35,957 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 20:02:35,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 373 treesize of output 344 [2025-04-13 20:02:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 20:02:36,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93038216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:02:36,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:02:36,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2025-04-13 20:02:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078661279] [2025-04-13 20:02:36,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:02:36,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:02:36,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:02:36,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:02:36,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:02:36,814 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-13 20:02:36,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 674 flow. Second operand has 25 states, 25 states have (on average 4.16) internal successors, (104), 25 states have internal predecessors, (104), 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:02:36,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:02:36,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-13 20:02:36,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:02:38,962 INFO L116 PetriNetUnfolderBase]: 468/930 cut-off events. [2025-04-13 20:02:38,963 INFO L117 PetriNetUnfolderBase]: For 2573/2573 co-relation queries the response was YES. [2025-04-13 20:02:38,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 930 events. 468/930 cut-off events. For 2573/2573 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4863 event pairs, 100 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 3819. Up to 405 conditions per place. [2025-04-13 20:02:38,967 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 114 selfloop transitions, 46 changer transitions 2/162 dead transitions. [2025-04-13 20:02:38,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 162 transitions, 1437 flow [2025-04-13 20:02:38,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:02:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:02:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2025-04-13 20:02:38,968 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30434782608695654 [2025-04-13 20:02:38,968 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 674 flow. Second operand 14 states and 98 transitions. [2025-04-13 20:02:38,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 162 transitions, 1437 flow [2025-04-13 20:02:38,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 162 transitions, 1348 flow, removed 25 selfloop flow, removed 12 redundant places. [2025-04-13 20:02:38,975 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 975 flow [2025-04-13 20:02:38,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=975, PETRI_PLACES=101, PETRI_TRANSITIONS=113} [2025-04-13 20:02:38,976 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2025-04-13 20:02:38,976 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 975 flow [2025-04-13 20:02:38,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 25 states have internal predecessors, (104), 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:02:38,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:02:38,976 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:02:38,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:02:39,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 20:02:39,177 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:02:39,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:02:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1937461092, now seen corresponding path program 4 times [2025-04-13 20:02:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:02:39,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20809228] [2025-04-13 20:02:39,177 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:02:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:02:39,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:02:39,266 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:02:39,267 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:02:39,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:02:42,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:02:42,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20809228] [2025-04-13 20:02:42,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20809228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:02:42,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385135418] [2025-04-13 20:02:42,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:02:42,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:02:42,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:02:42,665 INFO L229 MonitoredProcess]: Starting monitored process 7 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:02:42,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:02:42,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:02:42,815 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:02:42,815 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:02:42,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:02:42,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-13 20:02:42,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:02:42,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 43 treesize of output 30 [2025-04-13 20:02:42,841 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-04-13 20:02:42,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-04-13 20:02:42,867 INFO L325 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-04-13 20:02:42,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-04-13 20:02:42,894 INFO L325 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-04-13 20:02:42,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-04-13 20:02:42,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 46 [2025-04-13 20:02:42,926 INFO L325 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2025-04-13 20:02:42,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2025-04-13 20:02:42,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:02:42,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:02:42,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2025-04-13 20:02:43,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 114 treesize of output 90 [2025-04-13 20:02:43,045 INFO L325 Elim1Store]: treesize reduction 127, result has 18.1 percent of original size [2025-04-13 20:02:43,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 90 treesize of output 117 [2025-04-13 20:02:43,135 INFO L325 Elim1Store]: treesize reduction 76, result has 39.7 percent of original size [2025-04-13 20:02:43,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 101 [2025-04-13 20:02:46,788 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:02:46,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 591 treesize of output 1447 [2025-04-13 20:02:49,875 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:03:35,176 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:03:58,514 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:04:00,699 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:04:14,795 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:04:39,078 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:05:09,249 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:05:40,777 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:05:48,955 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:06:24,054 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:08:13,130 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:08:16,363 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:08:25,213 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:09:29,837 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:09:37,074 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 20:09:42,163 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 349 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 20:11:12,828 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:11:12,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 20:11:12,829 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:11:12,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:11:13,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:11:13,031 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2025-04-13 20:11:13,035 INFO L158 Benchmark]: Toolchain (without parser) took 552891.62ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 102.2MB in the beginning and 476.5MB in the end (delta: -374.3MB). Peak memory consumption was 541.6MB. Max. memory is 8.0GB. [2025-04-13 20:11:13,035 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 85.1MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:11:13,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.86ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 84.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:11:13,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.09ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 81.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:11:13,036 INFO L158 Benchmark]: Boogie Preprocessor took 48.65ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 77.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:11:13,036 INFO L158 Benchmark]: RCFGBuilder took 1194.05ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 89.1MB in the end (delta: -11.5MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. [2025-04-13 20:11:13,036 INFO L158 Benchmark]: TraceAbstraction took 551295.28ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 89.1MB in the beginning and 476.5MB in the end (delta: -387.4MB). Peak memory consumption was 527.9MB. Max. memory is 8.0GB. [2025-04-13 20:11:13,037 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.19ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 85.1MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.86ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 84.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.09ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 81.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 48.65ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 77.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1194.05ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 89.1MB in the end (delta: -11.5MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. * TraceAbstraction took 551295.28ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 89.1MB in the beginning and 476.5MB in the end (delta: -387.4MB). Peak memory consumption was 527.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...