/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/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:15:36,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:15:36,230 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:15:36,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:15:36,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:15:36,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:15:36,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:15:36,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:15:36,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:15:36,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:15:36,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:15:36,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:15:36,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:15:36,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:15:36,260 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:15:36,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:15:36,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:15:36,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:15:36,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:15:36,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:15:36,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:15:36,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:15:36,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:15:36,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:15:36,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:15:36,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:15:36,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:15:36,263 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:15:36,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:15:36,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:15:36,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:15:36,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:15:36,509 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:15:36,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2025-04-13 20:15:37,851 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46aeb7bd/4f721dd3f38c4195bbfa6a201956fd3d/FLAG08a5828d9 [2025-04-13 20:15:38,016 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:15:38,017 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2025-04-13 20:15:38,022 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46aeb7bd/4f721dd3f38c4195bbfa6a201956fd3d/FLAG08a5828d9 [2025-04-13 20:15:38,853 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46aeb7bd/4f721dd3f38c4195bbfa6a201956fd3d [2025-04-13 20:15:38,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:15:38,855 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:15:38,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:15:38,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:15:38,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:15:38,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:15:38" (1/1) ... [2025-04-13 20:15:38,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3342287f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:38, skipping insertion in model container [2025-04-13 20:15:38,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:15:38" (1/1) ... [2025-04-13 20:15:38,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:15:39,020 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/parallel-misc-1.wvr.c[2781,2794] [2025-04-13 20:15:39,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:15:39,037 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:15:39,057 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/parallel-misc-1.wvr.c[2781,2794] [2025-04-13 20:15:39,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:15:39,072 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:15:39,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39 WrapperNode [2025-04-13 20:15:39,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:15:39,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:15:39,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:15:39,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:15:39,079 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:15:39" (1/1) ... [2025-04-13 20:15:39,086 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:15:39" (1/1) ... [2025-04-13 20:15:39,106 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 268 [2025-04-13 20:15:39,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:15:39,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:15:39,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:15:39,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:15:39,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,142 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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:15:39,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:15:39,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:15:39,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:15:39,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:15:39,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (1/1) ... [2025-04-13 20:15:39,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:15:39,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:39,192 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:15:39,197 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:15:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:15:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:15:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:15:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:15:39,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:15:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:15:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:15:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:15:39,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:15:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:15:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:15:39,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:15:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:15:39,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:15:39,214 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:15:39,286 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:15:39,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:15:39,650 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:15:39,650 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:15:39,650 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:15:40,052 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:15:40,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:15:40 BoogieIcfgContainer [2025-04-13 20:15:40,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:15:40,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:15:40,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:15:40,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:15:40,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:15:38" (1/3) ... [2025-04-13 20:15:40,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f57073c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:15:40, skipping insertion in model container [2025-04-13 20:15:40,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:15:39" (2/3) ... [2025-04-13 20:15:40,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f57073c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:15:40, skipping insertion in model container [2025-04-13 20:15:40,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:15:40" (3/3) ... [2025-04-13 20:15:40,059 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-04-13 20:15:40,070 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:15:40,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:15:40,071 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:15:40,111 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:15:40,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 20:15:40,160 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 20:15:40,161 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:15:40,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 3/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-13 20:15:40,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 20:15:40,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-13 20:15:40,173 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:15:40,182 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;@2d6df64b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:15:40,182 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:15:40,191 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:15:40,191 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-13 20:15:40,192 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:15:40,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:40,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:40,194 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:15:40,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1139900004, now seen corresponding path program 1 times [2025-04-13 20:15:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:40,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600684514] [2025-04-13 20:15:40,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:40,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:15:40,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:15:40,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:40,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:40,643 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:15:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:40,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600684514] [2025-04-13 20:15:40,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600684514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:15:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:15:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:15:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501211735] [2025-04-13 20:15:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:40,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:15:40,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:40,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:15:40,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:15:40,672 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:40,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 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:15:40,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:40,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:40,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:40,839 INFO L116 PetriNetUnfolderBase]: 93/151 cut-off events. [2025-04-13 20:15:40,839 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 20:15:40,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 151 events. 93/151 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 421 event pairs, 8 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 267. Up to 102 conditions per place. [2025-04-13 20:15:40,842 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 25 selfloop transitions, 10 changer transitions 1/38 dead transitions. [2025-04-13 20:15:40,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 175 flow [2025-04-13 20:15:40,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:15:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:15:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-13 20:15:40,852 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-13 20:15:40,853 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 5 states and 57 transitions. [2025-04-13 20:15:40,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 175 flow [2025-04-13 20:15:40,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:15:40,861 INFO L231 Difference]: Finished difference. Result has 23 places, 25 transitions, 99 flow [2025-04-13 20:15:40,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=23, PETRI_TRANSITIONS=25} [2025-04-13 20:15:40,864 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2025-04-13 20:15:40,864 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 25 transitions, 99 flow [2025-04-13 20:15:40,864 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:15:40,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:40,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:40,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:15:40,865 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:15:40,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1379435055, now seen corresponding path program 1 times [2025-04-13 20:15:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:40,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82198768] [2025-04-13 20:15:40,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:40,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:15:40,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:15:40,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:40,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:41,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:41,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82198768] [2025-04-13 20:15:41,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82198768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:15:41,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:15:41,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:15:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223295444] [2025-04-13 20:15:41,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:41,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:15:41,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:41,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:15:41,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:15:41,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:41,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 25 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:15:41,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:41,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:41,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:41,107 INFO L116 PetriNetUnfolderBase]: 125/212 cut-off events. [2025-04-13 20:15:41,107 INFO L117 PetriNetUnfolderBase]: For 171/177 co-relation queries the response was YES. [2025-04-13 20:15:41,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 212 events. 125/212 cut-off events. For 171/177 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 713 event pairs, 46 based on Foata normal form. 11/200 useless extension candidates. Maximal degree in co-relation 219. Up to 108 conditions per place. [2025-04-13 20:15:41,109 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 31 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-04-13 20:15:41,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 38 transitions, 221 flow [2025-04-13 20:15:41,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:15:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:15:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-13 20:15:41,110 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-13 20:15:41,110 INFO L175 Difference]: Start difference. First operand has 23 places, 25 transitions, 99 flow. Second operand 4 states and 41 transitions. [2025-04-13 20:15:41,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 38 transitions, 221 flow [2025-04-13 20:15:41,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 38 transitions, 215 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 20:15:41,112 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 138 flow [2025-04-13 20:15:41,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2025-04-13 20:15:41,113 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2025-04-13 20:15:41,113 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 138 flow [2025-04-13 20:15:41,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:15:41,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:41,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:41,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:15:41,113 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:15:41,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1574976876, now seen corresponding path program 1 times [2025-04-13 20:15:41,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:41,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082879502] [2025-04-13 20:15:41,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:41,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:41,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:15:41,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:15:41,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:41,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:41,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:41,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082879502] [2025-04-13 20:15:41,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082879502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:15:41,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:15:41,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:15:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595542997] [2025-04-13 20:15:41,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:41,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:15:41,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:41,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:15:41,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:15:41,248 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:41,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:15:41,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:41,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:41,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:41,329 INFO L116 PetriNetUnfolderBase]: 100/175 cut-off events. [2025-04-13 20:15:41,329 INFO L117 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-04-13 20:15:41,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 175 events. 100/175 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 560 event pairs, 30 based on Foata normal form. 6/177 useless extension candidates. Maximal degree in co-relation 516. Up to 89 conditions per place. [2025-04-13 20:15:41,331 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 27 selfloop transitions, 5 changer transitions 4/38 dead transitions. [2025-04-13 20:15:41,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 260 flow [2025-04-13 20:15:41,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:15:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:15:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-13 20:15:41,333 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-04-13 20:15:41,333 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 138 flow. Second operand 4 states and 40 transitions. [2025-04-13 20:15:41,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 260 flow [2025-04-13 20:15:41,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 258 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 20:15:41,335 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 136 flow [2025-04-13 20:15:41,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-04-13 20:15:41,337 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2025-04-13 20:15:41,337 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 136 flow [2025-04-13 20:15:41,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:15:41,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:41,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:41,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:15:41,338 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:15:41,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash -845561355, now seen corresponding path program 1 times [2025-04-13 20:15:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:41,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485970861] [2025-04-13 20:15:41,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:41,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:15:41,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:15:41,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:41,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:41,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:41,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485970861] [2025-04-13 20:15:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485970861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:41,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379339577] [2025-04-13 20:15:41,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:41,455 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:15:41,456 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:15:41,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:15:41,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:15:41,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:41,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:41,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:15:41,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:41,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:41,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379339577] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:41,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:15:41,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2025-04-13 20:15:41,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676224867] [2025-04-13 20:15:41,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:41,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:15:41,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:41,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:15:41,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:15:41,646 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:41,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:41,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:41,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:41,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:41,724 INFO L116 PetriNetUnfolderBase]: 76/128 cut-off events. [2025-04-13 20:15:41,724 INFO L117 PetriNetUnfolderBase]: For 339/345 co-relation queries the response was YES. [2025-04-13 20:15:41,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 128 events. 76/128 cut-off events. For 339/345 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 326 event pairs, 12 based on Foata normal form. 10/137 useless extension candidates. Maximal degree in co-relation 460. Up to 80 conditions per place. [2025-04-13 20:15:41,725 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 23 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2025-04-13 20:15:41,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 218 flow [2025-04-13 20:15:41,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:15:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:15:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2025-04-13 20:15:41,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43157894736842106 [2025-04-13 20:15:41,727 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 136 flow. Second operand 5 states and 41 transitions. [2025-04-13 20:15:41,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 218 flow [2025-04-13 20:15:41,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 181 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-04-13 20:15:41,729 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 127 flow [2025-04-13 20:15:41,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2025-04-13 20:15:41,730 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-04-13 20:15:41,730 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 127 flow [2025-04-13 20:15:41,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:41,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:41,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:41,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:15:41,932 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:15:41,932 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:15:41,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash -563651174, now seen corresponding path program 1 times [2025-04-13 20:15:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:41,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959507655] [2025-04-13 20:15:41,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:41,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:15:41,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:15:41,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:41,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:42,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:42,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959507655] [2025-04-13 20:15:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959507655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:42,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661761541] [2025-04-13 20:15:42,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:42,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:42,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:42,038 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:15:42,041 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:15:42,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:15:42,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:15:42,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:42,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:42,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:15:42,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:42,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661761541] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:42,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:15:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2025-04-13 20:15:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996547147] [2025-04-13 20:15:42,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:42,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:15:42,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:42,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:15:42,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:15:42,185 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:42,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:42,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:42,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:42,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:42,248 INFO L116 PetriNetUnfolderBase]: 59/101 cut-off events. [2025-04-13 20:15:42,248 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-13 20:15:42,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 101 events. 59/101 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 218 event pairs, 5 based on Foata normal form. 8/107 useless extension candidates. Maximal degree in co-relation 347. Up to 80 conditions per place. [2025-04-13 20:15:42,249 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 28 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2025-04-13 20:15:42,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 233 flow [2025-04-13 20:15:42,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:15:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:15:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-04-13 20:15:42,251 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2025-04-13 20:15:42,251 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 127 flow. Second operand 5 states and 42 transitions. [2025-04-13 20:15:42,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 233 flow [2025-04-13 20:15:42,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:15:42,253 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 157 flow [2025-04-13 20:15:42,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2025-04-13 20:15:42,253 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2025-04-13 20:15:42,253 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 157 flow [2025-04-13 20:15:42,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:42,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:42,254 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:15:42,260 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:15:42,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:42,454 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:15:42,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1015803646, now seen corresponding path program 1 times [2025-04-13 20:15:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:42,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055397800] [2025-04-13 20:15:42,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:42,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:15:42,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:42,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:42,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:43,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:43,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055397800] [2025-04-13 20:15:43,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055397800] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:43,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538918752] [2025-04-13 20:15:43,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:43,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:43,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:43,385 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:15:43,386 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:15:43,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:15:43,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:43,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:43,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:43,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:15:43,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:43,489 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:15:43,658 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 77 treesize of output 49 [2025-04-13 20:15:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:43,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:44,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538918752] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:44,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 20:15:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473893824] [2025-04-13 20:15:44,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:44,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:15:44,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:44,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:15:44,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:15:44,439 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:44,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 157 flow. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:44,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:44,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:44,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:44,724 INFO L116 PetriNetUnfolderBase]: 82/153 cut-off events. [2025-04-13 20:15:44,724 INFO L117 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-04-13 20:15:44,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 153 events. 82/153 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 434 event pairs, 0 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 448. Up to 84 conditions per place. [2025-04-13 20:15:44,726 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 38 selfloop transitions, 23 changer transitions 3/66 dead transitions. [2025-04-13 20:15:44,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 426 flow [2025-04-13 20:15:44,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:15:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:15:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2025-04-13 20:15:44,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2025-04-13 20:15:44,727 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 157 flow. Second operand 12 states and 110 transitions. [2025-04-13 20:15:44,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 426 flow [2025-04-13 20:15:44,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:15:44,729 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 295 flow [2025-04-13 20:15:44,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=295, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-04-13 20:15:44,729 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 26 predicate places. [2025-04-13 20:15:44,729 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 295 flow [2025-04-13 20:15:44,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:44,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:44,729 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:15:44,736 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:15:44,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:44,934 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:15:44,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1105077880, now seen corresponding path program 2 times [2025-04-13 20:15:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:44,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922736573] [2025-04-13 20:15:44,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:15:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:44,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:44,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:44,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:44,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:45,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:45,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922736573] [2025-04-13 20:15:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922736573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:45,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668266051] [2025-04-13 20:15:45,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:15:45,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:45,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:45,462 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:15:45,464 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:15:45,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:45,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:45,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:45,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:45,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:15:45,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:45,743 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 77 treesize of output 49 [2025-04-13 20:15:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:45,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:46,061 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:46,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 145 [2025-04-13 20:15:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668266051] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:46,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2025-04-13 20:15:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926205806] [2025-04-13 20:15:46,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:46,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:15:46,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:46,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:15:46,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:15:46,358 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:46,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 295 flow. Second operand has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 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:15:46,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:46,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:46,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:46,701 INFO L116 PetriNetUnfolderBase]: 101/184 cut-off events. [2025-04-13 20:15:46,701 INFO L117 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-04-13 20:15:46,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 184 events. 101/184 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 559 event pairs, 2 based on Foata normal form. 1/183 useless extension candidates. Maximal degree in co-relation 664. Up to 120 conditions per place. [2025-04-13 20:15:46,703 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 31 selfloop transitions, 33 changer transitions 3/69 dead transitions. [2025-04-13 20:15:46,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 580 flow [2025-04-13 20:15:46,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:15:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:15:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 114 transitions. [2025-04-13 20:15:46,705 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 20:15:46,705 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 295 flow. Second operand 14 states and 114 transitions. [2025-04-13 20:15:46,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 580 flow [2025-04-13 20:15:46,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 524 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-04-13 20:15:46,711 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 431 flow [2025-04-13 20:15:46,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=431, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-04-13 20:15:46,711 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 37 predicate places. [2025-04-13 20:15:46,711 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 431 flow [2025-04-13 20:15:46,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 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:15:46,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:46,712 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:15:46,718 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:15:46,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:46,912 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:15:46,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1107586090, now seen corresponding path program 3 times [2025-04-13 20:15:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:46,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108388162] [2025-04-13 20:15:46,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:46,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:46,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:46,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:15:46,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:47,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:47,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108388162] [2025-04-13 20:15:47,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108388162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:47,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424400742] [2025-04-13 20:15:47,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:47,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:47,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:47,326 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:15:47,328 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:15:47,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:47,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:47,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:15:47,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:47,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:15:47,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:47,608 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 77 treesize of output 49 [2025-04-13 20:15:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:47,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:47,855 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:47,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 145 [2025-04-13 20:15:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424400742] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:48,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:48,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-13 20:15:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493068302] [2025-04-13 20:15:48,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:48,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:15:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:48,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:15:48,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:15:48,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:48,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 431 flow. Second operand has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 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:15:48,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:48,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:48,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:48,450 INFO L116 PetriNetUnfolderBase]: 104/190 cut-off events. [2025-04-13 20:15:48,450 INFO L117 PetriNetUnfolderBase]: For 500/500 co-relation queries the response was YES. [2025-04-13 20:15:48,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 190 events. 104/190 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 580 event pairs, 1 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 832. Up to 136 conditions per place. [2025-04-13 20:15:48,452 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 38 selfloop transitions, 26 changer transitions 4/70 dead transitions. [2025-04-13 20:15:48,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 645 flow [2025-04-13 20:15:48,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:15:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:15:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2025-04-13 20:15:48,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42543859649122806 [2025-04-13 20:15:48,453 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 431 flow. Second operand 12 states and 97 transitions. [2025-04-13 20:15:48,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 645 flow [2025-04-13 20:15:48,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 530 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-04-13 20:15:48,456 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 416 flow [2025-04-13 20:15:48,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-04-13 20:15:48,457 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 44 predicate places. [2025-04-13 20:15:48,457 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 416 flow [2025-04-13 20:15:48,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 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:15:48,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:48,457 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:15:48,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:15:48,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:48,662 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:15:48,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:48,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1635308534, now seen corresponding path program 4 times [2025-04-13 20:15:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:48,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829456599] [2025-04-13 20:15:48,663 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:15:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:48,668 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:48,694 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:48,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:15:48,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:49,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:49,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829456599] [2025-04-13 20:15:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829456599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:49,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10038588] [2025-04-13 20:15:49,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:15:49,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:49,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:49,205 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:15:49,208 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:15:49,251 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:49,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:49,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:15:49,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:49,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:15:49,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:49,290 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:15:49,401 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 41 [2025-04-13 20:15:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:49,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10038588] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:49,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-13 20:15:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536692871] [2025-04-13 20:15:49,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:49,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:15:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:49,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:15:49,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:15:49,897 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:49,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 416 flow. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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:15:49,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:49,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:49,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:50,085 INFO L116 PetriNetUnfolderBase]: 109/199 cut-off events. [2025-04-13 20:15:50,085 INFO L117 PetriNetUnfolderBase]: For 606/606 co-relation queries the response was YES. [2025-04-13 20:15:50,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 199 events. 109/199 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 629 event pairs, 1 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 974. Up to 151 conditions per place. [2025-04-13 20:15:50,087 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 45 selfloop transitions, 26 changer transitions 3/76 dead transitions. [2025-04-13 20:15:50,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 653 flow [2025-04-13 20:15:50,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:15:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:15:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2025-04-13 20:15:50,088 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46411483253588515 [2025-04-13 20:15:50,088 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 416 flow. Second operand 11 states and 97 transitions. [2025-04-13 20:15:50,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 653 flow [2025-04-13 20:15:50,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 574 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-04-13 20:15:50,091 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 443 flow [2025-04-13 20:15:50,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=443, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-04-13 20:15:50,092 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 46 predicate places. [2025-04-13 20:15:50,092 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 443 flow [2025-04-13 20:15:50,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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:15:50,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:50,092 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:15:50,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:15:50,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:50,297 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:15:50,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash 831250618, now seen corresponding path program 5 times [2025-04-13 20:15:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:50,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883652405] [2025-04-13 20:15:50,298 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:15:50,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:50,303 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:50,322 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:50,322 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:50,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:50,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:50,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883652405] [2025-04-13 20:15:50,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883652405] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:50,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656227919] [2025-04-13 20:15:50,559 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:15:50,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:50,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:50,561 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:15:50,563 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:15:50,599 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:50,616 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:50,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:50,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:50,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:15:50,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:50,627 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:15:50,730 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 41 [2025-04-13 20:15:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:50,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656227919] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:51,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:51,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2025-04-13 20:15:51,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144486162] [2025-04-13 20:15:51,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:51,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:15:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:51,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:15:51,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:15:51,249 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:51,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 443 flow. Second operand has 15 states, 15 states have (on average 6.2) internal successors, (93), 15 states have internal predecessors, (93), 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:15:51,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:51,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:51,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:51,388 INFO L116 PetriNetUnfolderBase]: 110/202 cut-off events. [2025-04-13 20:15:51,388 INFO L117 PetriNetUnfolderBase]: For 672/672 co-relation queries the response was YES. [2025-04-13 20:15:51,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 202 events. 110/202 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 652 event pairs, 2 based on Foata normal form. 1/199 useless extension candidates. Maximal degree in co-relation 857. Up to 150 conditions per place. [2025-04-13 20:15:51,389 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 41 selfloop transitions, 26 changer transitions 3/72 dead transitions. [2025-04-13 20:15:51,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 634 flow [2025-04-13 20:15:51,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:15:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:15:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2025-04-13 20:15:51,392 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46710526315789475 [2025-04-13 20:15:51,392 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 443 flow. Second operand 8 states and 71 transitions. [2025-04-13 20:15:51,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 634 flow [2025-04-13 20:15:51,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 566 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-04-13 20:15:51,396 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 459 flow [2025-04-13 20:15:51,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=459, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-04-13 20:15:51,397 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 46 predicate places. [2025-04-13 20:15:51,397 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 459 flow [2025-04-13 20:15:51,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 15 states have internal predecessors, (93), 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:15:51,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:51,398 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:15:51,404 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:15:51,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:51,598 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:15:51,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2129562946, now seen corresponding path program 6 times [2025-04-13 20:15:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:51,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60759851] [2025-04-13 20:15:51,600 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:15:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:51,606 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:51,622 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:51,622 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:15:51,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:51,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60759851] [2025-04-13 20:15:51,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60759851] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:51,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070485032] [2025-04-13 20:15:51,963 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:15:51,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:51,965 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:15:51,966 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:15:52,004 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:15:52,020 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:15:52,020 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:15:52,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:52,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:15:52,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:52,200 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 41 [2025-04-13 20:15:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:15:52,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:52,423 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:52,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 145 [2025-04-13 20:15:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:52,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070485032] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:52,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:52,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-13 20:15:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238031661] [2025-04-13 20:15:52,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:52,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:15:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:52,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:15:52,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:15:52,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:52,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 459 flow. Second operand has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 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:15:52,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:52,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:52,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:52,880 INFO L116 PetriNetUnfolderBase]: 113/208 cut-off events. [2025-04-13 20:15:52,880 INFO L117 PetriNetUnfolderBase]: For 840/840 co-relation queries the response was YES. [2025-04-13 20:15:52,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 208 events. 113/208 cut-off events. For 840/840 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 673 event pairs, 3 based on Foata normal form. 1/205 useless extension candidates. Maximal degree in co-relation 931. Up to 141 conditions per place. [2025-04-13 20:15:52,882 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 37 selfloop transitions, 34 changer transitions 3/76 dead transitions. [2025-04-13 20:15:52,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 76 transitions, 669 flow [2025-04-13 20:15:52,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:15:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:15:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2025-04-13 20:15:52,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44298245614035087 [2025-04-13 20:15:52,883 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 459 flow. Second operand 12 states and 101 transitions. [2025-04-13 20:15:52,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 76 transitions, 669 flow [2025-04-13 20:15:52,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 593 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-04-13 20:15:52,889 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 477 flow [2025-04-13 20:15:52,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=477, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2025-04-13 20:15:52,889 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 52 predicate places. [2025-04-13 20:15:52,889 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 477 flow [2025-04-13 20:15:52,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 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:15:52,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:52,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:52,895 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:15:53,090 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,SelfDestructingSolverStorable10 [2025-04-13 20:15:53,090 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:15:53,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1425117173, now seen corresponding path program 7 times [2025-04-13 20:15:53,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:53,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591927831] [2025-04-13 20:15:53,091 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:15:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:53,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:15:53,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:15:53,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:53,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:53,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:53,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591927831] [2025-04-13 20:15:53,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591927831] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:53,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659685079] [2025-04-13 20:15:53,170 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:15:53,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:53,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:53,172 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:15:53,174 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:15:53,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:15:53,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:15:53,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:53,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:53,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:15:53,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:53,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659685079] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:53,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:15:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533279902] [2025-04-13 20:15:53,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:53,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:15:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:53,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:15:53,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:15:53,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:53,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 477 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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:15:53,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:53,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:53,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:53,417 INFO L116 PetriNetUnfolderBase]: 140/275 cut-off events. [2025-04-13 20:15:53,418 INFO L117 PetriNetUnfolderBase]: For 1390/1397 co-relation queries the response was YES. [2025-04-13 20:15:53,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 275 events. 140/275 cut-off events. For 1390/1397 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1088 event pairs, 39 based on Foata normal form. 16/287 useless extension candidates. Maximal degree in co-relation 1217. Up to 115 conditions per place. [2025-04-13 20:15:53,419 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 71 selfloop transitions, 13 changer transitions 4/90 dead transitions. [2025-04-13 20:15:53,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 870 flow [2025-04-13 20:15:53,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:15:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:15:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-13 20:15:53,422 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2025-04-13 20:15:53,422 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 477 flow. Second operand 7 states and 65 transitions. [2025-04-13 20:15:53,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 870 flow [2025-04-13 20:15:53,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 768 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-04-13 20:15:53,428 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 474 flow [2025-04-13 20:15:53,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-04-13 20:15:53,429 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 50 predicate places. [2025-04-13 20:15:53,429 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 474 flow [2025-04-13 20:15:53,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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:15:53,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:53,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:53,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 20:15:53,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:53,630 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:15:53,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1577150032, now seen corresponding path program 8 times [2025-04-13 20:15:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:53,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938863600] [2025-04-13 20:15:53,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:15:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:53,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:15:53,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:15:53,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:53,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:53,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938863600] [2025-04-13 20:15:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938863600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:53,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707821543] [2025-04-13 20:15:53,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:15:53,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:53,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:53,697 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:15:53,699 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:15:53,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:15:53,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:15:53,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:53,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:53,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:15:53,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:53,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:15:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707821543] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:53,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:53,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:15:53,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722963060] [2025-04-13 20:15:53,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:53,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:15:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:53,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:15:53,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:15:53,831 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:53,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 474 flow. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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:15:53,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:53,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:53,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:53,917 INFO L116 PetriNetUnfolderBase]: 101/206 cut-off events. [2025-04-13 20:15:53,917 INFO L117 PetriNetUnfolderBase]: For 929/929 co-relation queries the response was YES. [2025-04-13 20:15:53,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 206 events. 101/206 cut-off events. For 929/929 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 772 event pairs, 23 based on Foata normal form. 14/220 useless extension candidates. Maximal degree in co-relation 801. Up to 102 conditions per place. [2025-04-13 20:15:53,919 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 48 selfloop transitions, 7 changer transitions 19/76 dead transitions. [2025-04-13 20:15:53,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 76 transitions, 685 flow [2025-04-13 20:15:53,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:15:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:15:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-13 20:15:53,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2025-04-13 20:15:53,922 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 474 flow. Second operand 7 states and 65 transitions. [2025-04-13 20:15:53,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 76 transitions, 685 flow [2025-04-13 20:15:53,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 668 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 20:15:53,925 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 372 flow [2025-04-13 20:15:53,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2025-04-13 20:15:53,926 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 53 predicate places. [2025-04-13 20:15:53,926 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 372 flow [2025-04-13 20:15:53,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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:15:53,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:53,926 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:53,934 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 20:15:54,127 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,SelfDestructingSolverStorable12 [2025-04-13 20:15:54,127 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:15:54,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1080719509, now seen corresponding path program 9 times [2025-04-13 20:15:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:54,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097512585] [2025-04-13 20:15:54,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:54,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:15:54,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:15:54,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:15:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:15:54,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:54,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097512585] [2025-04-13 20:15:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097512585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:54,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346933533] [2025-04-13 20:15:54,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:54,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:54,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:54,202 INFO L229 MonitoredProcess]: Starting monitored process 12 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:15:54,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:15:54,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:15:54,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:15:54,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:15:54,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:54,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:15:54,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:15:54,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:15:54,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346933533] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:54,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:54,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:15:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349964796] [2025-04-13 20:15:54,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:54,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:15:54,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:54,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:15:54,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:15:54,368 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:54,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 372 flow. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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:15:54,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:54,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:54,444 INFO L116 PetriNetUnfolderBase]: 86/157 cut-off events. [2025-04-13 20:15:54,444 INFO L117 PetriNetUnfolderBase]: For 1130/1137 co-relation queries the response was YES. [2025-04-13 20:15:54,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 157 events. 86/157 cut-off events. For 1130/1137 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 450 event pairs, 12 based on Foata normal form. 11/168 useless extension candidates. Maximal degree in co-relation 835. Up to 73 conditions per place. [2025-04-13 20:15:54,445 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 36 selfloop transitions, 15 changer transitions 0/53 dead transitions. [2025-04-13 20:15:54,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 53 transitions, 505 flow [2025-04-13 20:15:54,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:15:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:15:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-04-13 20:15:54,447 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3881578947368421 [2025-04-13 20:15:54,447 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 372 flow. Second operand 8 states and 59 transitions. [2025-04-13 20:15:54,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 53 transitions, 505 flow [2025-04-13 20:15:54,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 441 flow, removed 21 selfloop flow, removed 9 redundant places. [2025-04-13 20:15:54,450 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 334 flow [2025-04-13 20:15:54,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=334, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2025-04-13 20:15:54,450 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 42 predicate places. [2025-04-13 20:15:54,450 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 334 flow [2025-04-13 20:15:54,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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:15:54,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:54,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:54,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:15:54,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:15:54,652 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:15:54,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1262610650, now seen corresponding path program 10 times [2025-04-13 20:15:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:54,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473632747] [2025-04-13 20:15:54,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:15:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:54,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:15:54,661 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:15:54,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:15:54,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:15:54,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:54,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473632747] [2025-04-13 20:15:54,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473632747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:54,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37567563] [2025-04-13 20:15:54,716 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:15:54,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:54,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:54,718 INFO L229 MonitoredProcess]: Starting monitored process 13 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:15:54,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:15:54,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:15:54,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:15:54,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:15:54,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:54,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:15:54,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:15:54,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:15:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37567563] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:54,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:15:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509159987] [2025-04-13 20:15:54,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:54,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:15:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:54,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:15:54,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:15:54,873 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:15:54,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 334 flow. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 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:15:54,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:54,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:15:54,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:54,947 INFO L116 PetriNetUnfolderBase]: 76/136 cut-off events. [2025-04-13 20:15:54,947 INFO L117 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2025-04-13 20:15:54,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 136 events. 76/136 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 339 event pairs, 15 based on Foata normal form. 12/148 useless extension candidates. Maximal degree in co-relation 755. Up to 70 conditions per place. [2025-04-13 20:15:54,948 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 33 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2025-04-13 20:15:54,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 475 flow [2025-04-13 20:15:54,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:15:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:15:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2025-04-13 20:15:54,948 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40131578947368424 [2025-04-13 20:15:54,948 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 334 flow. Second operand 8 states and 61 transitions. [2025-04-13 20:15:54,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 475 flow [2025-04-13 20:15:54,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 410 flow, removed 27 selfloop flow, removed 9 redundant places. [2025-04-13 20:15:54,950 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 292 flow [2025-04-13 20:15:54,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=292, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2025-04-13 20:15:54,951 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 37 predicate places. [2025-04-13 20:15:54,951 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 292 flow [2025-04-13 20:15:54,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 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:15:54,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:54,951 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:54,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 20:15:55,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:15:55,152 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:15:55,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1485102770, now seen corresponding path program 11 times [2025-04-13 20:15:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:55,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254438272] [2025-04-13 20:15:55,152 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:15:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:55,158 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:15:55,199 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:15:55,199 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:55,942 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:15:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:55,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254438272] [2025-04-13 20:15:55,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254438272] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:55,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487657616] [2025-04-13 20:15:55,943 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:15:55,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:55,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:55,945 INFO L229 MonitoredProcess]: Starting monitored process 14 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:15:55,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:15:55,990 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:15:56,015 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:15:56,015 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:56,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:56,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 20:15:56,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:56,485 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:56,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 144 [2025-04-13 20:15:56,577 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:15:56,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:57,336 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:57,337 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 934 treesize of output 426 [2025-04-13 20:16:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:16:04,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487657616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:04,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:04,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2025-04-13 20:16:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882371830] [2025-04-13 20:16:04,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:04,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:16:04,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:04,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:16:04,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:16:04,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-04-13 20:16:04,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 292 flow. Second operand has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 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:16:04,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:04,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-04-13 20:16:04,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:05,195 INFO L116 PetriNetUnfolderBase]: 116/209 cut-off events. [2025-04-13 20:16:05,196 INFO L117 PetriNetUnfolderBase]: For 794/794 co-relation queries the response was YES. [2025-04-13 20:16:05,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 209 events. 116/209 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 601 event pairs, 6 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 1123. Up to 132 conditions per place. [2025-04-13 20:16:05,197 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 52 selfloop transitions, 30 changer transitions 4/88 dead transitions. [2025-04-13 20:16:05,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 88 transitions, 752 flow [2025-04-13 20:16:05,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:16:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:16:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 146 transitions. [2025-04-13 20:16:05,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4269005847953216 [2025-04-13 20:16:05,198 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 292 flow. Second operand 18 states and 146 transitions. [2025-04-13 20:16:05,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 88 transitions, 752 flow [2025-04-13 20:16:05,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 721 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-13 20:16:05,201 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 540 flow [2025-04-13 20:16:05,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=540, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-04-13 20:16:05,201 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 53 predicate places. [2025-04-13 20:16:05,201 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 540 flow [2025-04-13 20:16:05,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 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:16:05,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:05,201 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:05,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 20:16:05,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:16:05,406 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:16:05,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1667966458, now seen corresponding path program 12 times [2025-04-13 20:16:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:05,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199752436] [2025-04-13 20:16:05,407 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:16:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:05,412 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:16:05,444 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:16:05,444 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:16:05,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:06,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:06,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199752436] [2025-04-13 20:16:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199752436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:06,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812936756] [2025-04-13 20:16:06,164 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:16:06,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:06,166 INFO L229 MonitoredProcess]: Starting monitored process 15 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:16:06,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:16:06,210 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:16:06,238 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:16:06,238 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:16:06,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:06,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 20:16:06,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:06,272 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:16:06,740 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:16:06,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 157 [2025-04-13 20:16:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:07,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:12,920 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 666 treesize of output 592 [2025-04-13 20:16:13,193 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:16:13,193 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 1147 treesize of output 1207 [2025-04-13 20:16:18,444 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:16:23,227 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:16:34,746 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:16:41,145 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:16:48,486 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:17:00,167 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:17:19,773 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:17:43,317 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:17:46,083 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:17:57,542 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:18:04,939 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:18:13,744 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:18:26,228 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:18:40,140 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:18:46,191 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:19:06,330 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:19:13,581 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:19:36,514 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 20:20:48,126 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:20:57,424 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:21:29,777 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:21:41,058 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:21:52,543 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:22:29,259 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:22:56,602 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 20:23:05,955 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 20:23:19,357 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:23:19,357 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 20:23:19,358 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:23:19,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 20:23:19,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:19,559 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 20:23:19,564 INFO L158 Benchmark]: Toolchain (without parser) took 460708.27ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 99.2MB in the beginning and 362.5MB in the end (delta: -263.3MB). Peak memory consumption was 494.1MB. Max. memory is 8.0GB. [2025-04-13 20:23:19,564 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:23:19,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.58ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 83.7MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:23:19,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.62ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:23:19,564 INFO L158 Benchmark]: Boogie Preprocessor took 49.38ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 77.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:23:19,564 INFO L158 Benchmark]: RCFGBuilder took 895.51ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 94.1MB in the end (delta: -16.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2025-04-13 20:23:19,565 INFO L158 Benchmark]: TraceAbstraction took 459509.42ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 94.1MB in the beginning and 362.5MB in the end (delta: -268.4MB). Peak memory consumption was 489.7MB. Max. memory is 8.0GB. [2025-04-13 20:23:19,566 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.71ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.58ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 83.7MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.62ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 49.38ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 77.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 895.51ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 94.1MB in the end (delta: -16.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. * TraceAbstraction took 459509.42ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 94.1MB in the beginning and 362.5MB in the end (delta: -268.4MB). Peak memory consumption was 489.7MB. 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...