/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/test-context1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:58:12,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:58:12,936 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:58:12,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:58:12,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:58:12,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:58:12,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:58:12,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:58:12,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:58:12,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:58:12,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:58:12,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:58:12,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:58:12,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:58:12,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:58:12,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:58:12,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:58:12,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:58:12,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:58:12,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:58:12,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:58:12,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:58:12,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:58:12,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:58:12,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:58:12,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:58:12,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:58:12,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:58:12,970 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:58:12,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:58:12,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:58:12,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:58:12,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:58:12,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:58:12,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:58:12,970 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:58:13,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:58:13,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:58:13,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:58:13,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:58:13,185 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:58:13,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-context1.wvr.c [2025-04-13 20:58:14,458 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fc44ad9/c61331e113094a2eb07e656a75f9fc57/FLAGded5d65d8 [2025-04-13 20:58:14,665 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:58:14,665 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c [2025-04-13 20:58:14,672 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fc44ad9/c61331e113094a2eb07e656a75f9fc57/FLAGded5d65d8 [2025-04-13 20:58:15,508 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fc44ad9/c61331e113094a2eb07e656a75f9fc57 [2025-04-13 20:58:15,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:58:15,511 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:58:15,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:58:15,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:58:15,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:58:15,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3f57e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15, skipping insertion in model container [2025-04-13 20:58:15,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:58:15,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c[2459,2472] [2025-04-13 20:58:15,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:58:15,708 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:58:15,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c[2459,2472] [2025-04-13 20:58:15,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:58:15,750 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:58:15,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15 WrapperNode [2025-04-13 20:58:15,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:58:15,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:58:15,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:58:15,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:58:15,756 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:58:15" (1/1) ... [2025-04-13 20:58:15,762 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:58:15" (1/1) ... [2025-04-13 20:58:15,782 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-04-13 20:58:15,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:58:15,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:58:15,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:58:15,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:58:15,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,809 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:58:15,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:58:15,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:58:15,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:58:15,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:58:15,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (1/1) ... [2025-04-13 20:58:15,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:58:15,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:15,845 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:58:15,847 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:58:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:58:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:58:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:58:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:58:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:58:15,865 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:58:15,937 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:58:15,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:58:16,105 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:58:16,106 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:58:16,106 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:58:16,273 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 20:58:16,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:58:16 BoogieIcfgContainer [2025-04-13 20:58:16,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:58:16,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:58:16,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:58:16,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:58:16,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:58:15" (1/3) ... [2025-04-13 20:58:16,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eff506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:58:16, skipping insertion in model container [2025-04-13 20:58:16,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:58:15" (2/3) ... [2025-04-13 20:58:16,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8eff506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:58:16, skipping insertion in model container [2025-04-13 20:58:16,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:58:16" (3/3) ... [2025-04-13 20:58:16,282 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-04-13 20:58:16,292 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:58:16,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 19 locations, 19 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:58:16,293 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:58:16,322 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:58:16,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2025-04-13 20:58:16,368 INFO L116 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-04-13 20:58:16,372 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:58:16,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-13 20:58:16,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2025-04-13 20:58:16,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2025-04-13 20:58:16,385 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:58:16,392 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;@12253f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:58:16,392 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:58:16,397 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:58:16,397 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 20:58:16,397 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:58:16,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:16,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:16,398 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:58:16,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1328072601, now seen corresponding path program 1 times [2025-04-13 20:58:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:16,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079779419] [2025-04-13 20:58:16,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:58:16,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:16,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 20:58:16,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 20:58:16,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:58:16,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:16,576 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:58:16,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:16,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079779419] [2025-04-13 20:58:16,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079779419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:58:16,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:58:16,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:58:16,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965031424] [2025-04-13 20:58:16,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:58:16,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:58:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:16,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:58:16,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:58:16,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:16,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:16,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:16,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:16,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:16,679 INFO L116 PetriNetUnfolderBase]: 100/170 cut-off events. [2025-04-13 20:58:16,679 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 20:58:16,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 170 events. 100/170 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 550 event pairs, 30 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 306. Up to 84 conditions per place. [2025-04-13 20:58:16,682 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2025-04-13 20:58:16,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 122 flow [2025-04-13 20:58:16,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:58:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:58:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 20:58:16,694 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-04-13 20:58:16,695 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 48 flow. Second operand 3 states and 38 transitions. [2025-04-13 20:58:16,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 122 flow [2025-04-13 20:58:16,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:58:16,703 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 52 flow [2025-04-13 20:58:16,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-04-13 20:58:16,708 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2025-04-13 20:58:16,708 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 52 flow [2025-04-13 20:58:16,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:16,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:16,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:16,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:58:16,709 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:58:16,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 967789787, now seen corresponding path program 1 times [2025-04-13 20:58:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:16,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423193238] [2025-04-13 20:58:16,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:58:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:16,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:58:16,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:58:16,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:58:16,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:16,832 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:58:16,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:16,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423193238] [2025-04-13 20:58:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423193238] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:58:16,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:58:16,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:58:16,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169949580] [2025-04-13 20:58:16,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:58:16,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:58:16,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:16,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:58:16,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:58:16,834 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:16,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:16,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:16,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:16,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:16,895 INFO L116 PetriNetUnfolderBase]: 97/182 cut-off events. [2025-04-13 20:58:16,895 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 20:58:16,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 182 events. 97/182 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 646 event pairs, 37 based on Foata normal form. 7/145 useless extension candidates. Maximal degree in co-relation 245. Up to 126 conditions per place. [2025-04-13 20:58:16,896 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2025-04-13 20:58:16,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 29 transitions, 129 flow [2025-04-13 20:58:16,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:58:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:58:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-13 20:58:16,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-04-13 20:58:16,897 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 52 flow. Second operand 3 states and 39 transitions. [2025-04-13 20:58:16,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 29 transitions, 129 flow [2025-04-13 20:58:16,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 29 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:58:16,898 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 62 flow [2025-04-13 20:58:16,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-04-13 20:58:16,899 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2025-04-13 20:58:16,899 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 62 flow [2025-04-13 20:58:16,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:16,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:16,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:16,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:58:16,899 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:58:16,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1208511011, now seen corresponding path program 1 times [2025-04-13 20:58:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:16,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596690776] [2025-04-13 20:58:16,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:58:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:16,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:58:16,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:58:16,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:58:16,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:17,125 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:58:17,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:17,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596690776] [2025-04-13 20:58:17,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596690776] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:58:17,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:58:17,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:58:17,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049682709] [2025-04-13 20:58:17,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:58:17,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:58:17,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:17,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:58:17,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:58:17,126 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:17,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:17,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:17,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:17,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:17,225 INFO L116 PetriNetUnfolderBase]: 119/238 cut-off events. [2025-04-13 20:58:17,226 INFO L117 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-04-13 20:58:17,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 238 events. 119/238 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 997 event pairs, 97 based on Foata normal form. 8/186 useless extension candidates. Maximal degree in co-relation 381. Up to 179 conditions per place. [2025-04-13 20:58:17,227 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 17 selfloop transitions, 2 changer transitions 11/32 dead transitions. [2025-04-13 20:58:17,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 32 transitions, 150 flow [2025-04-13 20:58:17,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:58:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:58:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-13 20:58:17,229 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-04-13 20:58:17,229 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 62 flow. Second operand 4 states and 45 transitions. [2025-04-13 20:58:17,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 32 transitions, 150 flow [2025-04-13 20:58:17,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:58:17,230 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 74 flow [2025-04-13 20:58:17,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2025-04-13 20:58:17,230 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2025-04-13 20:58:17,230 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 74 flow [2025-04-13 20:58:17,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:17,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:17,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:17,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:58:17,231 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:58:17,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash 483874463, now seen corresponding path program 1 times [2025-04-13 20:58:17,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:17,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901116706] [2025-04-13 20:58:17,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:58:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:58:17,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:58:17,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:58:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:58:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:17,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901116706] [2025-04-13 20:58:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901116706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:58:17,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:58:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:58:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479648958] [2025-04-13 20:58:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:58:17,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:58:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:17,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:58:17,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:58:17,491 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:17,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:58:17,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:17,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:17,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:17,630 INFO L116 PetriNetUnfolderBase]: 127/235 cut-off events. [2025-04-13 20:58:17,630 INFO L117 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-04-13 20:58:17,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 235 events. 127/235 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 813 event pairs, 22 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 536. Up to 65 conditions per place. [2025-04-13 20:58:17,631 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 32 selfloop transitions, 5 changer transitions 8/47 dead transitions. [2025-04-13 20:58:17,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 229 flow [2025-04-13 20:58:17,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:58:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:58:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-13 20:58:17,636 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-04-13 20:58:17,636 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 74 flow. Second operand 6 states and 69 transitions. [2025-04-13 20:58:17,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 229 flow [2025-04-13 20:58:17,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:58:17,638 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 88 flow [2025-04-13 20:58:17,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2025-04-13 20:58:17,638 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2025-04-13 20:58:17,638 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 88 flow [2025-04-13 20:58:17,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:58:17,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:17,639 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:17,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:58:17,639 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:58:17,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1856357889, now seen corresponding path program 2 times [2025-04-13 20:58:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:17,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717029145] [2025-04-13 20:58:17,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:58:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:17,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:58:17,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:58:17,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:58:17,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:58:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:17,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717029145] [2025-04-13 20:58:17,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717029145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:58:17,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:58:17,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:58:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783702386] [2025-04-13 20:58:17,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:58:17,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:58:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:17,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:58:17,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:58:17,719 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:17,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:17,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:17,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:17,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:17,812 INFO L116 PetriNetUnfolderBase]: 269/495 cut-off events. [2025-04-13 20:58:17,812 INFO L117 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-04-13 20:58:17,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 495 events. 269/495 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2072 event pairs, 90 based on Foata normal form. 14/386 useless extension candidates. Maximal degree in co-relation 1174. Up to 190 conditions per place. [2025-04-13 20:58:17,815 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 38 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-04-13 20:58:17,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 262 flow [2025-04-13 20:58:17,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:58:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:58:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-13 20:58:17,817 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 20:58:17,817 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 88 flow. Second operand 4 states and 56 transitions. [2025-04-13 20:58:17,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 262 flow [2025-04-13 20:58:17,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 248 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 20:58:17,819 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 142 flow [2025-04-13 20:58:17,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2025-04-13 20:58:17,819 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2025-04-13 20:58:17,819 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 142 flow [2025-04-13 20:58:17,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:58:17,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:17,819 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:17,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:58:17,820 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:58:17,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1334239079, now seen corresponding path program 3 times [2025-04-13 20:58:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:17,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76350059] [2025-04-13 20:58:17,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:58:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:17,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:58:17,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:58:17,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:58:17,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:18,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76350059] [2025-04-13 20:58:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76350059] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:18,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769236484] [2025-04-13 20:58:18,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:58:18,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:18,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:18,009 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:58:18,010 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:58:18,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:58:18,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:58:18,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:58:18,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:18,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:58:18,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:18,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769236484] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:18,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-13 20:58:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733972210] [2025-04-13 20:58:18,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:18,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:58:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:18,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:58:18,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:58:18,294 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:18,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 142 flow. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 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:58:18,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:18,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:18,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:18,535 INFO L116 PetriNetUnfolderBase]: 463/867 cut-off events. [2025-04-13 20:58:18,537 INFO L117 PetriNetUnfolderBase]: For 799/799 co-relation queries the response was YES. [2025-04-13 20:58:18,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 867 events. 463/867 cut-off events. For 799/799 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4304 event pairs, 132 based on Foata normal form. 21/666 useless extension candidates. Maximal degree in co-relation 1323. Up to 438 conditions per place. [2025-04-13 20:58:18,539 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 27 selfloop transitions, 4 changer transitions 47/80 dead transitions. [2025-04-13 20:58:18,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 80 transitions, 476 flow [2025-04-13 20:58:18,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:58:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:58:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2025-04-13 20:58:18,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-13 20:58:18,541 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 142 flow. Second operand 9 states and 105 transitions. [2025-04-13 20:58:18,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 80 transitions, 476 flow [2025-04-13 20:58:18,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 80 transitions, 466 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-04-13 20:58:18,545 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 170 flow [2025-04-13 20:58:18,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2025-04-13 20:58:18,547 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 21 predicate places. [2025-04-13 20:58:18,547 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 170 flow [2025-04-13 20:58:18,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 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:58:18,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:18,548 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:18,554 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:58:18,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:58:18,752 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:58:18,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash -619014597, now seen corresponding path program 4 times [2025-04-13 20:58:18,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:18,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653847382] [2025-04-13 20:58:18,755 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:58:18,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:18,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:58:18,775 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:58:18,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:58:18,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:18,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:18,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653847382] [2025-04-13 20:58:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653847382] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:18,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319829432] [2025-04-13 20:58:18,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:58:18,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:18,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:18,962 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:58:18,963 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:58:19,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:58:19,029 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:58:19,029 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:58:19,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:19,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 20:58:19,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:58:19,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:19,272 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:58:19,273 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 28 treesize of output 11 [2025-04-13 20:58:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319829432] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:19,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:19,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 15 [2025-04-13 20:58:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89904008] [2025-04-13 20:58:19,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:19,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:58:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:19,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:58:19,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:58:19,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:19,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 170 flow. Second operand has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 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:58:19,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:19,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:19,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:19,978 INFO L116 PetriNetUnfolderBase]: 748/1331 cut-off events. [2025-04-13 20:58:19,979 INFO L117 PetriNetUnfolderBase]: For 2153/2153 co-relation queries the response was YES. [2025-04-13 20:58:19,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3825 conditions, 1331 events. 748/1331 cut-off events. For 2153/2153 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6462 event pairs, 32 based on Foata normal form. 20/1017 useless extension candidates. Maximal degree in co-relation 3789. Up to 225 conditions per place. [2025-04-13 20:58:19,983 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 93 selfloop transitions, 37 changer transitions 60/192 dead transitions. [2025-04-13 20:58:19,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 192 transitions, 1146 flow [2025-04-13 20:58:19,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 20:58:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 20:58:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 283 transitions. [2025-04-13 20:58:19,985 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6125541125541125 [2025-04-13 20:58:19,985 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 170 flow. Second operand 22 states and 283 transitions. [2025-04-13 20:58:19,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 192 transitions, 1146 flow [2025-04-13 20:58:19,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 192 transitions, 1116 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-04-13 20:58:19,990 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 594 flow [2025-04-13 20:58:19,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=594, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-04-13 20:58:19,991 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 44 predicate places. [2025-04-13 20:58:19,991 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 594 flow [2025-04-13 20:58:19,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.235294117647059) internal successors, (123), 17 states have internal predecessors, (123), 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:58:19,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:19,991 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:19,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:58:20,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-13 20:58:20,196 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:58:20,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash -902712965, now seen corresponding path program 5 times [2025-04-13 20:58:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:20,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782461626] [2025-04-13 20:58:20,197 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:58:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:20,205 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-04-13 20:58:20,217 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:58:20,217 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:58:20,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:58:20,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:20,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782461626] [2025-04-13 20:58:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782461626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:20,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127396344] [2025-04-13 20:58:20,358 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:58:20,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:20,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:20,361 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:58:20,362 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:58:20,402 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-04-13 20:58:20,423 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:58:20,423 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 20:58:20,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:20,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:58:20,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:58:20,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:58:20,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127396344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:20,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:20,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-04-13 20:58:20,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78120680] [2025-04-13 20:58:20,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:20,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:58:20,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:20,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:58:20,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:58:20,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:20,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 594 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:58:20,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:20,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:20,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:21,023 INFO L116 PetriNetUnfolderBase]: 947/1730 cut-off events. [2025-04-13 20:58:21,023 INFO L117 PetriNetUnfolderBase]: For 4467/4467 co-relation queries the response was YES. [2025-04-13 20:58:21,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5280 conditions, 1730 events. 947/1730 cut-off events. For 4467/4467 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9483 event pairs, 624 based on Foata normal form. 32/1319 useless extension candidates. Maximal degree in co-relation 5030. Up to 1326 conditions per place. [2025-04-13 20:58:21,029 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 55 selfloop transitions, 4 changer transitions 57/118 dead transitions. [2025-04-13 20:58:21,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 1035 flow [2025-04-13 20:58:21,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:58:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:58:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2025-04-13 20:58:21,031 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5281385281385281 [2025-04-13 20:58:21,031 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 594 flow. Second operand 11 states and 122 transitions. [2025-04-13 20:58:21,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 1035 flow [2025-04-13 20:58:21,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 118 transitions, 781 flow, removed 114 selfloop flow, removed 6 redundant places. [2025-04-13 20:58:21,043 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 406 flow [2025-04-13 20:58:21,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=406, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2025-04-13 20:58:21,043 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 55 predicate places. [2025-04-13 20:58:21,043 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 406 flow [2025-04-13 20:58:21,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:58:21,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:21,043 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:21,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:58:21,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:21,246 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:58:21,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:21,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1218309955, now seen corresponding path program 6 times [2025-04-13 20:58:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:21,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326866811] [2025-04-13 20:58:21,247 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:58:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:21,254 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-04-13 20:58:21,290 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:58:21,290 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:58:21,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:58:21,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:21,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326866811] [2025-04-13 20:58:21,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326866811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:21,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25098312] [2025-04-13 20:58:21,535 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:58:21,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:21,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:21,537 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:58:21,538 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:58:21,579 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-04-13 20:58:21,602 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:58:21,602 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 20:58:21,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:21,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 20:58:21,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:21,674 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:58:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:21,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:22,017 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 43 treesize of output 39 [2025-04-13 20:58:22,024 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:58:22,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 47 [2025-04-13 20:58:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:22,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25098312] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:22,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:22,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 27 [2025-04-13 20:58:22,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033781307] [2025-04-13 20:58:22,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:22,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:58:22,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:22,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:58:22,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:58:22,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:22,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 406 flow. Second operand has 29 states, 29 states have (on average 6.344827586206897) internal successors, (184), 29 states have internal predecessors, (184), 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:58:22,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:22,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:22,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:23,188 INFO L116 PetriNetUnfolderBase]: 1764/3133 cut-off events. [2025-04-13 20:58:23,188 INFO L117 PetriNetUnfolderBase]: For 3023/3023 co-relation queries the response was YES. [2025-04-13 20:58:23,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8230 conditions, 3133 events. 1764/3133 cut-off events. For 3023/3023 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 17787 event pairs, 304 based on Foata normal form. 3/2351 useless extension candidates. Maximal degree in co-relation 8183. Up to 793 conditions per place. [2025-04-13 20:58:23,202 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 169 selfloop transitions, 61 changer transitions 70/302 dead transitions. [2025-04-13 20:58:23,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 302 transitions, 1911 flow [2025-04-13 20:58:23,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 20:58:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-13 20:58:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 353 transitions. [2025-04-13 20:58:23,204 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5796387520525451 [2025-04-13 20:58:23,204 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 406 flow. Second operand 29 states and 353 transitions. [2025-04-13 20:58:23,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 302 transitions, 1911 flow [2025-04-13 20:58:23,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 302 transitions, 1843 flow, removed 31 selfloop flow, removed 9 redundant places. [2025-04-13 20:58:23,219 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 915 flow [2025-04-13 20:58:23,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=915, PETRI_PLACES=100, PETRI_TRANSITIONS=104} [2025-04-13 20:58:23,220 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 78 predicate places. [2025-04-13 20:58:23,220 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 915 flow [2025-04-13 20:58:23,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.344827586206897) internal successors, (184), 29 states have internal predecessors, (184), 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:58:23,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:23,220 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:23,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:58:23,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:23,421 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:58:23,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1828396487, now seen corresponding path program 7 times [2025-04-13 20:58:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:23,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145581036] [2025-04-13 20:58:23,422 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:58:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:23,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 20:58:23,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:58:23,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:58:23,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:58:23,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:23,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145581036] [2025-04-13 20:58:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145581036] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:23,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180687615] [2025-04-13 20:58:23,627 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:58:23,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:23,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:23,629 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:58:23,631 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:58:23,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 20:58:23,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 20:58:23,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:58:23,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:23,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 20:58:23,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:58:23,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:58:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180687615] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:24,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:24,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2025-04-13 20:58:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659922658] [2025-04-13 20:58:24,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:24,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:58:24,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:24,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:58:24,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:58:24,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:24,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 104 transitions, 915 flow. Second operand has 28 states, 28 states have (on average 6.392857142857143) internal successors, (179), 28 states have internal predecessors, (179), 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:58:24,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:24,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:24,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:24,764 INFO L116 PetriNetUnfolderBase]: 2152/3895 cut-off events. [2025-04-13 20:58:24,765 INFO L117 PetriNetUnfolderBase]: For 6021/6021 co-relation queries the response was YES. [2025-04-13 20:58:24,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10924 conditions, 3895 events. 2152/3895 cut-off events. For 6021/6021 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 24076 event pairs, 1375 based on Foata normal form. 80/2969 useless extension candidates. Maximal degree in co-relation 10402. Up to 2871 conditions per place. [2025-04-13 20:58:24,777 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 90 selfloop transitions, 5 changer transitions 123/220 dead transitions. [2025-04-13 20:58:24,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 220 transitions, 1767 flow [2025-04-13 20:58:24,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:58:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:58:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 220 transitions. [2025-04-13 20:58:24,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5513784461152882 [2025-04-13 20:58:24,779 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 915 flow. Second operand 19 states and 220 transitions. [2025-04-13 20:58:24,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 220 transitions, 1767 flow [2025-04-13 20:58:24,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 220 transitions, 1666 flow, removed 28 selfloop flow, removed 8 redundant places. [2025-04-13 20:58:24,800 INFO L231 Difference]: Finished difference. Result has 120 places, 97 transitions, 836 flow [2025-04-13 20:58:24,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=836, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2025-04-13 20:58:24,801 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 98 predicate places. [2025-04-13 20:58:24,801 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 836 flow [2025-04-13 20:58:24,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.392857142857143) internal successors, (179), 28 states have internal predecessors, (179), 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:58:24,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:24,802 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:24,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:58:25,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 20:58:25,007 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:58:25,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1833996227, now seen corresponding path program 8 times [2025-04-13 20:58:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:25,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663252854] [2025-04-13 20:58:25,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:58:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:25,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:58:25,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:58:25,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:58:25,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:25,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:25,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663252854] [2025-04-13 20:58:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663252854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:25,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541054307] [2025-04-13 20:58:25,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:58:25,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:25,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:25,344 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:58:25,349 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:58:25,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 20:58:25,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:58:25,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:58:25,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:25,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:58:25,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 20:58:25,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:25,670 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:58:25,670 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 28 treesize of output 11 [2025-04-13 20:58:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 20:58:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541054307] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:25,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:25,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 23 [2025-04-13 20:58:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115942965] [2025-04-13 20:58:25,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:25,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:58:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:25,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:58:25,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:58:25,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:25,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 836 flow. Second operand has 25 states, 25 states have (on average 6.8) internal successors, (170), 25 states have internal predecessors, (170), 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:58:25,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:25,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:25,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:27,082 INFO L116 PetriNetUnfolderBase]: 2370/4185 cut-off events. [2025-04-13 20:58:27,082 INFO L117 PetriNetUnfolderBase]: For 5698/5698 co-relation queries the response was YES. [2025-04-13 20:58:27,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 4185 events. 2370/4185 cut-off events. For 5698/5698 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 24775 event pairs, 208 based on Foata normal form. 2/3140 useless extension candidates. Maximal degree in co-relation 11734. Up to 711 conditions per place. [2025-04-13 20:58:27,097 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 171 selfloop transitions, 107 changer transitions 100/380 dead transitions. [2025-04-13 20:58:27,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 380 transitions, 2519 flow [2025-04-13 20:58:27,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 20:58:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 20:58:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 470 transitions. [2025-04-13 20:58:27,099 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5738705738705738 [2025-04-13 20:58:27,099 INFO L175 Difference]: Start difference. First operand has 120 places, 97 transitions, 836 flow. Second operand 39 states and 470 transitions. [2025-04-13 20:58:27,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 380 transitions, 2519 flow [2025-04-13 20:58:27,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 380 transitions, 2431 flow, removed 39 selfloop flow, removed 15 redundant places. [2025-04-13 20:58:27,125 INFO L231 Difference]: Finished difference. Result has 130 places, 136 transitions, 1337 flow [2025-04-13 20:58:27,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1337, PETRI_PLACES=130, PETRI_TRANSITIONS=136} [2025-04-13 20:58:27,125 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 108 predicate places. [2025-04-13 20:58:27,125 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 136 transitions, 1337 flow [2025-04-13 20:58:27,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.8) internal successors, (170), 25 states have internal predecessors, (170), 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:58:27,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:27,125 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:27,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:58:27,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:27,326 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:58:27,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:27,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1274875003, now seen corresponding path program 9 times [2025-04-13 20:58:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:27,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059803064] [2025-04-13 20:58:27,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:58:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:27,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 20:58:27,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:58:27,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 20:58:27,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:28,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:28,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059803064] [2025-04-13 20:58:28,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059803064] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:28,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318260156] [2025-04-13 20:58:28,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:58:28,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:28,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:28,111 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:58:28,113 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:58:28,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 20:58:28,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 20:58:28,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 20:58:28,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:28,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 20:58:28,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:58:28,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:28,607 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:58:28,607 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 28 treesize of output 11 [2025-04-13 20:58:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 20:58:28,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318260156] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:28,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:28,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 9] total 34 [2025-04-13 20:58:28,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898365962] [2025-04-13 20:58:28,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:28,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:58:28,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:28,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:58:28,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:58:28,699 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:28,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 136 transitions, 1337 flow. Second operand has 36 states, 36 states have (on average 6.333333333333333) internal successors, (228), 36 states have internal predecessors, (228), 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:58:28,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:28,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:28,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:31,343 INFO L116 PetriNetUnfolderBase]: 5696/9997 cut-off events. [2025-04-13 20:58:31,344 INFO L117 PetriNetUnfolderBase]: For 18686/18686 co-relation queries the response was YES. [2025-04-13 20:58:31,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28769 conditions, 9997 events. 5696/9997 cut-off events. For 18686/18686 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 68119 event pairs, 354 based on Foata normal form. 87/7568 useless extension candidates. Maximal degree in co-relation 25680. Up to 1728 conditions per place. [2025-04-13 20:58:31,416 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 168 selfloop transitions, 223 changer transitions 198/591 dead transitions. [2025-04-13 20:58:31,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 591 transitions, 4669 flow [2025-04-13 20:58:31,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:58:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:58:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 614 transitions. [2025-04-13 20:58:31,420 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6091269841269841 [2025-04-13 20:58:31,420 INFO L175 Difference]: Start difference. First operand has 130 places, 136 transitions, 1337 flow. Second operand 48 states and 614 transitions. [2025-04-13 20:58:31,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 591 transitions, 4669 flow [2025-04-13 20:58:31,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 591 transitions, 4489 flow, removed 39 selfloop flow, removed 12 redundant places. [2025-04-13 20:58:31,478 INFO L231 Difference]: Finished difference. Result has 188 places, 245 transitions, 3193 flow [2025-04-13 20:58:31,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3193, PETRI_PLACES=188, PETRI_TRANSITIONS=245} [2025-04-13 20:58:31,479 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 166 predicate places. [2025-04-13 20:58:31,479 INFO L485 AbstractCegarLoop]: Abstraction has has 188 places, 245 transitions, 3193 flow [2025-04-13 20:58:31,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.333333333333333) internal successors, (228), 36 states have internal predecessors, (228), 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:58:31,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:31,479 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:31,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:58:31,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:31,680 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:58:31,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash -511426241, now seen corresponding path program 10 times [2025-04-13 20:58:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:31,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961640637] [2025-04-13 20:58:31,681 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:58:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:31,690 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 20:58:31,698 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:58:31,698 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:58:31,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:58:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:31,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961640637] [2025-04-13 20:58:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961640637] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:31,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191822306] [2025-04-13 20:58:31,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:58:31,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:31,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:31,855 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:58:31,856 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:58:31,906 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 20:58:31,932 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:58:31,932 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:58:31,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:31,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:58:31,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:58:31,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:58:32,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191822306] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:32,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:32,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-13 20:58:32,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215521496] [2025-04-13 20:58:32,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:32,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:58:32,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:32,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:58:32,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:58:32,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:32,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 245 transitions, 3193 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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:58:32,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:32,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:32,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:33,661 INFO L116 PetriNetUnfolderBase]: 8951/15633 cut-off events. [2025-04-13 20:58:33,661 INFO L117 PetriNetUnfolderBase]: For 121737/121737 co-relation queries the response was YES. [2025-04-13 20:58:33,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58902 conditions, 15633 events. 8951/15633 cut-off events. For 121737/121737 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 114085 event pairs, 1352 based on Foata normal form. 14/11727 useless extension candidates. Maximal degree in co-relation 58814. Up to 3844 conditions per place. [2025-04-13 20:58:33,775 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 142 selfloop transitions, 290 changer transitions 0/434 dead transitions. [2025-04-13 20:58:33,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 434 transitions, 6570 flow [2025-04-13 20:58:33,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:58:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:58:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-04-13 20:58:33,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2025-04-13 20:58:33,776 INFO L175 Difference]: Start difference. First operand has 188 places, 245 transitions, 3193 flow. Second operand 7 states and 104 transitions. [2025-04-13 20:58:33,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 434 transitions, 6570 flow [2025-04-13 20:58:34,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 434 transitions, 5939 flow, removed 265 selfloop flow, removed 30 redundant places. [2025-04-13 20:58:34,154 INFO L231 Difference]: Finished difference. Result has 153 places, 384 transitions, 5493 flow [2025-04-13 20:58:34,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2937, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5493, PETRI_PLACES=153, PETRI_TRANSITIONS=384} [2025-04-13 20:58:34,155 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 131 predicate places. [2025-04-13 20:58:34,155 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 384 transitions, 5493 flow [2025-04-13 20:58:34,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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:58:34,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:34,155 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:34,161 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:58:34,356 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,SelfDestructingSolverStorable12 [2025-04-13 20:58:34,356 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:58:34,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash -109657103, now seen corresponding path program 11 times [2025-04-13 20:58:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:34,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456853102] [2025-04-13 20:58:34,357 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:58:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:34,366 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 5 equivalence classes. [2025-04-13 20:58:34,394 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:58:34,394 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 20:58:34,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:58:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:34,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456853102] [2025-04-13 20:58:34,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456853102] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:34,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177058221] [2025-04-13 20:58:34,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:58:34,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:34,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:34,936 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:58:34,938 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:58:34,989 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 5 equivalence classes. [2025-04-13 20:58:35,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:58:35,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 20:58:35,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:35,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 20:58:35,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:58:35,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:35,307 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:58:35,308 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 27 treesize of output 11 [2025-04-13 20:58:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 20:58:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177058221] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:35,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 31 [2025-04-13 20:58:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528684973] [2025-04-13 20:58:35,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:35,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:58:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:35,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:58:35,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:58:35,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:35,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 384 transitions, 5493 flow. Second operand has 33 states, 33 states have (on average 6.424242424242424) internal successors, (212), 33 states have internal predecessors, (212), 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:58:35,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:35,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:35,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:38,245 INFO L116 PetriNetUnfolderBase]: 11166/19503 cut-off events. [2025-04-13 20:58:38,245 INFO L117 PetriNetUnfolderBase]: For 116904/116904 co-relation queries the response was YES. [2025-04-13 20:58:38,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72467 conditions, 19503 events. 11166/19503 cut-off events. For 116904/116904 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 145609 event pairs, 749 based on Foata normal form. 11/14619 useless extension candidates. Maximal degree in co-relation 72395. Up to 3375 conditions per place. [2025-04-13 20:58:38,329 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 264 selfloop transitions, 419 changer transitions 74/759 dead transitions. [2025-04-13 20:58:38,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 759 transitions, 9869 flow [2025-04-13 20:58:38,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 20:58:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-13 20:58:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 532 transitions. [2025-04-13 20:58:38,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-04-13 20:58:38,332 INFO L175 Difference]: Start difference. First operand has 153 places, 384 transitions, 5493 flow. Second operand 42 states and 532 transitions. [2025-04-13 20:58:38,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 759 transitions, 9869 flow [2025-04-13 20:58:38,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 759 transitions, 9762 flow, removed 49 selfloop flow, removed 2 redundant places. [2025-04-13 20:58:38,735 INFO L231 Difference]: Finished difference. Result has 203 places, 489 transitions, 8160 flow [2025-04-13 20:58:38,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5454, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=8160, PETRI_PLACES=203, PETRI_TRANSITIONS=489} [2025-04-13 20:58:38,735 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 181 predicate places. [2025-04-13 20:58:38,735 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 489 transitions, 8160 flow [2025-04-13 20:58:38,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.424242424242424) internal successors, (212), 33 states have internal predecessors, (212), 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:58:38,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:58:38,736 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:58:38,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:58:38,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:58:38,936 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:58:38,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:58:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1553978815, now seen corresponding path program 12 times [2025-04-13 20:58:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:58:38,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740992061] [2025-04-13 20:58:38,937 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:58:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:58:38,948 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 5 equivalence classes. [2025-04-13 20:58:38,973 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:58:38,973 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 20:58:38,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 20:58:39,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:58:39,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740992061] [2025-04-13 20:58:39,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740992061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:58:39,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248627179] [2025-04-13 20:58:39,294 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:58:39,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:58:39,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:58:39,296 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:58:39,299 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:58:39,350 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 5 equivalence classes. [2025-04-13 20:58:39,407 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 20:58:39,407 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 20:58:39,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:58:39,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 20:58:39,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:58:39,521 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:58:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 20:58:39,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:58:40,444 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 42 treesize of output 38 [2025-04-13 20:58:40,460 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:58:40,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2025-04-13 20:58:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 20:58:40,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248627179] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:58:40,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:58:40,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-04-13 20:58:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535310442] [2025-04-13 20:58:40,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:58:40,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:58:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:58:40,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:58:40,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:58:40,587 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:58:40,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 489 transitions, 8160 flow. Second operand has 38 states, 38 states have (on average 6.078947368421052) internal successors, (231), 38 states have internal predecessors, (231), 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:58:40,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:58:40,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:58:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:58:53,541 INFO L116 PetriNetUnfolderBase]: 49569/86361 cut-off events. [2025-04-13 20:58:53,541 INFO L117 PetriNetUnfolderBase]: For 634806/634806 co-relation queries the response was YES. [2025-04-13 20:58:54,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339619 conditions, 86361 events. 49569/86361 cut-off events. For 634806/634806 co-relation queries the response was YES. Maximal size of possible extension queue 2488. Compared 793620 event pairs, 13768 based on Foata normal form. 59/64730 useless extension candidates. Maximal degree in co-relation 325353. Up to 18076 conditions per place. [2025-04-13 20:58:54,413 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 1327 selfloop transitions, 1184 changer transitions 94/2607 dead transitions. [2025-04-13 20:58:54,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 2607 transitions, 45810 flow [2025-04-13 20:58:54,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:58:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:58:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 499 transitions. [2025-04-13 20:58:54,415 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5795586527293844 [2025-04-13 20:58:54,415 INFO L175 Difference]: Start difference. First operand has 203 places, 489 transitions, 8160 flow. Second operand 41 states and 499 transitions. [2025-04-13 20:58:54,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 2607 transitions, 45810 flow [2025-04-13 20:59:00,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 2607 transitions, 40583 flow, removed 753 selfloop flow, removed 14 redundant places. [2025-04-13 20:59:00,964 INFO L231 Difference]: Finished difference. Result has 258 places, 1806 transitions, 32805 flow [2025-04-13 20:59:00,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7045, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=32805, PETRI_PLACES=258, PETRI_TRANSITIONS=1806} [2025-04-13 20:59:00,965 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 236 predicate places. [2025-04-13 20:59:00,965 INFO L485 AbstractCegarLoop]: Abstraction has has 258 places, 1806 transitions, 32805 flow [2025-04-13 20:59:00,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.078947368421052) internal successors, (231), 38 states have internal predecessors, (231), 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:59:00,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:00,966 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:00,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:01,166 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,SelfDestructingSolverStorable14 [2025-04-13 20:59:01,166 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:59:01,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2059175351, now seen corresponding path program 13 times [2025-04-13 20:59:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:01,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159263826] [2025-04-13 20:59:01,167 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:01,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 20:59:01,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:59:01,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:01,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:59:01,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:01,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159263826] [2025-04-13 20:59:01,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159263826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:01,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777664770] [2025-04-13 20:59:01,697 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:01,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:01,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:01,699 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:59:01,702 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:59:01,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 20:59:01,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:59:01,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:01,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:01,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:59:01,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 20:59:02,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:02,156 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:59:02,157 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 28 treesize of output 11 [2025-04-13 20:59:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 20:59:02,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777664770] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:02,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:02,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 37 [2025-04-13 20:59:02,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260191865] [2025-04-13 20:59:02,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:02,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:59:02,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:02,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:59:02,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:59:02,263 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:02,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 1806 transitions, 32805 flow. Second operand has 39 states, 39 states have (on average 6.435897435897436) internal successors, (251), 39 states have internal predecessors, (251), 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:59:02,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:02,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:02,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:32,488 INFO L116 PetriNetUnfolderBase]: 61419/106881 cut-off events. [2025-04-13 20:59:32,488 INFO L117 PetriNetUnfolderBase]: For 1263614/1263614 co-relation queries the response was YES. [2025-04-13 20:59:33,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458569 conditions, 106881 events. 61419/106881 cut-off events. For 1263614/1263614 co-relation queries the response was YES. Maximal size of possible extension queue 3148. Compared 997349 event pairs, 3956 based on Foata normal form. 50/80106 useless extension candidates. Maximal degree in co-relation 443476. Up to 18549 conditions per place. [2025-04-13 20:59:34,025 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 200 selfloop transitions, 2165 changer transitions 88/2455 dead transitions. [2025-04-13 20:59:34,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 2455 transitions, 45929 flow [2025-04-13 20:59:34,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 20:59:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-13 20:59:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 472 transitions. [2025-04-13 20:59:34,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5914786967418546 [2025-04-13 20:59:34,027 INFO L175 Difference]: Start difference. First operand has 258 places, 1806 transitions, 32805 flow. Second operand 38 states and 472 transitions. [2025-04-13 20:59:34,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 2455 transitions, 45929 flow [2025-04-13 20:59:49,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 2455 transitions, 42314 flow, removed 1802 selfloop flow, removed 5 redundant places. [2025-04-13 20:59:49,943 INFO L231 Difference]: Finished difference. Result has 310 places, 2211 transitions, 44830 flow [2025-04-13 20:59:49,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=29908, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1768, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=44830, PETRI_PLACES=310, PETRI_TRANSITIONS=2211} [2025-04-13 20:59:49,944 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 288 predicate places. [2025-04-13 20:59:49,944 INFO L485 AbstractCegarLoop]: Abstraction has has 310 places, 2211 transitions, 44830 flow [2025-04-13 20:59:49,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.435897435897436) internal successors, (251), 39 states have internal predecessors, (251), 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:59:49,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:49,945 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:49,950 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:59:50,145 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,SelfDestructingSolverStorable15 [2025-04-13 20:59:50,145 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:59:50,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1691565369, now seen corresponding path program 14 times [2025-04-13 20:59:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:50,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427007918] [2025-04-13 20:59:50,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:50,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:59:50,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:59:50,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:50,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 20:59:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:50,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427007918] [2025-04-13 20:59:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427007918] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:50,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892866201] [2025-04-13 20:59:50,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:50,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:50,272 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:59:50,275 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:59:50,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 20:59:50,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:59:50,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:50,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:50,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:59:50,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 20:59:50,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 20:59:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892866201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:50,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2025-04-13 20:59:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964273101] [2025-04-13 20:59:50,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:50,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:50,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:50,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:50,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:50,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 2211 transitions, 44830 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:59:50,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:50,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:50,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:55,126 INFO L116 PetriNetUnfolderBase]: 101051/175643 cut-off events. [2025-04-13 21:00:55,127 INFO L117 PetriNetUnfolderBase]: For 2758607/2758607 co-relation queries the response was YES. [2025-04-13 21:00:57,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821983 conditions, 175643 events. 101051/175643 cut-off events. For 2758607/2758607 co-relation queries the response was YES. Maximal size of possible extension queue 4849. Compared 1744064 event pairs, 13264 based on Foata normal form. 70/131685 useless extension candidates. Maximal degree in co-relation 821845. Up to 42217 conditions per place. [2025-04-13 21:00:58,236 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 829 selfloop transitions, 2787 changer transitions 0/3618 dead transitions. [2025-04-13 21:00:58,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 3618 transitions, 80108 flow [2025-04-13 21:00:58,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:00:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 21:00:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2025-04-13 21:00:58,237 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-04-13 21:00:58,237 INFO L175 Difference]: Start difference. First operand has 310 places, 2211 transitions, 44830 flow. Second operand 8 states and 120 transitions. [2025-04-13 21:00:58,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 3618 transitions, 80108 flow [2025-04-13 21:01:38,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 3618 transitions, 77920 flow, removed 825 selfloop flow, removed 18 redundant places. [2025-04-13 21:01:38,195 INFO L231 Difference]: Finished difference. Result has 304 places, 3558 transitions, 82172 flow [2025-04-13 21:01:38,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=43904, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1784, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=82172, PETRI_PLACES=304, PETRI_TRANSITIONS=3558} [2025-04-13 21:01:38,198 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 282 predicate places. [2025-04-13 21:01:38,198 INFO L485 AbstractCegarLoop]: Abstraction has has 304 places, 3558 transitions, 82172 flow [2025-04-13 21:01:38,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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 21:01:38,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:01:38,198 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:01:38,205 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 21:01:38,402 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,SelfDestructingSolverStorable16 [2025-04-13 21:01:38,402 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:01:38,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:01:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1806592917, now seen corresponding path program 15 times [2025-04-13 21:01:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:01:38,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072131549] [2025-04-13 21:01:38,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:01:38,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:01:38,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-04-13 21:01:38,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 21:01:38,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:01:38,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:01:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 41 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 21:01:38,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:01:38,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072131549] [2025-04-13 21:01:38,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072131549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:01:38,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237968977] [2025-04-13 21:01:38,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:01:38,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:01:38,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:01:38,590 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 21:01:38,592 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 21:01:38,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-04-13 21:01:38,831 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 21:01:38,831 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:01:38,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:01:38,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 21:01:38,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:01:38,902 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 19 treesize of output 1 [2025-04-13 21:01:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 21:01:39,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:01:39,587 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 43 treesize of output 39 [2025-04-13 21:01:39,593 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:01:39,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 47 [2025-04-13 21:01:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 21:01:39,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237968977] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:01:39,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:01:39,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 36 [2025-04-13 21:01:39,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627460548] [2025-04-13 21:01:39,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:01:39,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 21:01:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:01:39,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 21:01:39,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 21:01:39,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 21:01:39,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 3558 transitions, 82172 flow. Second operand has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 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 21:01:39,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:01:39,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 21:01:39,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand