/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:55:09,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:55:09,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:55:09,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:55:09,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:55:09,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:55:09,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:55:09,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:55:09,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:55:09,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:55:09,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:55:09,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:55:09,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:55:09,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:55:09,877 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:55:09,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:55:09,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:55:09,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:55:09,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:55:09,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:09,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:09,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:55:09,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:55:09,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:55:09,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:55:09,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:55:09,881 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:55:10,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:55:10,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:55:10,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:55:10,091 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:55:10,091 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:55:10,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2025-04-13 20:55:11,359 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f8c089b1/08affc7d3e134a6e88df923332574dc9/FLAGee4d2dc82 [2025-04-13 20:55:11,569 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:55:11,569 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2025-04-13 20:55:11,581 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f8c089b1/08affc7d3e134a6e88df923332574dc9/FLAGee4d2dc82 [2025-04-13 20:55:12,410 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f8c089b1/08affc7d3e134a6e88df923332574dc9 [2025-04-13 20:55:12,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:55:12,413 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:55:12,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:55:12,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:55:12,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:55:12,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23cf4973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12, skipping insertion in model container [2025-04-13 20:55:12,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:55:12,599 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-04-13 20:55:12,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:55:12,619 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:55:12,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-04-13 20:55:12,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:55:12,668 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:55:12,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12 WrapperNode [2025-04-13 20:55:12,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:55:12,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:55:12,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:55:12,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:55:12,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,703 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 134 [2025-04-13 20:55:12,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:55:12,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:55:12,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:55:12,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:55:12,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,726 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:55:12,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:55:12,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:55:12,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:55:12,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:55:12,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (1/1) ... [2025-04-13 20:55:12,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:55:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:12,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:55:12,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:55:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:55:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:55:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:55:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:55:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:55:12,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:55:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:55:12,789 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:55:12,859 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:55:12,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:55:13,020 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:55:13,021 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:55:13,021 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:55:13,197 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:55:13,209 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 20:55:13,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:55:13 BoogieIcfgContainer [2025-04-13 20:55:13,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:55:13,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:55:13,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:55:13,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:55:13,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:55:12" (1/3) ... [2025-04-13 20:55:13,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797235f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:55:13, skipping insertion in model container [2025-04-13 20:55:13,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:55:12" (2/3) ... [2025-04-13 20:55:13,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797235f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:55:13, skipping insertion in model container [2025-04-13 20:55:13,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:55:13" (3/3) ... [2025-04-13 20:55:13,217 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-04-13 20:55:13,227 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:55:13,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive-alt.wvr.c that has 3 procedures, 20 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:55:13,228 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:55:13,276 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:55:13,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 64 flow [2025-04-13 20:55:13,337 INFO L116 PetriNetUnfolderBase]: 6/23 cut-off events. [2025-04-13 20:55:13,340 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:55:13,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 6/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-13 20:55:13,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 25 transitions, 64 flow [2025-04-13 20:55:13,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 22 transitions, 56 flow [2025-04-13 20:55:13,349 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:55:13,356 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;@7135b58f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:55:13,356 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:55:13,362 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:55:13,362 INFO L116 PetriNetUnfolderBase]: 6/21 cut-off events. [2025-04-13 20:55:13,362 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:55:13,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:13,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:13,363 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:55:13,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1976276235, now seen corresponding path program 1 times [2025-04-13 20:55:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:13,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768971486] [2025-04-13 20:55:13,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:13,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:55:13,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:55:13,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:13,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:13,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:13,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768971486] [2025-04-13 20:55:13,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768971486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:13,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:13,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:55:13,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238580760] [2025-04-13 20:55:13,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:13,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:55:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:13,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:55:13,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:55:13,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:13,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:13,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:13,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:13,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:13,710 INFO L116 PetriNetUnfolderBase]: 142/230 cut-off events. [2025-04-13 20:55:13,710 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-13 20:55:13,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 230 events. 142/230 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 744 event pairs, 38 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 409. Up to 126 conditions per place. [2025-04-13 20:55:13,712 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 30 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2025-04-13 20:55:13,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 36 transitions, 163 flow [2025-04-13 20:55:13,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:55:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:55:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-13 20:55:13,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2025-04-13 20:55:13,724 INFO L175 Difference]: Start difference. First operand has 23 places, 22 transitions, 56 flow. Second operand 3 states and 47 transitions. [2025-04-13 20:55:13,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 36 transitions, 163 flow [2025-04-13 20:55:13,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 36 transitions, 149 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:55:13,730 INFO L231 Difference]: Finished difference. Result has 22 places, 22 transitions, 58 flow [2025-04-13 20:55:13,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=22, PETRI_TRANSITIONS=22} [2025-04-13 20:55:13,735 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2025-04-13 20:55:13,735 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 22 transitions, 58 flow [2025-04-13 20:55:13,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:13,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:13,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:13,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:55:13,736 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:55:13,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1190282967, now seen corresponding path program 1 times [2025-04-13 20:55:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:13,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885908379] [2025-04-13 20:55:13,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:13,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:55:13,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:55:13,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:13,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:13,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:13,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885908379] [2025-04-13 20:55:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885908379] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:13,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:55:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606261344] [2025-04-13 20:55:13,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:13,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:55:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:13,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:55:13,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:55:13,868 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:13,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 22 transitions, 58 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:55:13,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:13,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:13,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:13,940 INFO L116 PetriNetUnfolderBase]: 124/214 cut-off events. [2025-04-13 20:55:13,940 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-13 20:55:13,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 214 events. 124/214 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 725 event pairs, 43 based on Foata normal form. 8/162 useless extension candidates. Maximal degree in co-relation 259. Up to 161 conditions per place. [2025-04-13 20:55:13,942 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 21 selfloop transitions, 2 changer transitions 4/28 dead transitions. [2025-04-13 20:55:13,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 126 flow [2025-04-13 20:55:13,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:55:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:55:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-13 20:55:13,943 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-04-13 20:55:13,943 INFO L175 Difference]: Start difference. First operand has 22 places, 22 transitions, 58 flow. Second operand 3 states and 36 transitions. [2025-04-13 20:55:13,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 28 transitions, 126 flow [2025-04-13 20:55:13,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:55:13,944 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 66 flow [2025-04-13 20:55:13,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2025-04-13 20:55:13,945 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places. [2025-04-13 20:55:13,945 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 66 flow [2025-04-13 20:55:13,945 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:55:13,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:13,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:13,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:55:13,945 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:55:13,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:13,946 INFO L85 PathProgramCache]: Analyzing trace with hash 220874481, now seen corresponding path program 1 times [2025-04-13 20:55:13,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:13,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839806135] [2025-04-13 20:55:13,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:13,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:55:13,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:55:13,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:13,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:14,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:14,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839806135] [2025-04-13 20:55:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839806135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:14,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:14,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:55:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2910624] [2025-04-13 20:55:14,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:14,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:55:14,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:14,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:55:14,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:55:14,132 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:14,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:14,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:14,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:14,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:14,211 INFO L116 PetriNetUnfolderBase]: 122/220 cut-off events. [2025-04-13 20:55:14,211 INFO L117 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-04-13 20:55:14,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 220 events. 122/220 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 85 based on Foata normal form. 7/171 useless extension candidates. Maximal degree in co-relation 295. Up to 198 conditions per place. [2025-04-13 20:55:14,212 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 20 selfloop transitions, 2 changer transitions 8/31 dead transitions. [2025-04-13 20:55:14,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 147 flow [2025-04-13 20:55:14,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:55:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:55:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-13 20:55:14,214 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41 [2025-04-13 20:55:14,214 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 66 flow. Second operand 4 states and 41 transitions. [2025-04-13 20:55:14,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 147 flow [2025-04-13 20:55:14,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:55:14,215 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 78 flow [2025-04-13 20:55:14,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2025-04-13 20:55:14,216 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2025-04-13 20:55:14,216 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 78 flow [2025-04-13 20:55:14,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:14,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:14,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:14,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:55:14,216 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:55:14,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1258336729, now seen corresponding path program 1 times [2025-04-13 20:55:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:14,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191916605] [2025-04-13 20:55:14,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:14,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:14,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:55:14,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:55:14,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:14,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:14,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:14,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191916605] [2025-04-13 20:55:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191916605] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:14,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378403207] [2025-04-13 20:55:14,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:14,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:14,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:14,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:55:14,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:55:14,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:55:14,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:55:14,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:14,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:14,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:55:14,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:14,863 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:55:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:14,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:15,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-04-13 20:55:15,268 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:55:15,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-04-13 20:55:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378403207] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:15,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:15,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 20:55:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123025815] [2025-04-13 20:55:15,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:15,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:55:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:15,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:55:15,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:55:15,377 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:15,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 78 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:15,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:15,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:15,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:16,041 INFO L116 PetriNetUnfolderBase]: 508/864 cut-off events. [2025-04-13 20:55:16,041 INFO L117 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-04-13 20:55:16,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1985 conditions, 864 events. 508/864 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4121 event pairs, 64 based on Foata normal form. 3/641 useless extension candidates. Maximal degree in co-relation 1969. Up to 188 conditions per place. [2025-04-13 20:55:16,045 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 89 selfloop transitions, 26 changer transitions 30/146 dead transitions. [2025-04-13 20:55:16,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 146 transitions, 700 flow [2025-04-13 20:55:16,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:55:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:55:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 200 transitions. [2025-04-13 20:55:16,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-13 20:55:16,050 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 78 flow. Second operand 18 states and 200 transitions. [2025-04-13 20:55:16,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 146 transitions, 700 flow [2025-04-13 20:55:16,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 146 transitions, 688 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:16,055 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 262 flow [2025-04-13 20:55:16,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=262, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-04-13 20:55:16,056 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 24 predicate places. [2025-04-13 20:55:16,056 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 262 flow [2025-04-13 20:55:16,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:16,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:16,056 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:16,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:55:16,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:16,261 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:55:16,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1485529555, now seen corresponding path program 2 times [2025-04-13 20:55:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:16,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893270734] [2025-04-13 20:55:16,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:55:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:16,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:55:16,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:55:16,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:55:16,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:55:16,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:16,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893270734] [2025-04-13 20:55:16,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893270734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:16,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:55:16,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505096056] [2025-04-13 20:55:16,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:16,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:55:16,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:16,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:55:16,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:55:16,325 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:16,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:16,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:16,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:16,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:16,502 INFO L116 PetriNetUnfolderBase]: 907/1526 cut-off events. [2025-04-13 20:55:16,503 INFO L117 PetriNetUnfolderBase]: For 1668/1668 co-relation queries the response was YES. [2025-04-13 20:55:16,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 1526 events. 907/1526 cut-off events. For 1668/1668 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8242 event pairs, 197 based on Foata normal form. 24/1127 useless extension candidates. Maximal degree in co-relation 3438. Up to 771 conditions per place. [2025-04-13 20:55:16,510 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 59 selfloop transitions, 18 changer transitions 0/78 dead transitions. [2025-04-13 20:55:16,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 573 flow [2025-04-13 20:55:16,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:55:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:55:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-13 20:55:16,511 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-04-13 20:55:16,511 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 262 flow. Second operand 4 states and 55 transitions. [2025-04-13 20:55:16,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 573 flow [2025-04-13 20:55:16,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 529 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-04-13 20:55:16,523 INFO L231 Difference]: Finished difference. Result has 50 places, 60 transitions, 415 flow [2025-04-13 20:55:16,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=50, PETRI_TRANSITIONS=60} [2025-04-13 20:55:16,524 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 27 predicate places. [2025-04-13 20:55:16,524 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 60 transitions, 415 flow [2025-04-13 20:55:16,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:16,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:16,524 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:16,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:55:16,525 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:55:16,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1885324949, now seen corresponding path program 3 times [2025-04-13 20:55:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:16,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781731855] [2025-04-13 20:55:16,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:55:16,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:16,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:55:16,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 20 statements. [2025-04-13 20:55:16,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:55:16,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 20:55:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:16,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781731855] [2025-04-13 20:55:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781731855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:16,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:16,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:55:16,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460689382] [2025-04-13 20:55:16,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:16,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:55:16,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:16,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:55:16,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:55:16,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:16,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 60 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:16,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:16,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:16,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:16,854 INFO L116 PetriNetUnfolderBase]: 1040/1746 cut-off events. [2025-04-13 20:55:16,854 INFO L117 PetriNetUnfolderBase]: For 3477/3477 co-relation queries the response was YES. [2025-04-13 20:55:16,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5489 conditions, 1746 events. 1040/1746 cut-off events. For 3477/3477 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9191 event pairs, 136 based on Foata normal form. 3/1261 useless extension candidates. Maximal degree in co-relation 4072. Up to 736 conditions per place. [2025-04-13 20:55:16,864 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 64 selfloop transitions, 19 changer transitions 8/92 dead transitions. [2025-04-13 20:55:16,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 770 flow [2025-04-13 20:55:16,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:55:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:55:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-04-13 20:55:16,867 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.496 [2025-04-13 20:55:16,867 INFO L175 Difference]: Start difference. First operand has 50 places, 60 transitions, 415 flow. Second operand 5 states and 62 transitions. [2025-04-13 20:55:16,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 770 flow [2025-04-13 20:55:16,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 736 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-04-13 20:55:16,877 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 477 flow [2025-04-13 20:55:16,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=477, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2025-04-13 20:55:16,879 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 32 predicate places. [2025-04-13 20:55:16,879 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 477 flow [2025-04-13 20:55:16,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:16,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:16,879 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:16,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:55:16,880 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:55:16,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1708386773, now seen corresponding path program 1 times [2025-04-13 20:55:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:16,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387374749] [2025-04-13 20:55:16,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:16,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:55:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:55:16,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:16,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:17,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:17,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387374749] [2025-04-13 20:55:17,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387374749] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:17,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008611560] [2025-04-13 20:55:17,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:17,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:17,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:17,025 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:55:17,026 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:55:17,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:55:17,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:55:17,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:17,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:17,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:55:17,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:17,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:55:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008611560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:17,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:17,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 20:55:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090278666] [2025-04-13 20:55:17,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:17,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:55:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:17,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:55:17,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:55:17,191 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:17,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 477 flow. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:17,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:17,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:17,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:17,340 INFO L116 PetriNetUnfolderBase]: 694/1197 cut-off events. [2025-04-13 20:55:17,340 INFO L117 PetriNetUnfolderBase]: For 2612/2612 co-relation queries the response was YES. [2025-04-13 20:55:17,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 1197 events. 694/1197 cut-off events. For 2612/2612 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6053 event pairs, 477 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 3739. Up to 1098 conditions per place. [2025-04-13 20:55:17,346 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 40 selfloop transitions, 3 changer transitions 21/65 dead transitions. [2025-04-13 20:55:17,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 520 flow [2025-04-13 20:55:17,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:55:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:55:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-13 20:55:17,346 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2025-04-13 20:55:17,347 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 477 flow. Second operand 7 states and 65 transitions. [2025-04-13 20:55:17,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 520 flow [2025-04-13 20:55:17,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 472 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-04-13 20:55:17,351 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 282 flow [2025-04-13 20:55:17,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2025-04-13 20:55:17,351 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 30 predicate places. [2025-04-13 20:55:17,352 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 282 flow [2025-04-13 20:55:17,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:17,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:17,352 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:17,357 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:55:17,552 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:55:17,553 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:55:17,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:17,553 INFO L85 PathProgramCache]: Analyzing trace with hash -578215755, now seen corresponding path program 2 times [2025-04-13 20:55:17,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:17,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114520127] [2025-04-13 20:55:17,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:55:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:17,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:55:17,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:55:17,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:55:17,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:18,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:18,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114520127] [2025-04-13 20:55:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114520127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:18,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190050738] [2025-04-13 20:55:18,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:55:18,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:18,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:18,147 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:55:18,148 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:55:18,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:55:18,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:55:18,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:55:18,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:18,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 20:55:18,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:18,259 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:55:18,517 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 20:55:18,517 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-04-13 20:55:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:18,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:19,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2025-04-13 20:55:19,250 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:55:19,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 241 treesize of output 258 [2025-04-13 20:55:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:35,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190050738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:35,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2025-04-13 20:55:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058509794] [2025-04-13 20:55:35,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:35,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:55:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:35,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:55:35,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:55:35,505 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:35,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 282 flow. Second operand has 27 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:35,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:35,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:35,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:37,798 INFO L116 PetriNetUnfolderBase]: 1763/2913 cut-off events. [2025-04-13 20:55:37,798 INFO L117 PetriNetUnfolderBase]: For 4235/4235 co-relation queries the response was YES. [2025-04-13 20:55:37,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8703 conditions, 2913 events. 1763/2913 cut-off events. For 4235/4235 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16165 event pairs, 268 based on Foata normal form. 7/2345 useless extension candidates. Maximal degree in co-relation 8678. Up to 776 conditions per place. [2025-04-13 20:55:37,811 INFO L140 encePairwiseOnDemand]: 15/25 looper letters, 153 selfloop transitions, 60 changer transitions 56/270 dead transitions. [2025-04-13 20:55:37,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 270 transitions, 1767 flow [2025-04-13 20:55:37,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 20:55:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 20:55:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 327 transitions. [2025-04-13 20:55:37,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5030769230769231 [2025-04-13 20:55:37,815 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 282 flow. Second operand 26 states and 327 transitions. [2025-04-13 20:55:37,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 270 transitions, 1767 flow [2025-04-13 20:55:37,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 270 transitions, 1679 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-04-13 20:55:37,824 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 972 flow [2025-04-13 20:55:37,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=972, PETRI_PLACES=81, PETRI_TRANSITIONS=99} [2025-04-13 20:55:37,825 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 58 predicate places. [2025-04-13 20:55:37,825 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 972 flow [2025-04-13 20:55:37,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:37,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:37,825 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:37,832 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:55:38,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:38,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:55:38,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 49730421, now seen corresponding path program 3 times [2025-04-13 20:55:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:38,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040752740] [2025-04-13 20:55:38,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:55:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:38,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 20:55:38,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:55:38,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:55:38,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:38,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:38,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040752740] [2025-04-13 20:55:38,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040752740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:38,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520207203] [2025-04-13 20:55:38,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:55:38,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:38,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:38,645 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:55:38,647 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:55:38,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 20:55:38,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:55:38,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:55:38,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:38,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 20:55:38,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:38,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:39,114 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:55:39,115 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 75 treesize of output 60 [2025-04-13 20:55:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520207203] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:39,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2025-04-13 20:55:39,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221765873] [2025-04-13 20:55:39,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:39,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:55:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:39,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:55:39,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:55:39,346 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:39,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 99 transitions, 972 flow. Second operand has 31 states, 31 states have (on average 4.903225806451613) internal successors, (152), 31 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:39,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:39,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:39,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:45,575 INFO L116 PetriNetUnfolderBase]: 9886/16125 cut-off events. [2025-04-13 20:55:45,575 INFO L117 PetriNetUnfolderBase]: For 78788/78788 co-relation queries the response was YES. [2025-04-13 20:55:45,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59728 conditions, 16125 events. 9886/16125 cut-off events. For 78788/78788 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 113022 event pairs, 600 based on Foata normal form. 52/12940 useless extension candidates. Maximal degree in co-relation 48792. Up to 3057 conditions per place. [2025-04-13 20:55:45,629 INFO L140 encePairwiseOnDemand]: 15/25 looper letters, 287 selfloop transitions, 440 changer transitions 447/1175 dead transitions. [2025-04-13 20:55:45,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 1175 transitions, 11695 flow [2025-04-13 20:55:45,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 20:55:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2025-04-13 20:55:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 964 transitions. [2025-04-13 20:55:45,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4760493827160494 [2025-04-13 20:55:45,633 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 972 flow. Second operand 81 states and 964 transitions. [2025-04-13 20:55:45,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 1175 transitions, 11695 flow [2025-04-13 20:55:45,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 1175 transitions, 10412 flow, removed 636 selfloop flow, removed 4 redundant places. [2025-04-13 20:55:45,780 INFO L231 Difference]: Finished difference. Result has 182 places, 516 transitions, 6006 flow [2025-04-13 20:55:45,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=6006, PETRI_PLACES=182, PETRI_TRANSITIONS=516} [2025-04-13 20:55:45,781 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 159 predicate places. [2025-04-13 20:55:45,781 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 516 transitions, 6006 flow [2025-04-13 20:55:45,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.903225806451613) internal successors, (152), 31 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:45,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:45,781 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:45,786 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:55:45,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:45,985 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:55:45,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1425752213, now seen corresponding path program 1 times [2025-04-13 20:55:45,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:45,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112621210] [2025-04-13 20:55:45,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:45,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:45,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:55:45,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:55:45,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:45,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:55:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:46,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112621210] [2025-04-13 20:55:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112621210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:55:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:55:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:55:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512761578] [2025-04-13 20:55:46,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:55:46,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:55:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:46,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:55:46,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:55:46,067 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:46,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 516 transitions, 6006 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:46,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:46,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:46,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:46,983 INFO L116 PetriNetUnfolderBase]: 5747/9274 cut-off events. [2025-04-13 20:55:46,983 INFO L117 PetriNetUnfolderBase]: For 49738/49738 co-relation queries the response was YES. [2025-04-13 20:55:47,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36937 conditions, 9274 events. 5747/9274 cut-off events. For 49738/49738 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 57823 event pairs, 2104 based on Foata normal form. 7/7633 useless extension candidates. Maximal degree in co-relation 36309. Up to 6312 conditions per place. [2025-04-13 20:55:47,027 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 478 selfloop transitions, 53 changer transitions 5/537 dead transitions. [2025-04-13 20:55:47,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 537 transitions, 7417 flow [2025-04-13 20:55:47,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:55:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:55:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-13 20:55:47,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-04-13 20:55:47,028 INFO L175 Difference]: Start difference. First operand has 182 places, 516 transitions, 6006 flow. Second operand 3 states and 36 transitions. [2025-04-13 20:55:47,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 537 transitions, 7417 flow [2025-04-13 20:55:47,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 537 transitions, 5411 flow, removed 975 selfloop flow, removed 25 redundant places. [2025-04-13 20:55:47,564 INFO L231 Difference]: Finished difference. Result has 131 places, 402 transitions, 3251 flow [2025-04-13 20:55:47,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3025, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3251, PETRI_PLACES=131, PETRI_TRANSITIONS=402} [2025-04-13 20:55:47,565 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 108 predicate places. [2025-04-13 20:55:47,565 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 402 transitions, 3251 flow [2025-04-13 20:55:47,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:47,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:47,565 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:47,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:55:47,566 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:55:47,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash 97347435, now seen corresponding path program 4 times [2025-04-13 20:55:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:47,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563015676] [2025-04-13 20:55:47,566 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:55:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:47,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:55:47,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:55:47,579 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:55:47,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:55:47,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:47,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563015676] [2025-04-13 20:55:47,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563015676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:47,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660523199] [2025-04-13 20:55:47,741 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:55:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:47,743 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:55:47,744 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:55:47,787 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:55:47,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:55:47,805 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:55:47,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:47,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:55:47,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:55:47,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:47,979 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:55:47,980 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 75 treesize of output 60 [2025-04-13 20:55:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:55:48,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660523199] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:48,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:48,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 16 [2025-04-13 20:55:48,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319151253] [2025-04-13 20:55:48,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:48,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:55:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:48,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:55:48,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:55:48,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:48,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 402 transitions, 3251 flow. Second operand has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:48,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:48,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:48,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:49,174 INFO L116 PetriNetUnfolderBase]: 6229/10022 cut-off events. [2025-04-13 20:55:49,174 INFO L117 PetriNetUnfolderBase]: For 17462/17462 co-relation queries the response was YES. [2025-04-13 20:55:49,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34787 conditions, 10022 events. 6229/10022 cut-off events. For 17462/17462 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 61384 event pairs, 1423 based on Foata normal form. 1/8980 useless extension candidates. Maximal degree in co-relation 34040. Up to 5848 conditions per place. [2025-04-13 20:55:49,223 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 458 selfloop transitions, 81 changer transitions 25/565 dead transitions. [2025-04-13 20:55:49,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 565 transitions, 5323 flow [2025-04-13 20:55:49,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:55:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:55:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2025-04-13 20:55:49,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-04-13 20:55:49,224 INFO L175 Difference]: Start difference. First operand has 131 places, 402 transitions, 3251 flow. Second operand 12 states and 135 transitions. [2025-04-13 20:55:49,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 565 transitions, 5323 flow [2025-04-13 20:55:49,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 565 transitions, 5216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:55:49,373 INFO L231 Difference]: Finished difference. Result has 141 places, 416 transitions, 3586 flow [2025-04-13 20:55:49,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3198, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3586, PETRI_PLACES=141, PETRI_TRANSITIONS=416} [2025-04-13 20:55:49,374 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 118 predicate places. [2025-04-13 20:55:49,374 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 416 transitions, 3586 flow [2025-04-13 20:55:49,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:49,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:49,374 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:49,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:55:49,575 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,SelfDestructingSolverStorable10 [2025-04-13 20:55:49,575 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:55:49,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash -73746393, now seen corresponding path program 5 times [2025-04-13 20:55:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:49,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283865758] [2025-04-13 20:55:49,576 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:55:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:49,582 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-04-13 20:55:49,608 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:55:49,608 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:55:49,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:50,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:50,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283865758] [2025-04-13 20:55:50,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283865758] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:50,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306242223] [2025-04-13 20:55:50,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:55:50,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:50,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:50,097 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:55:50,099 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:55:50,140 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-04-13 20:55:50,158 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:55:50,159 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:55:50,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:50,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:55:50,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:55:50,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:50,414 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:55:50,414 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 75 treesize of output 60 [2025-04-13 20:55:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:55:50,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306242223] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:50,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:50,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 5] total 22 [2025-04-13 20:55:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509406147] [2025-04-13 20:55:50,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:50,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:55:50,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:50,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:55:50,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:55:50,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:50,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 416 transitions, 3586 flow. Second operand has 24 states, 24 states have (on average 5.5) internal successors, (132), 24 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:50,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:50,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:50,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:51,580 INFO L116 PetriNetUnfolderBase]: 6900/11098 cut-off events. [2025-04-13 20:55:51,581 INFO L117 PetriNetUnfolderBase]: For 21735/21735 co-relation queries the response was YES. [2025-04-13 20:55:51,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38549 conditions, 11098 events. 6900/11098 cut-off events. For 21735/21735 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 69597 event pairs, 1569 based on Foata normal form. 3/9470 useless extension candidates. Maximal degree in co-relation 37811. Up to 7039 conditions per place. [2025-04-13 20:55:51,633 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 459 selfloop transitions, 83 changer transitions 31/574 dead transitions. [2025-04-13 20:55:51,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 574 transitions, 5684 flow [2025-04-13 20:55:51,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:55:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:55:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 173 transitions. [2025-04-13 20:55:51,635 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4325 [2025-04-13 20:55:51,635 INFO L175 Difference]: Start difference. First operand has 141 places, 416 transitions, 3586 flow. Second operand 16 states and 173 transitions. [2025-04-13 20:55:51,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 574 transitions, 5684 flow [2025-04-13 20:55:51,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 574 transitions, 5492 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-04-13 20:55:51,791 INFO L231 Difference]: Finished difference. Result has 154 places, 438 transitions, 3957 flow [2025-04-13 20:55:51,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3421, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3957, PETRI_PLACES=154, PETRI_TRANSITIONS=438} [2025-04-13 20:55:51,792 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 131 predicate places. [2025-04-13 20:55:51,792 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 438 transitions, 3957 flow [2025-04-13 20:55:51,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 24 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:51,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:51,792 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:51,799 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:55:51,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:51,993 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:55:51,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash -979432115, now seen corresponding path program 6 times [2025-04-13 20:55:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:51,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299979788] [2025-04-13 20:55:51,993 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:55:51,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:52,001 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 20:55:52,013 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:55:52,013 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:55:52,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:55:52,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:52,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299979788] [2025-04-13 20:55:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299979788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:52,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247963279] [2025-04-13 20:55:52,058 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:55:52,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:52,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:52,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:55:52,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:55:52,111 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 20:55:52,128 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:55:52,128 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:55:52,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:52,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:55:52,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:55:52,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:55:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247963279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:52,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:52,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-04-13 20:55:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150757893] [2025-04-13 20:55:52,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:52,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:55:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:52,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:55:52,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:55:52,232 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:52,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 438 transitions, 3957 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:52,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:52,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:52,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:55:53,867 INFO L116 PetriNetUnfolderBase]: 12448/20183 cut-off events. [2025-04-13 20:55:53,868 INFO L117 PetriNetUnfolderBase]: For 40650/40650 co-relation queries the response was YES. [2025-04-13 20:55:53,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69165 conditions, 20183 events. 12448/20183 cut-off events. For 40650/40650 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 140157 event pairs, 2031 based on Foata normal form. 170/17325 useless extension candidates. Maximal degree in co-relation 66835. Up to 10171 conditions per place. [2025-04-13 20:55:53,958 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 542 selfloop transitions, 335 changer transitions 0/878 dead transitions. [2025-04-13 20:55:53,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 878 transitions, 9166 flow [2025-04-13 20:55:53,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:55:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:55:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-13 20:55:53,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-04-13 20:55:53,959 INFO L175 Difference]: Start difference. First operand has 154 places, 438 transitions, 3957 flow. Second operand 5 states and 70 transitions. [2025-04-13 20:55:53,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 878 transitions, 9166 flow [2025-04-13 20:55:54,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 878 transitions, 9027 flow, removed 26 selfloop flow, removed 8 redundant places. [2025-04-13 20:55:54,341 INFO L231 Difference]: Finished difference. Result has 153 places, 736 transitions, 8086 flow [2025-04-13 20:55:54,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3868, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8086, PETRI_PLACES=153, PETRI_TRANSITIONS=736} [2025-04-13 20:55:54,342 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 130 predicate places. [2025-04-13 20:55:54,342 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 736 transitions, 8086 flow [2025-04-13 20:55:54,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:54,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:55:54,342 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:55:54,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:55:54,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:54,543 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:55:54,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:55:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1368102507, now seen corresponding path program 1 times [2025-04-13 20:55:54,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:55:54,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352183390] [2025-04-13 20:55:54,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:55:54,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:55:54,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:55:54,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:54,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:55,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:55:55,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352183390] [2025-04-13 20:55:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352183390] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:55:55,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764109098] [2025-04-13 20:55:55,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:55:55,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:55:55,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:55:55,222 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:55:55,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:55:55,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:55:55,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:55:55,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:55:55,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:55:55,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 20:55:55,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:55:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:55,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:55:55,930 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:55:55,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-13 20:55:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:55:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764109098] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:55:56,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:55:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2025-04-13 20:55:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322980417] [2025-04-13 20:55:56,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:55:56,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:55:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:55:56,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:55:56,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1245, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:55:56,226 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:55:56,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 736 transitions, 8086 flow. Second operand has 39 states, 39 states have (on average 4.897435897435898) internal successors, (191), 39 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:55:56,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:55:56,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:55:56,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:08,265 INFO L116 PetriNetUnfolderBase]: 27962/46210 cut-off events. [2025-04-13 20:56:08,265 INFO L117 PetriNetUnfolderBase]: For 154260/154260 co-relation queries the response was YES. [2025-04-13 20:56:08,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170615 conditions, 46210 events. 27962/46210 cut-off events. For 154260/154260 co-relation queries the response was YES. Maximal size of possible extension queue 1769. Compared 377419 event pairs, 4899 based on Foata normal form. 247/39595 useless extension candidates. Maximal degree in co-relation 167277. Up to 17237 conditions per place. [2025-04-13 20:56:08,576 INFO L140 encePairwiseOnDemand]: 15/25 looper letters, 1211 selfloop transitions, 1138 changer transitions 393/2743 dead transitions. [2025-04-13 20:56:08,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 2743 transitions, 30411 flow [2025-04-13 20:56:08,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-04-13 20:56:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2025-04-13 20:56:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 1184 transitions. [2025-04-13 20:56:08,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45980582524271846 [2025-04-13 20:56:08,579 INFO L175 Difference]: Start difference. First operand has 153 places, 736 transitions, 8086 flow. Second operand 103 states and 1184 transitions. [2025-04-13 20:56:08,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 2743 transitions, 30411 flow [2025-04-13 20:56:09,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 2743 transitions, 29898 flow, removed 223 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:09,892 INFO L231 Difference]: Finished difference. Result has 321 places, 1813 transitions, 24095 flow [2025-04-13 20:56:09,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=8013, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=24095, PETRI_PLACES=321, PETRI_TRANSITIONS=1813} [2025-04-13 20:56:09,893 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 298 predicate places. [2025-04-13 20:56:09,893 INFO L485 AbstractCegarLoop]: Abstraction has has 321 places, 1813 transitions, 24095 flow [2025-04-13 20:56:09,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.897435897435898) internal successors, (191), 39 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:56:09,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:09,893 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:09,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 20:56:10,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:56:10,094 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:56:10,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1498632661, now seen corresponding path program 2 times [2025-04-13 20:56:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:10,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8146896] [2025-04-13 20:56:10,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:56:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:10,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:56:10,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:56:10,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:56:10,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:56:10,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:10,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8146896] [2025-04-13 20:56:10,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8146896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:10,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081019784] [2025-04-13 20:56:10,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:56:10,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:10,876 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:56:10,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:56:10,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:56:10,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:56:10,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:56:10,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:10,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:56:10,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:11,018 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:56:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:56:11,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:11,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 153 [2025-04-13 20:56:11,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:56:11,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 546 treesize of output 450 [2025-04-13 20:56:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:56:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081019784] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:56:14,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:56:14,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-13 20:56:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322189250] [2025-04-13 20:56:14,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:56:14,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:56:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:14,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:56:14,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:56:14,086 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:56:14,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 1813 transitions, 24095 flow. Second operand has 38 states, 38 states have (on average 4.947368421052632) internal successors, (188), 38 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:56:14,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:14,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:56:14,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:42,541 INFO L116 PetriNetUnfolderBase]: 57113/93874 cut-off events. [2025-04-13 20:56:42,542 INFO L117 PetriNetUnfolderBase]: For 761867/761867 co-relation queries the response was YES. [2025-04-13 20:56:44,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415860 conditions, 93874 events. 57113/93874 cut-off events. For 761867/761867 co-relation queries the response was YES. Maximal size of possible extension queue 3234. Compared 828367 event pairs, 15393 based on Foata normal form. 510/80753 useless extension candidates. Maximal degree in co-relation 415517. Up to 24137 conditions per place. [2025-04-13 20:56:44,234 INFO L140 encePairwiseOnDemand]: 15/25 looper letters, 2907 selfloop transitions, 1918 changer transitions 251/5077 dead transitions. [2025-04-13 20:56:44,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 5077 transitions, 69839 flow [2025-04-13 20:56:44,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-04-13 20:56:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2025-04-13 20:56:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 1038 transitions. [2025-04-13 20:56:44,410 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4772413793103448 [2025-04-13 20:56:44,410 INFO L175 Difference]: Start difference. First operand has 321 places, 1813 transitions, 24095 flow. Second operand 87 states and 1038 transitions. [2025-04-13 20:56:44,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 5077 transitions, 69839 flow [2025-04-13 20:57:07,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 5077 transitions, 67069 flow, removed 1286 selfloop flow, removed 27 redundant places. [2025-04-13 20:57:07,642 INFO L231 Difference]: Finished difference. Result has 421 places, 3255 transitions, 50559 flow [2025-04-13 20:57:07,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=22997, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=630, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=765, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=50559, PETRI_PLACES=421, PETRI_TRANSITIONS=3255} [2025-04-13 20:57:07,644 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 398 predicate places. [2025-04-13 20:57:07,644 INFO L485 AbstractCegarLoop]: Abstraction has has 421 places, 3255 transitions, 50559 flow [2025-04-13 20:57:07,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.947368421052632) internal successors, (188), 38 states have internal predecessors, (188), 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:57:07,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:07,644 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:07,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:57:07,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:57:07,845 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:57:07,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1128465995, now seen corresponding path program 7 times [2025-04-13 20:57:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:07,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722521700] [2025-04-13 20:57:07,846 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:57:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:07,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:57:07,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:57:07,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:57:07,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 20:57:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:07,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722521700] [2025-04-13 20:57:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722521700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:57:07,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:57:07,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:57:07,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111340908] [2025-04-13 20:57:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:57:07,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:57:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:57:07,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:57:07,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:57:07,899 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2025-04-13 20:57:07,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 3255 transitions, 50559 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:57:07,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:57:07,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2025-04-13 20:57:07,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:57:25,352 INFO L116 PetriNetUnfolderBase]: 21593/37238 cut-off events. [2025-04-13 20:57:25,352 INFO L117 PetriNetUnfolderBase]: For 435317/435317 co-relation queries the response was YES. [2025-04-13 20:57:25,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181953 conditions, 37238 events. 21593/37238 cut-off events. For 435317/435317 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 305759 event pairs, 8725 based on Foata normal form. 910/33873 useless extension candidates. Maximal degree in co-relation 181796. Up to 24415 conditions per place. [2025-04-13 20:57:25,916 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 1828 selfloop transitions, 124 changer transitions 56/2009 dead transitions. [2025-04-13 20:57:25,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 2009 transitions, 36433 flow [2025-04-13 20:57:25,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:57:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:57:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-13 20:57:25,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:57:25,917 INFO L175 Difference]: Start difference. First operand has 421 places, 3255 transitions, 50559 flow. Second operand 3 states and 35 transitions. [2025-04-13 20:57:25,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 2009 transitions, 36433 flow [2025-04-13 20:57:31,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 2009 transitions, 32195 flow, removed 1676 selfloop flow, removed 70 redundant places. [2025-04-13 20:57:31,213 INFO L231 Difference]: Finished difference. Result has 305 places, 1461 transitions, 20052 flow [2025-04-13 20:57:31,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=19894, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20052, PETRI_PLACES=305, PETRI_TRANSITIONS=1461} [2025-04-13 20:57:31,214 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 282 predicate places. [2025-04-13 20:57:31,214 INFO L485 AbstractCegarLoop]: Abstraction has has 305 places, 1461 transitions, 20052 flow [2025-04-13 20:57:31,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:57:31,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:57:31,214 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:57:31,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:57:31,215 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:57:31,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:57:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash 672724139, now seen corresponding path program 3 times [2025-04-13 20:57:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:57:31,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639184530] [2025-04-13 20:57:31,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:57:31,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:57:31,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 20:57:31,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:57:31,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:57:31,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:57:31,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:57:31,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639184530] [2025-04-13 20:57:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639184530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:57:31,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165626026] [2025-04-13 20:57:31,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:57:31,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:57:31,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:57:31,676 INFO L229 MonitoredProcess]: Starting monitored process 11 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:57:31,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:57:31,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 20:57:31,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:57:31,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:57:31,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:57:31,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:57:31,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:57:31,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 20:57:32,327 INFO L325 Elim1Store]: treesize reduction 111, result has 8.3 percent of original size [2025-04-13 20:57:32,328 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 27 [2025-04-13 20:57:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:57:32,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:57:34,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 248 [2025-04-13 20:57:34,574 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:57:34,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 602 treesize of output 788 [2025-04-13 20:57:38,961 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:57:54,614 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:57:59,850 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 20:58:25,136 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:58:33,056 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:58:40,204 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:58:42,573 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:58:47,655 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:58:53,454 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:58:56,170 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:59:04,900 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:59:09,666 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:59:13,972 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:59:29,316 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:59:36,541 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:59:43,945 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:00:02,580 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:00:13,998 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 21:00:25,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 21:00:25,257 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 21:00:25,258 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 21:00:25,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 21:00:25,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 21:00:25,460 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.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) 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) ... 69 more [2025-04-13 21:00:25,463 INFO L158 Benchmark]: Toolchain (without parser) took 313049.75ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 100.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2025-04-13 21:00:25,463 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:25,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.93ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 85.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:00:25,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.18ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 83.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:00:25,465 INFO L158 Benchmark]: Boogie Preprocessor took 37.75ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 81.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:25,465 INFO L158 Benchmark]: RCFGBuilder took 468.06ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 34.5MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 21:00:25,466 INFO L158 Benchmark]: TraceAbstraction took 312251.03ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 33.6MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2025-04-13 21:00:25,467 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.93ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 85.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.18ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 83.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.75ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 81.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 468.06ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 34.5MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 312251.03ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 33.6MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 4.4GB. 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...