/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:32:39,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:32:39,985 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:32:39,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:32:39,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:32:40,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:32:40,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:32:40,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:32:40,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:32:40,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:32:40,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:32:40,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:32:40,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:32:40,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:32:40,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:32:40,016 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:32:40,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:32:40,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:32:40,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:32:40,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:32:40,018 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:32:40,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:32:40,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:32:40,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:32:40,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:32:40,275 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:32:40,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2025-04-13 20:32:41,578 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fddd338/8b850b28bfaf48eebfa4234148a3043d/FLAG9779b50c0 [2025-04-13 20:32:41,788 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:32:41,788 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2025-04-13 20:32:41,799 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fddd338/8b850b28bfaf48eebfa4234148a3043d/FLAG9779b50c0 [2025-04-13 20:32:42,579 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fddd338/8b850b28bfaf48eebfa4234148a3043d [2025-04-13 20:32:42,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:32:42,583 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:32:42,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:32:42,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:32:42,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:32:42,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589ccd34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42, skipping insertion in model container [2025-04-13 20:32:42,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:32:42,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2025-04-13 20:32:42,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:32:42,755 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:32:42,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2025-04-13 20:32:42,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:32:42,796 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:32:42,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42 WrapperNode [2025-04-13 20:32:42,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:32:42,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:32:42,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:32:42,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:32:42,805 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:32:42" (1/1) ... [2025-04-13 20:32:42,812 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:32:42" (1/1) ... [2025-04-13 20:32:42,844 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-04-13 20:32:42,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:32:42,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:32:42,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:32:42,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:32:42,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,880 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 20:32:42,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:32:42,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:32:42,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:32:42,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:32:42,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (1/1) ... [2025-04-13 20:32:42,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:32:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:42,940 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:32:42,946 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:32:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:32:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:32:42,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:32:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:32:42,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:32:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:32:42,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:32:42,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:32:42,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:32:42,967 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:32:43,050 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:32:43,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:32:43,394 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:32:43,395 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:32:43,395 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:32:43,744 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:32:43,746 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:32:43,747 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:32:43,750 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:32:43,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:32:43 BoogieIcfgContainer [2025-04-13 20:32:43,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:32:43,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:32:43,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:32:43,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:32:43,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:32:42" (1/3) ... [2025-04-13 20:32:43,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d37197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:32:43, skipping insertion in model container [2025-04-13 20:32:43,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:32:42" (2/3) ... [2025-04-13 20:32:43,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d37197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:32:43, skipping insertion in model container [2025-04-13 20:32:43,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:32:43" (3/3) ... [2025-04-13 20:32:43,759 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-04-13 20:32:43,771 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:32:43,774 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 27 locations, 31 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 20:32:43,774 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:32:43,827 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:32:43,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 89 flow [2025-04-13 20:32:43,884 INFO L116 PetriNetUnfolderBase]: 8/31 cut-off events. [2025-04-13 20:32:43,886 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:32:43,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 8/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-13 20:32:43,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 89 flow [2025-04-13 20:32:43,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 30 transitions, 78 flow [2025-04-13 20:32:43,903 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:32:43,914 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;@4745e598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:32:43,914 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:32:43,928 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:32:43,928 INFO L116 PetriNetUnfolderBase]: 8/29 cut-off events. [2025-04-13 20:32:43,928 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:32:43,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:43,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:43,929 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:43,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1022222819, now seen corresponding path program 1 times [2025-04-13 20:32:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:43,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252386987] [2025-04-13 20:32:43,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:44,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:32:44,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:32:44,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:44,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:44,248 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:32:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:44,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252386987] [2025-04-13 20:32:44,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252386987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:44,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:44,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:32:44,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294714655] [2025-04-13 20:32:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:44,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:32:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:44,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:32:44,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:32:44,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:44,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 78 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:32:44,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:44,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:44,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:44,431 INFO L116 PetriNetUnfolderBase]: 512/705 cut-off events. [2025-04-13 20:32:44,431 INFO L117 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-04-13 20:32:44,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 705 events. 512/705 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1970 event pairs, 306 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1304. Up to 701 conditions per place. [2025-04-13 20:32:44,442 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2025-04-13 20:32:44,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 134 flow [2025-04-13 20:32:44,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:32:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:32:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-13 20:32:44,451 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2025-04-13 20:32:44,453 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 78 flow. Second operand 3 states and 39 transitions. [2025-04-13 20:32:44,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 134 flow [2025-04-13 20:32:44,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:32:44,459 INFO L231 Difference]: Finished difference. Result has 28 places, 29 transitions, 66 flow [2025-04-13 20:32:44,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=28, PETRI_TRANSITIONS=29} [2025-04-13 20:32:44,465 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2025-04-13 20:32:44,466 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 29 transitions, 66 flow [2025-04-13 20:32:44,466 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:32:44,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:44,466 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:32:44,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:32:44,466 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:44,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1061629354, now seen corresponding path program 1 times [2025-04-13 20:32:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:44,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509084780] [2025-04-13 20:32:44,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:44,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:32:44,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:32:44,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:44,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:44,581 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:32:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:44,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509084780] [2025-04-13 20:32:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509084780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:44,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:44,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:32:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309882706] [2025-04-13 20:32:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:44,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:32:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:44,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:32:44,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:32:44,583 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:44,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:44,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:44,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:44,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:44,720 INFO L116 PetriNetUnfolderBase]: 475/668 cut-off events. [2025-04-13 20:32:44,721 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:32:44,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 668 events. 475/668 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1867 event pairs, 306 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 1347. Up to 664 conditions per place. [2025-04-13 20:32:44,726 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 27 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2025-04-13 20:32:44,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 120 flow [2025-04-13 20:32:44,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:32:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:32:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 20:32:44,728 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2025-04-13 20:32:44,728 INFO L175 Difference]: Start difference. First operand has 28 places, 29 transitions, 66 flow. Second operand 3 states and 38 transitions. [2025-04-13 20:32:44,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 120 flow [2025-04-13 20:32:44,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:32:44,729 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 65 flow [2025-04-13 20:32:44,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2025-04-13 20:32:44,730 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2025-04-13 20:32:44,730 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 65 flow [2025-04-13 20:32:44,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:44,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:44,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:44,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:32:44,730 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:44,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash -31447463, now seen corresponding path program 1 times [2025-04-13 20:32:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:44,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063109618] [2025-04-13 20:32:44,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:44,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:32:44,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:32:44,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:44,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:44,928 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:32:44,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:44,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063109618] [2025-04-13 20:32:44,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063109618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:44,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:44,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:32:44,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923110890] [2025-04-13 20:32:44,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:44,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:32:44,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:44,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:32:44,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:32:44,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:44,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:32:44,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:44,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:44,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:45,076 INFO L116 PetriNetUnfolderBase]: 475/671 cut-off events. [2025-04-13 20:32:45,076 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:32:45,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 671 events. 475/671 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1869 event pairs, 306 based on Foata normal form. 3/505 useless extension candidates. Maximal degree in co-relation 1347. Up to 669 conditions per place. [2025-04-13 20:32:45,079 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 26 selfloop transitions, 4 changer transitions 1/31 dead transitions. [2025-04-13 20:32:45,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 133 flow [2025-04-13 20:32:45,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:32:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:32:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-13 20:32:45,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3382352941176471 [2025-04-13 20:32:45,080 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 65 flow. Second operand 4 states and 46 transitions. [2025-04-13 20:32:45,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 133 flow [2025-04-13 20:32:45,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:32:45,083 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 90 flow [2025-04-13 20:32:45,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-04-13 20:32:45,085 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-04-13 20:32:45,085 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 90 flow [2025-04-13 20:32:45,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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:32:45,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:45,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:45,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:32:45,085 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:45,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash -352739301, now seen corresponding path program 1 times [2025-04-13 20:32:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:45,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446194492] [2025-04-13 20:32:45,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:45,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:32:45,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:45,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:45,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:46,454 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:32:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:46,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446194492] [2025-04-13 20:32:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446194492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:46,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9756170] [2025-04-13 20:32:46,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:46,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:46,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:46,458 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:32:46,459 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:32:46,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:32:46,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:46,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:46,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:46,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:32:46,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:46,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:32:46,623 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:32:46,662 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:32:46,662 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 11 treesize of output 11 [2025-04-13 20:32:46,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:32:46,949 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:32:46,956 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:32:46,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:47,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9756170] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:47,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:32:47,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 20:32:47,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29251807] [2025-04-13 20:32:47,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:47,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:32:47,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:47,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:32:47,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:32:47,194 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:47,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:32:47,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:47,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:47,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:47,835 INFO L116 PetriNetUnfolderBase]: 861/1257 cut-off events. [2025-04-13 20:32:47,836 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-13 20:32:47,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1257 events. 861/1257 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4884 event pairs, 7 based on Foata normal form. 1/1002 useless extension candidates. Maximal degree in co-relation 2554. Up to 773 conditions per place. [2025-04-13 20:32:47,841 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 91 selfloop transitions, 30 changer transitions 1/122 dead transitions. [2025-04-13 20:32:47,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 122 transitions, 539 flow [2025-04-13 20:32:47,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:32:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:32:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2025-04-13 20:32:47,842 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-04-13 20:32:47,842 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 90 flow. Second operand 11 states and 154 transitions. [2025-04-13 20:32:47,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 122 transitions, 539 flow [2025-04-13 20:32:47,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 122 transitions, 531 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:32:47,845 INFO L231 Difference]: Finished difference. Result has 45 places, 58 transitions, 243 flow [2025-04-13 20:32:47,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=243, PETRI_PLACES=45, PETRI_TRANSITIONS=58} [2025-04-13 20:32:47,845 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2025-04-13 20:32:47,845 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 58 transitions, 243 flow [2025-04-13 20:32:47,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:32:47,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:47,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:47,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:32:48,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:48,050 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:48,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:48,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1963052953, now seen corresponding path program 2 times [2025-04-13 20:32:48,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:48,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455462945] [2025-04-13 20:32:48,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:32:48,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:48,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:48,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:32:48,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:32:48,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:48,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:48,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455462945] [2025-04-13 20:32:48,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455462945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:48,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:48,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:32:48,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480935731] [2025-04-13 20:32:48,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:48,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:32:48,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:48,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:32:48,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:32:48,530 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:48,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 58 transitions, 243 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:32:48,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:48,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:48,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:48,869 INFO L116 PetriNetUnfolderBase]: 914/1349 cut-off events. [2025-04-13 20:32:48,869 INFO L117 PetriNetUnfolderBase]: For 583/583 co-relation queries the response was YES. [2025-04-13 20:32:48,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3808 conditions, 1349 events. 914/1349 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5288 event pairs, 141 based on Foata normal form. 1/1150 useless extension candidates. Maximal degree in co-relation 3773. Up to 1190 conditions per place. [2025-04-13 20:32:48,876 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 74 selfloop transitions, 26 changer transitions 1/101 dead transitions. [2025-04-13 20:32:48,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 101 transitions, 595 flow [2025-04-13 20:32:48,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:32:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:32:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2025-04-13 20:32:48,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3058823529411765 [2025-04-13 20:32:48,879 INFO L175 Difference]: Start difference. First operand has 45 places, 58 transitions, 243 flow. Second operand 10 states and 104 transitions. [2025-04-13 20:32:48,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 101 transitions, 595 flow [2025-04-13 20:32:48,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 595 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:32:48,885 INFO L231 Difference]: Finished difference. Result has 60 places, 76 transitions, 426 flow [2025-04-13 20:32:48,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=426, PETRI_PLACES=60, PETRI_TRANSITIONS=76} [2025-04-13 20:32:48,885 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2025-04-13 20:32:48,885 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 76 transitions, 426 flow [2025-04-13 20:32:48,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:32:48,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:48,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:48,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:32:48,886 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:48,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1177881695, now seen corresponding path program 3 times [2025-04-13 20:32:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:48,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868016916] [2025-04-13 20:32:48,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:32:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:48,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:48,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:32:48,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:32:48,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:49,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:49,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868016916] [2025-04-13 20:32:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868016916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 20:32:49,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35236810] [2025-04-13 20:32:49,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:49,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:32:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:49,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:32:49,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:32:49,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:49,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 76 transitions, 426 flow. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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:32:49,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:49,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:49,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:50,155 INFO L116 PetriNetUnfolderBase]: 1024/1517 cut-off events. [2025-04-13 20:32:50,155 INFO L117 PetriNetUnfolderBase]: For 1343/1343 co-relation queries the response was YES. [2025-04-13 20:32:50,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 1517 events. 1024/1517 cut-off events. For 1343/1343 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6216 event pairs, 133 based on Foata normal form. 1/1298 useless extension candidates. Maximal degree in co-relation 4943. Up to 1320 conditions per place. [2025-04-13 20:32:50,175 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 90 selfloop transitions, 56 changer transitions 4/150 dead transitions. [2025-04-13 20:32:50,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 150 transitions, 1071 flow [2025-04-13 20:32:50,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:32:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:32:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2025-04-13 20:32:50,179 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2025-04-13 20:32:50,179 INFO L175 Difference]: Start difference. First operand has 60 places, 76 transitions, 426 flow. Second operand 12 states and 132 transitions. [2025-04-13 20:32:50,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 150 transitions, 1071 flow [2025-04-13 20:32:50,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 1051 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-13 20:32:50,188 INFO L231 Difference]: Finished difference. Result has 78 places, 114 transitions, 852 flow [2025-04-13 20:32:50,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=852, PETRI_PLACES=78, PETRI_TRANSITIONS=114} [2025-04-13 20:32:50,190 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2025-04-13 20:32:50,190 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 114 transitions, 852 flow [2025-04-13 20:32:50,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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:32:50,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:50,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:50,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:32:50,191 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:50,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 395929599, now seen corresponding path program 4 times [2025-04-13 20:32:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:50,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327828615] [2025-04-13 20:32:50,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:32:50,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:50,197 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:50,213 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:50,213 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:32:50,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:50,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:50,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327828615] [2025-04-13 20:32:50,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327828615] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:50,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468357982] [2025-04-13 20:32:50,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:32:50,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:50,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:50,774 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:32:50,776 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:32:50,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:50,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:50,852 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:32:50,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:50,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:32:50,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:50,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:32:50,888 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:32:50,915 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:32:50,916 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 11 treesize of output 11 [2025-04-13 20:32:50,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:32:51,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:32:51,150 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:32:51,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468357982] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:51,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:32:51,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 25 [2025-04-13 20:32:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854307832] [2025-04-13 20:32:51,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:51,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:32:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:51,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:32:51,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:32:51,374 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:51,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 114 transitions, 852 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:32:51,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:51,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:51,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:52,107 INFO L116 PetriNetUnfolderBase]: 1383/2050 cut-off events. [2025-04-13 20:32:52,107 INFO L117 PetriNetUnfolderBase]: For 3680/3680 co-relation queries the response was YES. [2025-04-13 20:32:52,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8336 conditions, 2050 events. 1383/2050 cut-off events. For 3680/3680 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8991 event pairs, 161 based on Foata normal form. 1/1784 useless extension candidates. Maximal degree in co-relation 8282. Up to 1486 conditions per place. [2025-04-13 20:32:52,121 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 130 selfloop transitions, 112 changer transitions 1/243 dead transitions. [2025-04-13 20:32:52,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 243 transitions, 2141 flow [2025-04-13 20:32:52,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:32:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:32:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2025-04-13 20:32:52,123 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3755656108597285 [2025-04-13 20:32:52,123 INFO L175 Difference]: Start difference. First operand has 78 places, 114 transitions, 852 flow. Second operand 13 states and 166 transitions. [2025-04-13 20:32:52,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 243 transitions, 2141 flow [2025-04-13 20:32:52,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 243 transitions, 2103 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-04-13 20:32:52,145 INFO L231 Difference]: Finished difference. Result has 97 places, 191 transitions, 1784 flow [2025-04-13 20:32:52,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1784, PETRI_PLACES=97, PETRI_TRANSITIONS=191} [2025-04-13 20:32:52,146 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2025-04-13 20:32:52,146 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 191 transitions, 1784 flow [2025-04-13 20:32:52,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:32:52,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:52,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:52,153 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:32:52,350 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:32:52,350 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:52,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash 676412003, now seen corresponding path program 5 times [2025-04-13 20:32:52,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:52,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311231955] [2025-04-13 20:32:52,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:32:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:52,367 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:52,387 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:52,387 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:32:52,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:52,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311231955] [2025-04-13 20:32:52,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311231955] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:52,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153254127] [2025-04-13 20:32:52,805 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:32:52,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:52,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:52,807 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:32:52,809 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:32:52,867 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:52,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:52,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:32:52,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:52,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:32:52,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:52,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:32:52,930 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:32:52,954 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:32:52,954 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 11 treesize of output 11 [2025-04-13 20:32:52,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:32:53,181 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:32:53,186 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:32:53,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:53,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153254127] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:53,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:32:53,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 25 [2025-04-13 20:32:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639874874] [2025-04-13 20:32:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:53,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:32:53,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:53,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:32:53,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:32:53,366 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:53,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 191 transitions, 1784 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:32:53,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:53,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:53,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:54,169 INFO L116 PetriNetUnfolderBase]: 1522/2258 cut-off events. [2025-04-13 20:32:54,170 INFO L117 PetriNetUnfolderBase]: For 6792/6792 co-relation queries the response was YES. [2025-04-13 20:32:54,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11217 conditions, 2258 events. 1522/2258 cut-off events. For 6792/6792 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10126 event pairs, 74 based on Foata normal form. 1/1959 useless extension candidates. Maximal degree in co-relation 11152. Up to 1366 conditions per place. [2025-04-13 20:32:54,185 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 119 selfloop transitions, 167 changer transitions 1/287 dead transitions. [2025-04-13 20:32:54,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 287 transitions, 3004 flow [2025-04-13 20:32:54,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:32:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:32:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 182 transitions. [2025-04-13 20:32:54,186 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2025-04-13 20:32:54,186 INFO L175 Difference]: Start difference. First operand has 97 places, 191 transitions, 1784 flow. Second operand 14 states and 182 transitions. [2025-04-13 20:32:54,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 287 transitions, 3004 flow [2025-04-13 20:32:54,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 287 transitions, 2902 flow, removed 51 selfloop flow, removed 0 redundant places. [2025-04-13 20:32:54,217 INFO L231 Difference]: Finished difference. Result has 118 places, 229 transitions, 2591 flow [2025-04-13 20:32:54,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2591, PETRI_PLACES=118, PETRI_TRANSITIONS=229} [2025-04-13 20:32:54,217 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2025-04-13 20:32:54,217 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 229 transitions, 2591 flow [2025-04-13 20:32:54,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:32:54,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:54,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:54,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:32:54,418 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:32:54,418 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:54,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash 27453931, now seen corresponding path program 6 times [2025-04-13 20:32:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:54,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398768994] [2025-04-13 20:32:54,419 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:32:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:54,427 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:54,434 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:32:54,434 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:32:54,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:54,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398768994] [2025-04-13 20:32:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398768994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:54,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:54,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:32:54,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220044464] [2025-04-13 20:32:54,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:54,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:32:54,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:54,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:32:54,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:32:54,709 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:54,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 229 transitions, 2591 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:32:54,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:54,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:54,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:55,308 INFO L116 PetriNetUnfolderBase]: 1717/2576 cut-off events. [2025-04-13 20:32:55,308 INFO L117 PetriNetUnfolderBase]: For 12777/12777 co-relation queries the response was YES. [2025-04-13 20:32:55,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15593 conditions, 2576 events. 1717/2576 cut-off events. For 12777/12777 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12304 event pairs, 76 based on Foata normal form. 1/2242 useless extension candidates. Maximal degree in co-relation 15516. Up to 2048 conditions per place. [2025-04-13 20:32:55,331 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 225 selfloop transitions, 138 changer transitions 3/366 dead transitions. [2025-04-13 20:32:55,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 366 transitions, 4662 flow [2025-04-13 20:32:55,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:32:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:32:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2025-04-13 20:32:55,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2025-04-13 20:32:55,332 INFO L175 Difference]: Start difference. First operand has 118 places, 229 transitions, 2591 flow. Second operand 10 states and 127 transitions. [2025-04-13 20:32:55,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 366 transitions, 4662 flow [2025-04-13 20:32:55,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 366 transitions, 4409 flow, removed 100 selfloop flow, removed 3 redundant places. [2025-04-13 20:32:55,400 INFO L231 Difference]: Finished difference. Result has 128 places, 305 transitions, 3761 flow [2025-04-13 20:32:55,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2422, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3761, PETRI_PLACES=128, PETRI_TRANSITIONS=305} [2025-04-13 20:32:55,401 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2025-04-13 20:32:55,401 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 305 transitions, 3761 flow [2025-04-13 20:32:55,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:32:55,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:55,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:55,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:32:55,401 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:55,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash -617736979, now seen corresponding path program 7 times [2025-04-13 20:32:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:55,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873915022] [2025-04-13 20:32:55,402 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:32:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:55,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:32:55,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:55,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:55,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:56,055 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:32:56,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:56,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873915022] [2025-04-13 20:32:56,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873915022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:56,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025687271] [2025-04-13 20:32:56,056 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:32:56,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:56,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:56,058 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:32:56,060 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:32:56,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:32:56,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:56,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:56,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:56,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:32:56,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:56,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:32:56,162 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:32:56,186 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:32:56,186 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 11 treesize of output 11 [2025-04-13 20:32:56,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:32:56,396 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:56,396 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2025-04-13 20:32:56,424 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:32:56,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:56,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025687271] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:56,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:32:56,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 20:32:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475800695] [2025-04-13 20:32:56,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:56,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:32:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:56,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:32:56,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:32:56,629 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:56,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 305 transitions, 3761 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:32:56,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:56,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:56,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:57,482 INFO L116 PetriNetUnfolderBase]: 1967/2955 cut-off events. [2025-04-13 20:32:57,482 INFO L117 PetriNetUnfolderBase]: For 18794/18794 co-relation queries the response was YES. [2025-04-13 20:32:57,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19031 conditions, 2955 events. 1967/2955 cut-off events. For 18794/18794 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14483 event pairs, 101 based on Foata normal form. 1/2637 useless extension candidates. Maximal degree in co-relation 18948. Up to 1424 conditions per place. [2025-04-13 20:32:57,511 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 155 selfloop transitions, 239 changer transitions 2/396 dead transitions. [2025-04-13 20:32:57,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 396 transitions, 5380 flow [2025-04-13 20:32:57,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:32:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:32:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 188 transitions. [2025-04-13 20:32:57,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3949579831932773 [2025-04-13 20:32:57,513 INFO L175 Difference]: Start difference. First operand has 128 places, 305 transitions, 3761 flow. Second operand 14 states and 188 transitions. [2025-04-13 20:32:57,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 396 transitions, 5380 flow [2025-04-13 20:32:57,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 396 transitions, 5129 flow, removed 100 selfloop flow, removed 3 redundant places. [2025-04-13 20:32:57,605 INFO L231 Difference]: Finished difference. Result has 143 places, 336 transitions, 4704 flow [2025-04-13 20:32:57,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3650, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4704, PETRI_PLACES=143, PETRI_TRANSITIONS=336} [2025-04-13 20:32:57,607 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2025-04-13 20:32:57,607 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 336 transitions, 4704 flow [2025-04-13 20:32:57,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:32:57,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:57,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:57,617 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:32:57,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:57,808 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:57,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:57,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1578511191, now seen corresponding path program 8 times [2025-04-13 20:32:57,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:57,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66748244] [2025-04-13 20:32:57,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:32:57,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:57,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:57,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:32:57,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:32:57,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:58,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66748244] [2025-04-13 20:32:58,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66748244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:58,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:58,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:32:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145296882] [2025-04-13 20:32:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:58,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:32:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:58,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:32:58,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:32:58,095 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:58,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 336 transitions, 4704 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:32:58,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:58,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:58,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:58,694 INFO L116 PetriNetUnfolderBase]: 2084/3183 cut-off events. [2025-04-13 20:32:58,694 INFO L117 PetriNetUnfolderBase]: For 22362/22362 co-relation queries the response was YES. [2025-04-13 20:32:58,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22174 conditions, 3183 events. 2084/3183 cut-off events. For 22362/22362 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 16212 event pairs, 209 based on Foata normal form. 1/2823 useless extension candidates. Maximal degree in co-relation 22084. Up to 2765 conditions per place. [2025-04-13 20:32:58,719 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 294 selfloop transitions, 130 changer transitions 3/427 dead transitions. [2025-04-13 20:32:58,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 427 transitions, 6632 flow [2025-04-13 20:32:58,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:32:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:32:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-04-13 20:32:58,720 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-04-13 20:32:58,720 INFO L175 Difference]: Start difference. First operand has 143 places, 336 transitions, 4704 flow. Second operand 10 states and 125 transitions. [2025-04-13 20:32:58,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 427 transitions, 6632 flow [2025-04-13 20:32:58,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 427 transitions, 6360 flow, removed 74 selfloop flow, removed 6 redundant places. [2025-04-13 20:32:58,850 INFO L231 Difference]: Finished difference. Result has 150 places, 383 transitions, 5627 flow [2025-04-13 20:32:58,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4483, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5627, PETRI_PLACES=150, PETRI_TRANSITIONS=383} [2025-04-13 20:32:58,850 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2025-04-13 20:32:58,850 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 383 transitions, 5627 flow [2025-04-13 20:32:58,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:32:58,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:58,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:58,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:32:58,851 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:58,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 396033941, now seen corresponding path program 9 times [2025-04-13 20:32:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:58,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714193231] [2025-04-13 20:32:58,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:32:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:58,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:58,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:32:58,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:32:58,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:59,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714193231] [2025-04-13 20:32:59,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714193231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:59,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:59,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:32:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126270621] [2025-04-13 20:32:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:59,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:32:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:59,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:32:59,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:32:59,270 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:32:59,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 383 transitions, 5627 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:32:59,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:59,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:32:59,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:00,002 INFO L116 PetriNetUnfolderBase]: 2126/3251 cut-off events. [2025-04-13 20:33:00,002 INFO L117 PetriNetUnfolderBase]: For 26859/26859 co-relation queries the response was YES. [2025-04-13 20:33:00,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23539 conditions, 3251 events. 2126/3251 cut-off events. For 26859/26859 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 16691 event pairs, 203 based on Foata normal form. 1/3066 useless extension candidates. Maximal degree in co-relation 23443. Up to 2881 conditions per place. [2025-04-13 20:33:00,032 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 318 selfloop transitions, 122 changer transitions 3/443 dead transitions. [2025-04-13 20:33:00,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 443 transitions, 7071 flow [2025-04-13 20:33:00,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2025-04-13 20:33:00,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3588235294117647 [2025-04-13 20:33:00,034 INFO L175 Difference]: Start difference. First operand has 150 places, 383 transitions, 5627 flow. Second operand 10 states and 122 transitions. [2025-04-13 20:33:00,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 443 transitions, 7071 flow [2025-04-13 20:33:00,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 443 transitions, 6831 flow, removed 65 selfloop flow, removed 4 redundant places. [2025-04-13 20:33:00,181 INFO L231 Difference]: Finished difference. Result has 158 places, 402 transitions, 6006 flow [2025-04-13 20:33:00,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5387, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6006, PETRI_PLACES=158, PETRI_TRANSITIONS=402} [2025-04-13 20:33:00,183 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 126 predicate places. [2025-04-13 20:33:00,184 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 402 transitions, 6006 flow [2025-04-13 20:33:00,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:00,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:00,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:00,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:33:00,184 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:00,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1301454891, now seen corresponding path program 10 times [2025-04-13 20:33:00,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:00,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268960156] [2025-04-13 20:33:00,185 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:33:00,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:00,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:00,206 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:00,206 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:33:00,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:00,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268960156] [2025-04-13 20:33:00,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268960156] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:00,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360474823] [2025-04-13 20:33:00,595 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:33:00,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:00,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:00,597 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:33:00,599 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:33:00,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:00,668 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:00,668 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:33:00,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:00,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:33:00,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:00,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:33:00,696 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:33:00,717 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:33:00,718 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 11 treesize of output 11 [2025-04-13 20:33:00,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:33:00,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:33:00,899 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:33:00,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360474823] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 25 [2025-04-13 20:33:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340500517] [2025-04-13 20:33:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:01,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:33:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:01,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:33:01,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:33:01,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:01,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 402 transitions, 6006 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:01,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:01,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:01,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:01,838 INFO L116 PetriNetUnfolderBase]: 2470/3797 cut-off events. [2025-04-13 20:33:01,839 INFO L117 PetriNetUnfolderBase]: For 32190/32190 co-relation queries the response was YES. [2025-04-13 20:33:01,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28760 conditions, 3797 events. 2470/3797 cut-off events. For 32190/32190 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 20214 event pairs, 245 based on Foata normal form. 1/3590 useless extension candidates. Maximal degree in co-relation 28660. Up to 3067 conditions per place. [2025-04-13 20:33:01,869 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 394 selfloop transitions, 146 changer transitions 4/544 dead transitions. [2025-04-13 20:33:01,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 544 transitions, 9143 flow [2025-04-13 20:33:01,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:33:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:33:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2025-04-13 20:33:01,870 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2025-04-13 20:33:01,870 INFO L175 Difference]: Start difference. First operand has 158 places, 402 transitions, 6006 flow. Second operand 9 states and 121 transitions. [2025-04-13 20:33:01,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 544 transitions, 9143 flow [2025-04-13 20:33:02,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 544 transitions, 8871 flow, removed 53 selfloop flow, removed 5 redundant places. [2025-04-13 20:33:02,069 INFO L231 Difference]: Finished difference. Result has 166 places, 468 transitions, 7374 flow [2025-04-13 20:33:02,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5800, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7374, PETRI_PLACES=166, PETRI_TRANSITIONS=468} [2025-04-13 20:33:02,069 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 134 predicate places. [2025-04-13 20:33:02,069 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 468 transitions, 7374 flow [2025-04-13 20:33:02,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:02,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:02,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:02,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:33:02,270 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,SelfDestructingSolverStorable12 [2025-04-13 20:33:02,270 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:02,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 32770715, now seen corresponding path program 11 times [2025-04-13 20:33:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:02,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279910223] [2025-04-13 20:33:02,271 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:33:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:02,276 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:02,284 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:02,284 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:02,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:02,813 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:33:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:02,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279910223] [2025-04-13 20:33:02,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279910223] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:02,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720825618] [2025-04-13 20:33:02,813 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:33:02,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:02,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:02,815 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:33:02,816 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:33:02,861 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:02,881 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:02,881 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:02,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:02,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:33:02,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:02,931 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:33:03,116 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:03,116 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 19 [2025-04-13 20:33:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:03,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720825618] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 9] total 24 [2025-04-13 20:33:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138403412] [2025-04-13 20:33:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:03,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:33:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:03,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:33:03,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:33:03,289 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:03,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 468 transitions, 7374 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:33:03,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:03,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:03,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:04,134 INFO L116 PetriNetUnfolderBase]: 2470/3796 cut-off events. [2025-04-13 20:33:04,134 INFO L117 PetriNetUnfolderBase]: For 34085/34085 co-relation queries the response was YES. [2025-04-13 20:33:04,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29789 conditions, 3796 events. 2470/3796 cut-off events. For 34085/34085 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 20227 event pairs, 230 based on Foata normal form. 1/3589 useless extension candidates. Maximal degree in co-relation 29682. Up to 3075 conditions per place. [2025-04-13 20:33:04,174 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 400 selfloop transitions, 166 changer transitions 4/570 dead transitions. [2025-04-13 20:33:04,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 570 transitions, 9802 flow [2025-04-13 20:33:04,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2025-04-13 20:33:04,179 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2025-04-13 20:33:04,179 INFO L175 Difference]: Start difference. First operand has 166 places, 468 transitions, 7374 flow. Second operand 10 states and 137 transitions. [2025-04-13 20:33:04,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 570 transitions, 9802 flow [2025-04-13 20:33:04,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 570 transitions, 9755 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:33:04,435 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 8507 flow [2025-04-13 20:33:04,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=7313, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8507, PETRI_PLACES=178, PETRI_TRANSITIONS=503} [2025-04-13 20:33:04,436 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2025-04-13 20:33:04,436 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 8507 flow [2025-04-13 20:33:04,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:33:04,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:04,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:04,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:33:04,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:04,637 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:04,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1898449071, now seen corresponding path program 12 times [2025-04-13 20:33:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:04,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356572846] [2025-04-13 20:33:04,638 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:33:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:04,644 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:04,656 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:04,656 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:33:04,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:04,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356572846] [2025-04-13 20:33:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356572846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117740037] [2025-04-13 20:33:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:04,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:04,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:04,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:04,976 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:04,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 503 transitions, 8507 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:04,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:04,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:04,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:05,717 INFO L116 PetriNetUnfolderBase]: 2684/4121 cut-off events. [2025-04-13 20:33:05,717 INFO L117 PetriNetUnfolderBase]: For 42273/42273 co-relation queries the response was YES. [2025-04-13 20:33:05,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33860 conditions, 4121 events. 2684/4121 cut-off events. For 42273/42273 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 22282 event pairs, 270 based on Foata normal form. 1/3840 useless extension candidates. Maximal degree in co-relation 33746. Up to 3816 conditions per place. [2025-04-13 20:33:05,802 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 481 selfloop transitions, 117 changer transitions 3/601 dead transitions. [2025-04-13 20:33:05,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 601 transitions, 11093 flow [2025-04-13 20:33:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-04-13 20:33:05,804 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35 [2025-04-13 20:33:05,804 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 8507 flow. Second operand 10 states and 119 transitions. [2025-04-13 20:33:05,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 601 transitions, 11093 flow [2025-04-13 20:33:06,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 601 transitions, 10936 flow, removed 28 selfloop flow, removed 2 redundant places. [2025-04-13 20:33:06,052 INFO L231 Difference]: Finished difference. Result has 189 places, 566 transitions, 9882 flow [2025-04-13 20:33:06,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8366, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9882, PETRI_PLACES=189, PETRI_TRANSITIONS=566} [2025-04-13 20:33:06,052 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 157 predicate places. [2025-04-13 20:33:06,052 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 566 transitions, 9882 flow [2025-04-13 20:33:06,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:06,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:06,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:06,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:33:06,053 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:06,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1743268603, now seen corresponding path program 13 times [2025-04-13 20:33:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:06,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988689095] [2025-04-13 20:33:06,053 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:06,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:06,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:06,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:06,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:06,555 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:33:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:06,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988689095] [2025-04-13 20:33:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988689095] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:06,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245470181] [2025-04-13 20:33:06,555 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:06,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:06,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:06,557 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:33:06,558 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:33:06,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:06,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:06,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:06,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:06,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:33:06,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:06,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:33:06,658 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:33:06,682 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:33:06,682 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 11 treesize of output 11 [2025-04-13 20:33:06,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:33:06,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:33:06,873 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:33:06,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:07,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245470181] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:07,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:07,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 20:33:07,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126906472] [2025-04-13 20:33:07,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:07,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:33:07,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:07,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:33:07,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:33:07,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:07,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 566 transitions, 9882 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:07,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:07,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:07,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:08,177 INFO L116 PetriNetUnfolderBase]: 2727/4207 cut-off events. [2025-04-13 20:33:08,178 INFO L117 PetriNetUnfolderBase]: For 48339/48339 co-relation queries the response was YES. [2025-04-13 20:33:08,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35763 conditions, 4207 events. 2727/4207 cut-off events. For 48339/48339 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 23033 event pairs, 239 based on Foata normal form. 2/3969 useless extension candidates. Maximal degree in co-relation 35643. Up to 3504 conditions per place. [2025-04-13 20:33:08,231 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 460 selfloop transitions, 167 changer transitions 2/629 dead transitions. [2025-04-13 20:33:08,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 629 transitions, 11919 flow [2025-04-13 20:33:08,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2025-04-13 20:33:08,237 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2025-04-13 20:33:08,237 INFO L175 Difference]: Start difference. First operand has 189 places, 566 transitions, 9882 flow. Second operand 10 states and 128 transitions. [2025-04-13 20:33:08,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 629 transitions, 11919 flow [2025-04-13 20:33:08,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 629 transitions, 11564 flow, removed 159 selfloop flow, removed 3 redundant places. [2025-04-13 20:33:08,663 INFO L231 Difference]: Finished difference. Result has 198 places, 572 transitions, 10057 flow [2025-04-13 20:33:08,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9610, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10057, PETRI_PLACES=198, PETRI_TRANSITIONS=572} [2025-04-13 20:33:08,664 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 166 predicate places. [2025-04-13 20:33:08,664 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 572 transitions, 10057 flow [2025-04-13 20:33:08,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:08,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:08,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:08,670 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:33:08,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:08,866 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:08,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:08,867 INFO L85 PathProgramCache]: Analyzing trace with hash -402902157, now seen corresponding path program 14 times [2025-04-13 20:33:08,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:08,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681884824] [2025-04-13 20:33:08,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:08,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:08,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:08,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:33:08,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:09,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:09,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681884824] [2025-04-13 20:33:09,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681884824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:09,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:09,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123183510] [2025-04-13 20:33:09,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:09,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:09,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:09,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:09,169 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:09,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 572 transitions, 10057 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:09,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:09,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:09,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:10,049 INFO L116 PetriNetUnfolderBase]: 2789/4316 cut-off events. [2025-04-13 20:33:10,049 INFO L117 PetriNetUnfolderBase]: For 51340/51340 co-relation queries the response was YES. [2025-04-13 20:33:10,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37081 conditions, 4316 events. 2789/4316 cut-off events. For 51340/51340 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 23896 event pairs, 314 based on Foata normal form. 1/4055 useless extension candidates. Maximal degree in co-relation 36956. Up to 4083 conditions per place. [2025-04-13 20:33:10,095 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 528 selfloop transitions, 98 changer transitions 3/629 dead transitions. [2025-04-13 20:33:10,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 629 transitions, 12112 flow [2025-04-13 20:33:10,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-04-13 20:33:10,096 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32941176470588235 [2025-04-13 20:33:10,096 INFO L175 Difference]: Start difference. First operand has 198 places, 572 transitions, 10057 flow. Second operand 10 states and 112 transitions. [2025-04-13 20:33:10,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 629 transitions, 12112 flow [2025-04-13 20:33:10,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 629 transitions, 11851 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-04-13 20:33:10,403 INFO L231 Difference]: Finished difference. Result has 205 places, 601 transitions, 10689 flow [2025-04-13 20:33:10,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9829, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10689, PETRI_PLACES=205, PETRI_TRANSITIONS=601} [2025-04-13 20:33:10,403 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 173 predicate places. [2025-04-13 20:33:10,403 INFO L485 AbstractCegarLoop]: Abstraction has has 205 places, 601 transitions, 10689 flow [2025-04-13 20:33:10,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:10,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:10,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:10,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:33:10,404 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:10,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -213479413, now seen corresponding path program 15 times [2025-04-13 20:33:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:10,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975565919] [2025-04-13 20:33:10,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:33:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:10,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:10,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:10,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:33:10,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:10,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975565919] [2025-04-13 20:33:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975565919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:10,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:10,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:10,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107143593] [2025-04-13 20:33:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:10,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:10,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:10,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:10,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:10,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 601 transitions, 10689 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:10,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:10,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:10,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:11,522 INFO L116 PetriNetUnfolderBase]: 2921/4537 cut-off events. [2025-04-13 20:33:11,523 INFO L117 PetriNetUnfolderBase]: For 56400/56400 co-relation queries the response was YES. [2025-04-13 20:33:11,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39547 conditions, 4537 events. 2921/4537 cut-off events. For 56400/56400 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 25559 event pairs, 328 based on Foata normal form. 1/4278 useless extension candidates. Maximal degree in co-relation 39417. Up to 4237 conditions per place. [2025-04-13 20:33:11,563 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 558 selfloop transitions, 111 changer transitions 4/673 dead transitions. [2025-04-13 20:33:11,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 673 transitions, 13063 flow [2025-04-13 20:33:11,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-04-13 20:33:11,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35 [2025-04-13 20:33:11,564 INFO L175 Difference]: Start difference. First operand has 205 places, 601 transitions, 10689 flow. Second operand 10 states and 119 transitions. [2025-04-13 20:33:11,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 673 transitions, 13063 flow [2025-04-13 20:33:11,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 673 transitions, 12813 flow, removed 81 selfloop flow, removed 5 redundant places. [2025-04-13 20:33:11,942 INFO L231 Difference]: Finished difference. Result has 212 places, 637 transitions, 11508 flow [2025-04-13 20:33:11,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=10439, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11508, PETRI_PLACES=212, PETRI_TRANSITIONS=637} [2025-04-13 20:33:11,943 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2025-04-13 20:33:11,943 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 637 transitions, 11508 flow [2025-04-13 20:33:11,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:11,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:11,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:11,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:33:11,943 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:11,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1761065719, now seen corresponding path program 16 times [2025-04-13 20:33:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:11,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753934363] [2025-04-13 20:33:11,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:33:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:11,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:11,960 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:11,960 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:33:11,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:12,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753934363] [2025-04-13 20:33:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753934363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:12,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:12,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:12,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237863733] [2025-04-13 20:33:12,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:12,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:12,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:12,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:12,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:12,326 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:12,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 637 transitions, 11508 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:12,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:12,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:12,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:13,312 INFO L116 PetriNetUnfolderBase]: 2972/4619 cut-off events. [2025-04-13 20:33:13,312 INFO L117 PetriNetUnfolderBase]: For 62501/62501 co-relation queries the response was YES. [2025-04-13 20:33:13,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41106 conditions, 4619 events. 2972/4619 cut-off events. For 62501/62501 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 26196 event pairs, 333 based on Foata normal form. 1/4385 useless extension candidates. Maximal degree in co-relation 40972. Up to 4343 conditions per place. [2025-04-13 20:33:13,356 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 578 selfloop transitions, 103 changer transitions 4/685 dead transitions. [2025-04-13 20:33:13,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 685 transitions, 13427 flow [2025-04-13 20:33:13,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2025-04-13 20:33:13,357 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3411764705882353 [2025-04-13 20:33:13,357 INFO L175 Difference]: Start difference. First operand has 212 places, 637 transitions, 11508 flow. Second operand 10 states and 116 transitions. [2025-04-13 20:33:13,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 685 transitions, 13427 flow [2025-04-13 20:33:13,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 685 transitions, 13095 flow, removed 119 selfloop flow, removed 5 redundant places. [2025-04-13 20:33:13,775 INFO L231 Difference]: Finished difference. Result has 218 places, 653 transitions, 11780 flow [2025-04-13 20:33:13,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11176, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11780, PETRI_PLACES=218, PETRI_TRANSITIONS=653} [2025-04-13 20:33:13,776 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2025-04-13 20:33:13,776 INFO L485 AbstractCegarLoop]: Abstraction has has 218 places, 653 transitions, 11780 flow [2025-04-13 20:33:13,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:13,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:13,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:13,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:33:13,776 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:13,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:13,776 INFO L85 PathProgramCache]: Analyzing trace with hash 63576887, now seen corresponding path program 17 times [2025-04-13 20:33:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:13,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685485876] [2025-04-13 20:33:13,777 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:33:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:13,781 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:13,787 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:13,787 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:13,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:14,188 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:33:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:14,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685485876] [2025-04-13 20:33:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685485876] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:14,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968781535] [2025-04-13 20:33:14,189 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:33:14,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:14,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:14,191 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:33:14,191 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:33:14,239 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:14,261 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:14,261 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:14,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:14,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:33:14,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:14,298 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:33:14,456 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:14,456 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 19 [2025-04-13 20:33:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:14,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:14,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968781535] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:14,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:14,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 9] total 24 [2025-04-13 20:33:14,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110887415] [2025-04-13 20:33:14,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:14,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:33:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:14,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:33:14,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:33:14,606 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:14,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 653 transitions, 11780 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:33:14,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:14,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:14,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:15,848 INFO L116 PetriNetUnfolderBase]: 3018/4707 cut-off events. [2025-04-13 20:33:15,848 INFO L117 PetriNetUnfolderBase]: For 64286/64286 co-relation queries the response was YES. [2025-04-13 20:33:15,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42022 conditions, 4707 events. 3018/4707 cut-off events. For 64286/64286 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 26964 event pairs, 273 based on Foata normal form. 1/4474 useless extension candidates. Maximal degree in co-relation 41885. Up to 3898 conditions per place. [2025-04-13 20:33:15,904 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 525 selfloop transitions, 192 changer transitions 3/720 dead transitions. [2025-04-13 20:33:15,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 720 transitions, 14055 flow [2025-04-13 20:33:15,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2025-04-13 20:33:15,905 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2025-04-13 20:33:15,905 INFO L175 Difference]: Start difference. First operand has 218 places, 653 transitions, 11780 flow. Second operand 10 states and 130 transitions. [2025-04-13 20:33:15,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 720 transitions, 14055 flow [2025-04-13 20:33:16,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 720 transitions, 13780 flow, removed 89 selfloop flow, removed 5 redundant places. [2025-04-13 20:33:16,445 INFO L231 Difference]: Finished difference. Result has 224 places, 659 transitions, 12057 flow [2025-04-13 20:33:16,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11534, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12057, PETRI_PLACES=224, PETRI_TRANSITIONS=659} [2025-04-13 20:33:16,446 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 192 predicate places. [2025-04-13 20:33:16,446 INFO L485 AbstractCegarLoop]: Abstraction has has 224 places, 659 transitions, 12057 flow [2025-04-13 20:33:16,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:33:16,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:16,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:16,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 20:33:16,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:16,647 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:16,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2119461925, now seen corresponding path program 18 times [2025-04-13 20:33:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:16,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503371810] [2025-04-13 20:33:16,647 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:33:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:16,652 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:16,656 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:16,657 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:33:16,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:16,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:16,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503371810] [2025-04-13 20:33:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503371810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:16,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:16,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017549158] [2025-04-13 20:33:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:16,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:16,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:16,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:16,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:16,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:16,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 659 transitions, 12057 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:16,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:16,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:16,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:17,893 INFO L116 PetriNetUnfolderBase]: 3018/4706 cut-off events. [2025-04-13 20:33:17,893 INFO L117 PetriNetUnfolderBase]: For 67001/67001 co-relation queries the response was YES. [2025-04-13 20:33:17,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42606 conditions, 4706 events. 3018/4706 cut-off events. For 67001/67001 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 26958 event pairs, 337 based on Foata normal form. 1/4473 useless extension candidates. Maximal degree in co-relation 42465. Up to 4376 conditions per place. [2025-04-13 20:33:17,955 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 573 selfloop transitions, 124 changer transitions 5/702 dead transitions. [2025-04-13 20:33:17,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 702 transitions, 13906 flow [2025-04-13 20:33:17,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2025-04-13 20:33:17,956 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2025-04-13 20:33:17,956 INFO L175 Difference]: Start difference. First operand has 224 places, 659 transitions, 12057 flow. Second operand 10 states and 120 transitions. [2025-04-13 20:33:17,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 702 transitions, 13906 flow [2025-04-13 20:33:18,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 702 transitions, 13701 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-13 20:33:18,558 INFO L231 Difference]: Finished difference. Result has 231 places, 669 transitions, 12412 flow [2025-04-13 20:33:18,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11864, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12412, PETRI_PLACES=231, PETRI_TRANSITIONS=669} [2025-04-13 20:33:18,559 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 199 predicate places. [2025-04-13 20:33:18,559 INFO L485 AbstractCegarLoop]: Abstraction has has 231 places, 669 transitions, 12412 flow [2025-04-13 20:33:18,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:18,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:18,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:18,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:33:18,559 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:18,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash 70436059, now seen corresponding path program 19 times [2025-04-13 20:33:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:18,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171310246] [2025-04-13 20:33:18,560 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:18,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:18,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:18,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:18,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:18,942 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:33:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:18,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171310246] [2025-04-13 20:33:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171310246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:18,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286934840] [2025-04-13 20:33:18,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:18,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:18,945 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:33:18,946 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:33:18,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:19,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:19,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:19,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:19,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:33:19,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:19,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:33:19,037 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:33:19,058 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:33:19,058 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 11 treesize of output 11 [2025-04-13 20:33:19,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:33:19,218 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:19,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2025-04-13 20:33:19,237 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:33:19,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286934840] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 20:33:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418891060] [2025-04-13 20:33:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:19,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:33:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:19,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:33:19,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:33:19,367 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:19,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 669 transitions, 12412 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:19,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:19,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:20,646 INFO L116 PetriNetUnfolderBase]: 3362/5230 cut-off events. [2025-04-13 20:33:20,646 INFO L117 PetriNetUnfolderBase]: For 75932/75932 co-relation queries the response was YES. [2025-04-13 20:33:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47214 conditions, 5230 events. 3362/5230 cut-off events. For 75932/75932 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 30556 event pairs, 269 based on Foata normal form. 1/4964 useless extension candidates. Maximal degree in co-relation 47068. Up to 3388 conditions per place. [2025-04-13 20:33:20,700 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 394 selfloop transitions, 433 changer transitions 3/830 dead transitions. [2025-04-13 20:33:20,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 830 transitions, 16244 flow [2025-04-13 20:33:20,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:33:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:33:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 187 transitions. [2025-04-13 20:33:20,701 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-04-13 20:33:20,701 INFO L175 Difference]: Start difference. First operand has 231 places, 669 transitions, 12412 flow. Second operand 14 states and 187 transitions. [2025-04-13 20:33:20,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 830 transitions, 16244 flow [2025-04-13 20:33:21,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 830 transitions, 16027 flow, removed 19 selfloop flow, removed 6 redundant places. [2025-04-13 20:33:21,247 INFO L231 Difference]: Finished difference. Result has 246 places, 763 transitions, 15257 flow [2025-04-13 20:33:21,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=12198, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15257, PETRI_PLACES=246, PETRI_TRANSITIONS=763} [2025-04-13 20:33:21,247 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 214 predicate places. [2025-04-13 20:33:21,247 INFO L485 AbstractCegarLoop]: Abstraction has has 246 places, 763 transitions, 15257 flow [2025-04-13 20:33:21,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:21,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:21,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:21,254 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:33:21,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:21,448 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:21,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2082593873, now seen corresponding path program 20 times [2025-04-13 20:33:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:21,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597832544] [2025-04-13 20:33:21,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:21,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:21,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:21,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:33:21,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:21,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:21,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597832544] [2025-04-13 20:33:21,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597832544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:21,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:21,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:21,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611325984] [2025-04-13 20:33:21,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:21,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:21,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:21,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:21,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:21,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 763 transitions, 15257 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:21,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:21,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:21,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:22,700 INFO L116 PetriNetUnfolderBase]: 3362/5229 cut-off events. [2025-04-13 20:33:22,700 INFO L117 PetriNetUnfolderBase]: For 87837/87837 co-relation queries the response was YES. [2025-04-13 20:33:22,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50632 conditions, 5229 events. 3362/5229 cut-off events. For 87837/87837 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 30473 event pairs, 385 based on Foata normal form. 1/4963 useless extension candidates. Maximal degree in co-relation 50477. Up to 4872 conditions per place. [2025-04-13 20:33:22,764 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 669 selfloop transitions, 132 changer transitions 5/806 dead transitions. [2025-04-13 20:33:22,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 806 transitions, 17352 flow [2025-04-13 20:33:22,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2025-04-13 20:33:22,765 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2025-04-13 20:33:22,765 INFO L175 Difference]: Start difference. First operand has 246 places, 763 transitions, 15257 flow. Second operand 10 states and 120 transitions. [2025-04-13 20:33:22,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 806 transitions, 17352 flow [2025-04-13 20:33:23,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 806 transitions, 17064 flow, removed 137 selfloop flow, removed 2 redundant places. [2025-04-13 20:33:23,623 INFO L231 Difference]: Finished difference. Result has 255 places, 774 transitions, 15575 flow [2025-04-13 20:33:23,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=14954, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15575, PETRI_PLACES=255, PETRI_TRANSITIONS=774} [2025-04-13 20:33:23,624 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 223 predicate places. [2025-04-13 20:33:23,624 INFO L485 AbstractCegarLoop]: Abstraction has has 255 places, 774 transitions, 15575 flow [2025-04-13 20:33:23,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:23,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:23,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:23,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 20:33:23,624 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:23,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1507058159, now seen corresponding path program 21 times [2025-04-13 20:33:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:23,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148715010] [2025-04-13 20:33:23,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:33:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:23,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:23,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:23,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:33:23,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:23,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:23,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148715010] [2025-04-13 20:33:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148715010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:23,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:23,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:23,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517462770] [2025-04-13 20:33:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:23,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:23,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:23,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:23,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:23,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:23,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 774 transitions, 15575 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:23,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:23,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:23,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:25,011 INFO L116 PetriNetUnfolderBase]: 3395/5287 cut-off events. [2025-04-13 20:33:25,012 INFO L117 PetriNetUnfolderBase]: For 89890/89890 co-relation queries the response was YES. [2025-04-13 20:33:25,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51187 conditions, 5287 events. 3395/5287 cut-off events. For 89890/89890 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 30861 event pairs, 441 based on Foata normal form. 1/5015 useless extension candidates. Maximal degree in co-relation 51029. Up to 5101 conditions per place. [2025-04-13 20:33:25,064 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 737 selfloop transitions, 66 changer transitions 1/804 dead transitions. [2025-04-13 20:33:25,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 804 transitions, 17569 flow [2025-04-13 20:33:25,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2025-04-13 20:33:25,065 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3029411764705882 [2025-04-13 20:33:25,065 INFO L175 Difference]: Start difference. First operand has 255 places, 774 transitions, 15575 flow. Second operand 10 states and 103 transitions. [2025-04-13 20:33:25,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 804 transitions, 17569 flow [2025-04-13 20:33:25,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 804 transitions, 17310 flow, removed 33 selfloop flow, removed 6 redundant places. [2025-04-13 20:33:25,724 INFO L231 Difference]: Finished difference. Result has 262 places, 784 transitions, 15768 flow [2025-04-13 20:33:25,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=15324, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15768, PETRI_PLACES=262, PETRI_TRANSITIONS=784} [2025-04-13 20:33:25,724 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 230 predicate places. [2025-04-13 20:33:25,725 INFO L485 AbstractCegarLoop]: Abstraction has has 262 places, 784 transitions, 15768 flow [2025-04-13 20:33:25,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:25,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:25,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:25,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:33:25,725 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:25,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 560379441, now seen corresponding path program 22 times [2025-04-13 20:33:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:25,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477041348] [2025-04-13 20:33:25,725 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:33:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:25,730 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:25,736 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:25,736 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:33:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:26,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477041348] [2025-04-13 20:33:26,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477041348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:26,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842207380] [2025-04-13 20:33:26,105 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:33:26,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:26,107 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:33:26,108 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:33:26,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:26,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:26,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:33:26,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:26,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:33:26,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:26,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:33:26,194 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:33:26,208 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:33:26,208 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 11 treesize of output 11 [2025-04-13 20:33:26,224 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:33:26,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:26,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2025-04-13 20:33:26,373 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:33:26,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842207380] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 24 [2025-04-13 20:33:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475631364] [2025-04-13 20:33:26,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:26,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:33:26,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:26,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:33:26,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:33:26,503 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:26,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 784 transitions, 15768 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:26,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:26,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:26,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:27,866 INFO L116 PetriNetUnfolderBase]: 3624/5630 cut-off events. [2025-04-13 20:33:27,866 INFO L117 PetriNetUnfolderBase]: For 101604/101604 co-relation queries the response was YES. [2025-04-13 20:33:27,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54326 conditions, 5630 events. 3624/5630 cut-off events. For 101604/101604 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 33220 event pairs, 345 based on Foata normal form. 1/5324 useless extension candidates. Maximal degree in co-relation 54164. Up to 3820 conditions per place. [2025-04-13 20:33:27,942 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 461 selfloop transitions, 401 changer transitions 1/863 dead transitions. [2025-04-13 20:33:27,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 863 transitions, 18468 flow [2025-04-13 20:33:27,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:33:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:33:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2025-04-13 20:33:27,943 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3914027149321267 [2025-04-13 20:33:27,943 INFO L175 Difference]: Start difference. First operand has 262 places, 784 transitions, 15768 flow. Second operand 13 states and 173 transitions. [2025-04-13 20:33:27,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 863 transitions, 18468 flow [2025-04-13 20:33:28,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 863 transitions, 18324 flow, removed 45 selfloop flow, removed 3 redundant places. [2025-04-13 20:33:28,834 INFO L231 Difference]: Finished difference. Result has 275 places, 810 transitions, 17177 flow [2025-04-13 20:33:28,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=15626, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=17177, PETRI_PLACES=275, PETRI_TRANSITIONS=810} [2025-04-13 20:33:28,835 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 243 predicate places. [2025-04-13 20:33:28,836 INFO L485 AbstractCegarLoop]: Abstraction has has 275 places, 810 transitions, 17177 flow [2025-04-13 20:33:28,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:28,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:28,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:28,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:33:29,036 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,SelfDestructingSolverStorable24 [2025-04-13 20:33:29,036 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:29,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash 332232379, now seen corresponding path program 23 times [2025-04-13 20:33:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:29,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071570229] [2025-04-13 20:33:29,037 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:33:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:29,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:29,052 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:29,052 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:29,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:29,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:29,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071570229] [2025-04-13 20:33:29,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071570229] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:29,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562854008] [2025-04-13 20:33:29,562 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:33:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:29,564 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:33:29,565 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:33:29,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:29,631 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:29,632 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:29,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:29,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:33:29,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:29,665 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:33:29,807 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:29,807 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 19 [2025-04-13 20:33:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:29,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562854008] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:29,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9] total 21 [2025-04-13 20:33:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584089199] [2025-04-13 20:33:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:29,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:33:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:29,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:33:29,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:33:29,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:29,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 810 transitions, 17177 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:33:29,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:29,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:29,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:31,394 INFO L116 PetriNetUnfolderBase]: 3690/5743 cut-off events. [2025-04-13 20:33:31,394 INFO L117 PetriNetUnfolderBase]: For 115931/115931 co-relation queries the response was YES. [2025-04-13 20:33:31,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57962 conditions, 5743 events. 3690/5743 cut-off events. For 115931/115931 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 34141 event pairs, 425 based on Foata normal form. 1/5431 useless extension candidates. Maximal degree in co-relation 57795. Up to 4883 conditions per place. [2025-04-13 20:33:31,460 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 684 selfloop transitions, 182 changer transitions 1/867 dead transitions. [2025-04-13 20:33:31,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 867 transitions, 19844 flow [2025-04-13 20:33:31,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:33:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:33:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2025-04-13 20:33:31,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.369281045751634 [2025-04-13 20:33:31,461 INFO L175 Difference]: Start difference. First operand has 275 places, 810 transitions, 17177 flow. Second operand 9 states and 113 transitions. [2025-04-13 20:33:31,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 867 transitions, 19844 flow [2025-04-13 20:33:32,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 867 transitions, 19478 flow, removed 38 selfloop flow, removed 7 redundant places. [2025-04-13 20:33:32,408 INFO L231 Difference]: Finished difference. Result has 278 places, 819 transitions, 17407 flow [2025-04-13 20:33:32,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=16822, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17407, PETRI_PLACES=278, PETRI_TRANSITIONS=819} [2025-04-13 20:33:32,409 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 246 predicate places. [2025-04-13 20:33:32,409 INFO L485 AbstractCegarLoop]: Abstraction has has 278 places, 819 transitions, 17407 flow [2025-04-13 20:33:32,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:33:32,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:32,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:32,416 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:33:32,610 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,SelfDestructingSolverStorable25 [2025-04-13 20:33:32,610 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:32,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2001033341, now seen corresponding path program 24 times [2025-04-13 20:33:32,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:32,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541102547] [2025-04-13 20:33:32,611 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:33:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:32,616 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:32,620 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:32,621 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:33:32,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:32,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541102547] [2025-04-13 20:33:32,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541102547] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:32,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:32,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592838781] [2025-04-13 20:33:32,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:32,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:32,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:32,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:32,899 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:32,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 819 transitions, 17407 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:32,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:32,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:32,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:34,278 INFO L116 PetriNetUnfolderBase]: 3690/5742 cut-off events. [2025-04-13 20:33:34,278 INFO L117 PetriNetUnfolderBase]: For 118405/118405 co-relation queries the response was YES. [2025-04-13 20:33:34,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58407 conditions, 5742 events. 3690/5742 cut-off events. For 118405/118405 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 34064 event pairs, 510 based on Foata normal form. 1/5430 useless extension candidates. Maximal degree in co-relation 58235. Up to 5556 conditions per place. [2025-04-13 20:33:34,429 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 773 selfloop transitions, 69 changer transitions 1/843 dead transitions. [2025-04-13 20:33:34,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 843 transitions, 19327 flow [2025-04-13 20:33:34,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2025-04-13 20:33:34,430 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3088235294117647 [2025-04-13 20:33:34,430 INFO L175 Difference]: Start difference. First operand has 278 places, 819 transitions, 17407 flow. Second operand 10 states and 105 transitions. [2025-04-13 20:33:34,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 843 transitions, 19327 flow [2025-04-13 20:33:35,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 843 transitions, 19014 flow, removed 68 selfloop flow, removed 4 redundant places. [2025-04-13 20:33:35,419 INFO L231 Difference]: Finished difference. Result has 287 places, 824 transitions, 17402 flow [2025-04-13 20:33:35,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=17084, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17402, PETRI_PLACES=287, PETRI_TRANSITIONS=824} [2025-04-13 20:33:35,420 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 255 predicate places. [2025-04-13 20:33:35,420 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 824 transitions, 17402 flow [2025-04-13 20:33:35,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:35,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:35,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:35,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 20:33:35,421 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:35,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1979353063, now seen corresponding path program 25 times [2025-04-13 20:33:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:35,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383694018] [2025-04-13 20:33:35,422 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:35,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:35,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:35,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:35,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:35,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:35,936 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:33:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:35,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383694018] [2025-04-13 20:33:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383694018] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:35,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644186201] [2025-04-13 20:33:35,937 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:35,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:35,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:35,939 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:33:35,940 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:33:35,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:36,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:36,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:36,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:36,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:33:36,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:36,028 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:33:36,061 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:33:36,081 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:33:36,081 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 11 treesize of output 11 [2025-04-13 20:33:36,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:33:36,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:33:36,275 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:33:36,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:36,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644186201] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:36,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:36,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 20:33:36,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922502494] [2025-04-13 20:33:36,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:36,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:33:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:36,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:33:36,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:33:36,440 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:36,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 824 transitions, 17402 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:36,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:36,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:36,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:37,976 INFO L116 PetriNetUnfolderBase]: 3726/5805 cut-off events. [2025-04-13 20:33:37,976 INFO L117 PetriNetUnfolderBase]: For 116381/116381 co-relation queries the response was YES. [2025-04-13 20:33:38,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58725 conditions, 5805 events. 3726/5805 cut-off events. For 116381/116381 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 34638 event pairs, 448 based on Foata normal form. 1/5487 useless extension candidates. Maximal degree in co-relation 58547. Up to 4984 conditions per place. [2025-04-13 20:33:38,043 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 696 selfloop transitions, 175 changer transitions 1/872 dead transitions. [2025-04-13 20:33:38,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 872 transitions, 19876 flow [2025-04-13 20:33:38,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:33:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:33:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2025-04-13 20:33:38,043 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35947712418300654 [2025-04-13 20:33:38,044 INFO L175 Difference]: Start difference. First operand has 287 places, 824 transitions, 17402 flow. Second operand 9 states and 110 transitions. [2025-04-13 20:33:38,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 872 transitions, 19876 flow [2025-04-13 20:33:38,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 872 transitions, 19779 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-04-13 20:33:38,989 INFO L231 Difference]: Finished difference. Result has 295 places, 828 transitions, 17745 flow [2025-04-13 20:33:38,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=17305, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17745, PETRI_PLACES=295, PETRI_TRANSITIONS=828} [2025-04-13 20:33:38,990 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 263 predicate places. [2025-04-13 20:33:38,990 INFO L485 AbstractCegarLoop]: Abstraction has has 295 places, 828 transitions, 17745 flow [2025-04-13 20:33:38,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:33:38,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:38,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:38,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 20:33:39,191 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,SelfDestructingSolverStorable27 [2025-04-13 20:33:39,191 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:39,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash 201178959, now seen corresponding path program 26 times [2025-04-13 20:33:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:39,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447450711] [2025-04-13 20:33:39,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:39,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:39,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:39,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:39,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:33:39,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:39,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:39,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447450711] [2025-04-13 20:33:39,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447450711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:39,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:39,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:33:39,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469403436] [2025-04-13 20:33:39,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:39,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:33:39,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:39,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:33:39,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:33:39,459 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:39,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 828 transitions, 17745 flow. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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:33:39,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:39,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:39,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:40,819 INFO L116 PetriNetUnfolderBase]: 3779/5891 cut-off events. [2025-04-13 20:33:40,819 INFO L117 PetriNetUnfolderBase]: For 126267/126267 co-relation queries the response was YES. [2025-04-13 20:33:40,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60344 conditions, 5891 events. 3779/5891 cut-off events. For 126267/126267 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 35192 event pairs, 551 based on Foata normal form. 1/5567 useless extension candidates. Maximal degree in co-relation 60162. Up to 5708 conditions per place. [2025-04-13 20:33:40,908 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 785 selfloop transitions, 70 changer transitions 1/856 dead transitions. [2025-04-13 20:33:40,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 856 transitions, 19861 flow [2025-04-13 20:33:40,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:33:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:33:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-04-13 20:33:40,908 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31699346405228757 [2025-04-13 20:33:40,908 INFO L175 Difference]: Start difference. First operand has 295 places, 828 transitions, 17745 flow. Second operand 9 states and 97 transitions. [2025-04-13 20:33:40,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 856 transitions, 19861 flow [2025-04-13 20:33:41,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 856 transitions, 19690 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-13 20:33:41,993 INFO L231 Difference]: Finished difference. Result has 303 places, 840 transitions, 18028 flow [2025-04-13 20:33:41,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=17574, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=828, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=762, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18028, PETRI_PLACES=303, PETRI_TRANSITIONS=840} [2025-04-13 20:33:41,995 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 271 predicate places. [2025-04-13 20:33:41,995 INFO L485 AbstractCegarLoop]: Abstraction has has 303 places, 840 transitions, 18028 flow [2025-04-13 20:33:41,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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:33:41,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:41,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:41,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:33:41,995 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:41,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash 259634043, now seen corresponding path program 27 times [2025-04-13 20:33:41,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:41,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500418064] [2025-04-13 20:33:41,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:33:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:42,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:42,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:42,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:33:42,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:42,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500418064] [2025-04-13 20:33:42,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500418064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:42,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:42,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:33:42,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590673157] [2025-04-13 20:33:42,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:42,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:33:42,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:42,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:33:42,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:33:42,280 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:42,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 840 transitions, 18028 flow. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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:33:42,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:42,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:42,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:44,033 INFO L116 PetriNetUnfolderBase]: 4161/6447 cut-off events. [2025-04-13 20:33:44,033 INFO L117 PetriNetUnfolderBase]: For 155350/155350 co-relation queries the response was YES. [2025-04-13 20:33:44,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67284 conditions, 6447 events. 4161/6447 cut-off events. For 155350/155350 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 38819 event pairs, 459 based on Foata normal form. 1/6068 useless extension candidates. Maximal degree in co-relation 67097. Up to 5198 conditions per place. [2025-04-13 20:33:44,131 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 707 selfloop transitions, 266 changer transitions 1/974 dead transitions. [2025-04-13 20:33:44,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 974 transitions, 22633 flow [2025-04-13 20:33:44,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:33:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:33:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2025-04-13 20:33:44,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3582887700534759 [2025-04-13 20:33:44,132 INFO L175 Difference]: Start difference. First operand has 303 places, 840 transitions, 18028 flow. Second operand 11 states and 134 transitions. [2025-04-13 20:33:44,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 974 transitions, 22633 flow [2025-04-13 20:33:45,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 974 transitions, 22338 flow, removed 112 selfloop flow, removed 4 redundant places. [2025-04-13 20:33:45,374 INFO L231 Difference]: Finished difference. Result has 314 places, 912 transitions, 20255 flow [2025-04-13 20:33:45,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=17733, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20255, PETRI_PLACES=314, PETRI_TRANSITIONS=912} [2025-04-13 20:33:45,375 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 282 predicate places. [2025-04-13 20:33:45,375 INFO L485 AbstractCegarLoop]: Abstraction has has 314 places, 912 transitions, 20255 flow [2025-04-13 20:33:45,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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:33:45,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:45,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:45,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:33:45,376 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:45,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -305231869, now seen corresponding path program 28 times [2025-04-13 20:33:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:45,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301610480] [2025-04-13 20:33:45,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:33:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:45,381 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:45,387 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:45,388 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:33:45,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:45,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301610480] [2025-04-13 20:33:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301610480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:45,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319096301] [2025-04-13 20:33:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:45,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:45,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:45,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:45,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:45,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 912 transitions, 20255 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:45,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:45,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:45,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:47,707 INFO L116 PetriNetUnfolderBase]: 4627/7148 cut-off events. [2025-04-13 20:33:47,707 INFO L117 PetriNetUnfolderBase]: For 195900/195900 co-relation queries the response was YES. [2025-04-13 20:33:47,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78845 conditions, 7148 events. 4627/7148 cut-off events. For 195900/195900 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 43519 event pairs, 455 based on Foata normal form. 1/6743 useless extension candidates. Maximal degree in co-relation 78652. Up to 5370 conditions per place. [2025-04-13 20:33:47,823 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 705 selfloop transitions, 434 changer transitions 1/1140 dead transitions. [2025-04-13 20:33:47,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1140 transitions, 27334 flow [2025-04-13 20:33:47,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:33:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:33:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 209 transitions. [2025-04-13 20:33:47,824 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2025-04-13 20:33:47,824 INFO L175 Difference]: Start difference. First operand has 314 places, 912 transitions, 20255 flow. Second operand 19 states and 209 transitions. [2025-04-13 20:33:47,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1140 transitions, 27334 flow [2025-04-13 20:33:49,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 1140 transitions, 26817 flow, removed 209 selfloop flow, removed 4 redundant places. [2025-04-13 20:33:49,468 INFO L231 Difference]: Finished difference. Result has 333 places, 1045 transitions, 24490 flow [2025-04-13 20:33:49,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=19765, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=24490, PETRI_PLACES=333, PETRI_TRANSITIONS=1045} [2025-04-13 20:33:49,469 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 301 predicate places. [2025-04-13 20:33:49,469 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 1045 transitions, 24490 flow [2025-04-13 20:33:49,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:49,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:49,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:49,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 20:33:49,470 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:49,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1848299643, now seen corresponding path program 29 times [2025-04-13 20:33:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:49,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430185592] [2025-04-13 20:33:49,470 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:33:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:49,475 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:49,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:49,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:49,984 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:33:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:49,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430185592] [2025-04-13 20:33:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430185592] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:49,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214650006] [2025-04-13 20:33:49,985 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:33:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:49,987 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:33:49,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:33:50,053 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:50,076 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:50,076 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:50,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:50,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:33:50,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:50,131 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:33:50,366 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:50,366 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 19 [2025-04-13 20:33:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:50,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214650006] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:50,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:50,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 23 [2025-04-13 20:33:50,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678824151] [2025-04-13 20:33:50,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:50,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:33:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:50,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:33:50,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:33:50,527 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:50,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 1045 transitions, 24490 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:33:50,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:50,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:50,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:52,974 INFO L116 PetriNetUnfolderBase]: 4669/7221 cut-off events. [2025-04-13 20:33:52,974 INFO L117 PetriNetUnfolderBase]: For 207190/207190 co-relation queries the response was YES. [2025-04-13 20:33:53,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82193 conditions, 7221 events. 4669/7221 cut-off events. For 207190/207190 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 44218 event pairs, 524 based on Foata normal form. 1/6798 useless extension candidates. Maximal degree in co-relation 81994. Up to 6299 conditions per place. [2025-04-13 20:33:53,069 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 839 selfloop transitions, 257 changer transitions 1/1097 dead transitions. [2025-04-13 20:33:53,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1097 transitions, 27504 flow [2025-04-13 20:33:53,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:33:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:33:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2025-04-13 20:33:53,070 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2025-04-13 20:33:53,071 INFO L175 Difference]: Start difference. First operand has 333 places, 1045 transitions, 24490 flow. Second operand 10 states and 124 transitions. [2025-04-13 20:33:53,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1097 transitions, 27504 flow [2025-04-13 20:33:54,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 1097 transitions, 26925 flow, removed 211 selfloop flow, removed 8 redundant places. [2025-04-13 20:33:54,900 INFO L231 Difference]: Finished difference. Result has 338 places, 1064 transitions, 25228 flow [2025-04-13 20:33:54,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=23993, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=25228, PETRI_PLACES=338, PETRI_TRANSITIONS=1064} [2025-04-13 20:33:54,901 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 306 predicate places. [2025-04-13 20:33:54,901 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 1064 transitions, 25228 flow [2025-04-13 20:33:54,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:33:54,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:54,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:54,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:33:55,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 20:33:55,102 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:55,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:55,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1284186295, now seen corresponding path program 30 times [2025-04-13 20:33:55,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:55,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988088218] [2025-04-13 20:33:55,103 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:33:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:55,107 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:55,112 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:33:55,112 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:33:55,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:55,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:55,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988088218] [2025-04-13 20:33:55,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988088218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:55,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:33:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818301873] [2025-04-13 20:33:55,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:55,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:33:55,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:55,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:33:55,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:33:55,326 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:33:55,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 1064 transitions, 25228 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:55,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:55,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:33:55,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:57,464 INFO L116 PetriNetUnfolderBase]: 4696/7279 cut-off events. [2025-04-13 20:33:57,465 INFO L117 PetriNetUnfolderBase]: For 207543/207543 co-relation queries the response was YES. [2025-04-13 20:33:57,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82620 conditions, 7279 events. 4696/7279 cut-off events. For 207543/207543 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 44747 event pairs, 595 based on Foata normal form. 1/6852 useless extension candidates. Maximal degree in co-relation 82420. Up to 7028 conditions per place. [2025-04-13 20:33:57,581 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 993 selfloop transitions, 96 changer transitions 1/1090 dead transitions. [2025-04-13 20:33:57,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1090 transitions, 27673 flow [2025-04-13 20:33:57,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:33:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:33:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2025-04-13 20:33:57,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2025-04-13 20:33:57,582 INFO L175 Difference]: Start difference. First operand has 338 places, 1064 transitions, 25228 flow. Second operand 11 states and 110 transitions. [2025-04-13 20:33:57,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 1090 transitions, 27673 flow [2025-04-13 20:33:59,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1090 transitions, 27561 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-13 20:33:59,881 INFO L231 Difference]: Finished difference. Result has 347 places, 1072 transitions, 25470 flow [2025-04-13 20:33:59,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=25116, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=25470, PETRI_PLACES=347, PETRI_TRANSITIONS=1072} [2025-04-13 20:33:59,883 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 315 predicate places. [2025-04-13 20:33:59,883 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 1072 transitions, 25470 flow [2025-04-13 20:33:59,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:33:59,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:59,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:33:59,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 20:33:59,883 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:59,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1024461113, now seen corresponding path program 31 times [2025-04-13 20:33:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:59,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093829790] [2025-04-13 20:33:59,884 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:59,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:59,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:59,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:59,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:00,450 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:34:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:00,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093829790] [2025-04-13 20:34:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093829790] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:00,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122862910] [2025-04-13 20:34:00,452 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:34:00,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:00,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:00,454 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:34:00,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:34:00,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:34:00,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:00,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:34:00,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:00,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:34:00,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:00,603 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:34:00,772 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:34:00,772 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 23 [2025-04-13 20:34:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:00,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:34:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122862910] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:34:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 23 [2025-04-13 20:34:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830409077] [2025-04-13 20:34:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:00,924 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:34:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:00,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:34:00,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:34:00,924 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:00,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 1072 transitions, 25470 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:34:00,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:00,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:00,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:03,496 INFO L116 PetriNetUnfolderBase]: 5012/7769 cut-off events. [2025-04-13 20:34:03,496 INFO L117 PetriNetUnfolderBase]: For 218509/218509 co-relation queries the response was YES. [2025-04-13 20:34:03,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87692 conditions, 7769 events. 5012/7769 cut-off events. For 218509/218509 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 48403 event pairs, 519 based on Foata normal form. 2/7298 useless extension candidates. Maximal degree in co-relation 87487. Up to 6159 conditions per place. [2025-04-13 20:34:03,616 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 814 selfloop transitions, 413 changer transitions 1/1228 dead transitions. [2025-04-13 20:34:03,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1228 transitions, 30412 flow [2025-04-13 20:34:03,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:34:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:34:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2025-04-13 20:34:03,617 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3553921568627451 [2025-04-13 20:34:03,617 INFO L175 Difference]: Start difference. First operand has 347 places, 1072 transitions, 25470 flow. Second operand 12 states and 145 transitions. [2025-04-13 20:34:03,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1228 transitions, 30412 flow [2025-04-13 20:34:05,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1228 transitions, 30177 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-04-13 20:34:05,937 INFO L231 Difference]: Finished difference. Result has 356 places, 1168 transitions, 28440 flow [2025-04-13 20:34:05,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=25235, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=317, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=28440, PETRI_PLACES=356, PETRI_TRANSITIONS=1168} [2025-04-13 20:34:05,939 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 324 predicate places. [2025-04-13 20:34:05,939 INFO L485 AbstractCegarLoop]: Abstraction has has 356 places, 1168 transitions, 28440 flow [2025-04-13 20:34:05,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:34:05,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:05,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:05,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 20:34:06,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:06,140 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:06,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1349777131, now seen corresponding path program 32 times [2025-04-13 20:34:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:06,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484176509] [2025-04-13 20:34:06,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:34:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:06,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:06,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:34:06,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:34:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:34:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:06,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484176509] [2025-04-13 20:34:06,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484176509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:34:06,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:34:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:34:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571856429] [2025-04-13 20:34:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:06,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:34:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:06,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:34:06,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:34:06,436 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:06,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1168 transitions, 28440 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:34:06,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:06,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:06,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:08,794 INFO L116 PetriNetUnfolderBase]: 5086/7895 cut-off events. [2025-04-13 20:34:08,794 INFO L117 PetriNetUnfolderBase]: For 241611/241611 co-relation queries the response was YES. [2025-04-13 20:34:08,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92158 conditions, 7895 events. 5086/7895 cut-off events. For 241611/241611 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 49456 event pairs, 624 based on Foata normal form. 2/7420 useless extension candidates. Maximal degree in co-relation 91947. Up to 7533 conditions per place. [2025-04-13 20:34:08,926 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 1048 selfloop transitions, 169 changer transitions 1/1218 dead transitions. [2025-04-13 20:34:08,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1218 transitions, 31755 flow [2025-04-13 20:34:08,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:34:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:34:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2025-04-13 20:34:08,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3155080213903743 [2025-04-13 20:34:08,927 INFO L175 Difference]: Start difference. First operand has 356 places, 1168 transitions, 28440 flow. Second operand 11 states and 118 transitions. [2025-04-13 20:34:08,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 1218 transitions, 31755 flow [2025-04-13 20:34:11,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 1218 transitions, 31460 flow, removed 109 selfloop flow, removed 3 redundant places. [2025-04-13 20:34:11,378 INFO L231 Difference]: Finished difference. Result has 367 places, 1198 transitions, 29301 flow [2025-04-13 20:34:11,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=28221, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=29301, PETRI_PLACES=367, PETRI_TRANSITIONS=1198} [2025-04-13 20:34:11,379 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 335 predicate places. [2025-04-13 20:34:11,379 INFO L485 AbstractCegarLoop]: Abstraction has has 367 places, 1198 transitions, 29301 flow [2025-04-13 20:34:11,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:34:11,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:11,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:11,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 20:34:11,379 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:11,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1109289785, now seen corresponding path program 33 times [2025-04-13 20:34:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:11,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283986970] [2025-04-13 20:34:11,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:34:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:11,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:11,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:34:11,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:34:11,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:34:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:11,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283986970] [2025-04-13 20:34:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283986970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:34:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:34:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:34:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202185573] [2025-04-13 20:34:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:11,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:34:11,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:11,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:34:11,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:34:11,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:11,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 1198 transitions, 29301 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:34:11,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:11,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:11,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:14,430 INFO L116 PetriNetUnfolderBase]: 5328/8237 cut-off events. [2025-04-13 20:34:14,430 INFO L117 PetriNetUnfolderBase]: For 245117/245117 co-relation queries the response was YES. [2025-04-13 20:34:14,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96782 conditions, 8237 events. 5328/8237 cut-off events. For 245117/245117 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 51639 event pairs, 610 based on Foata normal form. 1/7733 useless extension candidates. Maximal degree in co-relation 96565. Up to 7132 conditions per place. [2025-04-13 20:34:14,546 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 851 selfloop transitions, 473 changer transitions 1/1325 dead transitions. [2025-04-13 20:34:14,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1325 transitions, 34651 flow [2025-04-13 20:34:14,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:34:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:34:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 175 transitions. [2025-04-13 20:34:14,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32169117647058826 [2025-04-13 20:34:14,547 INFO L175 Difference]: Start difference. First operand has 367 places, 1198 transitions, 29301 flow. Second operand 16 states and 175 transitions. [2025-04-13 20:34:14,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1325 transitions, 34651 flow [2025-04-13 20:34:16,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 1325 transitions, 34175 flow, removed 88 selfloop flow, removed 5 redundant places. [2025-04-13 20:34:16,919 INFO L231 Difference]: Finished difference. Result has 380 places, 1278 transitions, 32382 flow [2025-04-13 20:34:16,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=28878, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=32382, PETRI_PLACES=380, PETRI_TRANSITIONS=1278} [2025-04-13 20:34:16,921 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 348 predicate places. [2025-04-13 20:34:16,922 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 1278 transitions, 32382 flow [2025-04-13 20:34:16,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:34:16,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:16,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:16,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 20:34:16,922 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:16,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2412735, now seen corresponding path program 34 times [2025-04-13 20:34:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:16,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776621981] [2025-04-13 20:34:16,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:34:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:16,928 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:16,938 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:16,938 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:34:16,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:34:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:17,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776621981] [2025-04-13 20:34:17,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776621981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:34:17,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:34:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:34:17,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754880551] [2025-04-13 20:34:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:17,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:34:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:17,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:34:17,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:34:17,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:17,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1278 transitions, 32382 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:34:17,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:17,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:17,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:20,282 INFO L116 PetriNetUnfolderBase]: 5705/8791 cut-off events. [2025-04-13 20:34:20,282 INFO L117 PetriNetUnfolderBase]: For 272080/272080 co-relation queries the response was YES. [2025-04-13 20:34:20,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105569 conditions, 8791 events. 5705/8791 cut-off events. For 272080/272080 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 55468 event pairs, 595 based on Foata normal form. 1/8236 useless extension candidates. Maximal degree in co-relation 105349. Up to 7324 conditions per place. [2025-04-13 20:34:20,439 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 1096 selfloop transitions, 328 changer transitions 1/1425 dead transitions. [2025-04-13 20:34:20,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 1425 transitions, 38543 flow [2025-04-13 20:34:20,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:34:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:34:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2025-04-13 20:34:20,440 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34068627450980393 [2025-04-13 20:34:20,440 INFO L175 Difference]: Start difference. First operand has 380 places, 1278 transitions, 32382 flow. Second operand 12 states and 139 transitions. [2025-04-13 20:34:20,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 1425 transitions, 38543 flow [2025-04-13 20:34:23,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 1425 transitions, 37918 flow, removed 89 selfloop flow, removed 7 redundant places. [2025-04-13 20:34:23,276 INFO L231 Difference]: Finished difference. Result has 390 places, 1361 transitions, 35320 flow [2025-04-13 20:34:23,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=31810, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=961, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=35320, PETRI_PLACES=390, PETRI_TRANSITIONS=1361} [2025-04-13 20:34:23,277 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 358 predicate places. [2025-04-13 20:34:23,277 INFO L485 AbstractCegarLoop]: Abstraction has has 390 places, 1361 transitions, 35320 flow [2025-04-13 20:34:23,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:34:23,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:23,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:23,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 20:34:23,278 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:23,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:23,278 INFO L85 PathProgramCache]: Analyzing trace with hash 945836179, now seen corresponding path program 35 times [2025-04-13 20:34:23,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:23,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133561273] [2025-04-13 20:34:23,278 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:34:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:23,283 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:23,290 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:23,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:34:23,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:23,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:23,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133561273] [2025-04-13 20:34:23,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133561273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:23,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347301044] [2025-04-13 20:34:23,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:34:23,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:23,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:23,678 INFO L229 MonitoredProcess]: Starting monitored process 16 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:34:23,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:34:23,737 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:23,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:23,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:34:23,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:23,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:34:23,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:23,789 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:34:23,942 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:34:23,943 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 19 [2025-04-13 20:34:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:23,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:34:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347301044] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:24,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:34:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9] total 21 [2025-04-13 20:34:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378794354] [2025-04-13 20:34:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:24,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:34:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:24,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:34:24,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:34:24,087 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:24,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 1361 transitions, 35320 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:34:24,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:24,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:24,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:27,423 INFO L116 PetriNetUnfolderBase]: 5901/9084 cut-off events. [2025-04-13 20:34:27,423 INFO L117 PetriNetUnfolderBase]: For 308447/308447 co-relation queries the response was YES. [2025-04-13 20:34:27,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111171 conditions, 9084 events. 5901/9084 cut-off events. For 308447/308447 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 57511 event pairs, 594 based on Foata normal form. 1/8507 useless extension candidates. Maximal degree in co-relation 110945. Up to 7454 conditions per place. [2025-04-13 20:34:27,681 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 859 selfloop transitions, 614 changer transitions 1/1474 dead transitions. [2025-04-13 20:34:27,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 1474 transitions, 40456 flow [2025-04-13 20:34:27,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:34:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:34:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 187 transitions. [2025-04-13 20:34:27,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-13 20:34:27,683 INFO L175 Difference]: Start difference. First operand has 390 places, 1361 transitions, 35320 flow. Second operand 16 states and 187 transitions. [2025-04-13 20:34:27,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 1474 transitions, 40456 flow [2025-04-13 20:34:31,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 1474 transitions, 40145 flow, removed 102 selfloop flow, removed 4 redundant places. [2025-04-13 20:34:31,276 INFO L231 Difference]: Finished difference. Result has 409 places, 1435 transitions, 39014 flow [2025-04-13 20:34:31,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=35020, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=540, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=39014, PETRI_PLACES=409, PETRI_TRANSITIONS=1435} [2025-04-13 20:34:31,278 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 377 predicate places. [2025-04-13 20:34:31,278 INFO L485 AbstractCegarLoop]: Abstraction has has 409 places, 1435 transitions, 39014 flow [2025-04-13 20:34:31,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:34:31,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:31,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:31,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 20:34:31,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 20:34:31,479 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:31,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1214771471, now seen corresponding path program 36 times [2025-04-13 20:34:31,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:31,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866491833] [2025-04-13 20:34:31,479 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:34:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:31,486 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:31,493 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 20:34:31,493 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:34:31,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:34:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:31,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866491833] [2025-04-13 20:34:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866491833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:34:31,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:34:31,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:34:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026602345] [2025-04-13 20:34:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:31,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:34:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:31,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:34:31,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:34:31,776 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:31,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 1435 transitions, 39014 flow. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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:34:31,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:31,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:31,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:35,215 INFO L116 PetriNetUnfolderBase]: 5915/9115 cut-off events. [2025-04-13 20:34:35,215 INFO L117 PetriNetUnfolderBase]: For 333214/333214 co-relation queries the response was YES. [2025-04-13 20:34:35,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115189 conditions, 9115 events. 5915/9115 cut-off events. For 333214/333214 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 57793 event pairs, 711 based on Foata normal form. 1/8516 useless extension candidates. Maximal degree in co-relation 114953. Up to 8923 conditions per place. [2025-04-13 20:34:35,354 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 1359 selfloop transitions, 95 changer transitions 1/1455 dead transitions. [2025-04-13 20:34:35,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1455 transitions, 42182 flow [2025-04-13 20:34:35,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:34:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:34:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-04-13 20:34:35,355 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31699346405228757 [2025-04-13 20:34:35,355 INFO L175 Difference]: Start difference. First operand has 409 places, 1435 transitions, 39014 flow. Second operand 9 states and 97 transitions. [2025-04-13 20:34:35,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1455 transitions, 42182 flow [2025-04-13 20:34:38,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1455 transitions, 41972 flow, removed 62 selfloop flow, removed 3 redundant places. [2025-04-13 20:34:38,535 INFO L231 Difference]: Finished difference. Result has 416 places, 1439 transitions, 39131 flow [2025-04-13 20:34:38,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=38804, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=39131, PETRI_PLACES=416, PETRI_TRANSITIONS=1439} [2025-04-13 20:34:38,537 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 384 predicate places. [2025-04-13 20:34:38,537 INFO L485 AbstractCegarLoop]: Abstraction has has 416 places, 1439 transitions, 39131 flow [2025-04-13 20:34:38,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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:34:38,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:38,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:38,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 20:34:38,537 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:38,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash 772588487, now seen corresponding path program 37 times [2025-04-13 20:34:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:38,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089330942] [2025-04-13 20:34:38,538 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:34:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:38,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:34:38,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:38,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:34:38,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:38,951 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:34:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:38,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089330942] [2025-04-13 20:34:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089330942] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:38,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834224627] [2025-04-13 20:34:38,951 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:34:38,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:38,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:38,953 INFO L229 MonitoredProcess]: Starting monitored process 17 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:34:38,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:34:39,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:34:39,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:39,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:34:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:39,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 20:34:39,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:39,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:34:39,064 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:34:39,084 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:34:39,085 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 11 treesize of output 11 [2025-04-13 20:34:39,103 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:34:39,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:34:39,245 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:34:39,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:34:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834224627] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:39,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:34:39,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 25 [2025-04-13 20:34:39,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397309655] [2025-04-13 20:34:39,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:39,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:34:39,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:39,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:34:39,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:34:39,381 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:39,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 1439 transitions, 39131 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:34:39,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:39,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:39,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:42,351 INFO L116 PetriNetUnfolderBase]: 5915/9114 cut-off events. [2025-04-13 20:34:42,351 INFO L117 PetriNetUnfolderBase]: For 331200/331200 co-relation queries the response was YES. [2025-04-13 20:34:42,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115094 conditions, 9114 events. 5915/9114 cut-off events. For 331200/331200 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 57916 event pairs, 633 based on Foata normal form. 1/8515 useless extension candidates. Maximal degree in co-relation 114853. Up to 8129 conditions per place. [2025-04-13 20:34:42,496 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 1156 selfloop transitions, 317 changer transitions 1/1474 dead transitions. [2025-04-13 20:34:42,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 1474 transitions, 42422 flow [2025-04-13 20:34:42,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:34:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:34:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2025-04-13 20:34:42,497 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37967914438502676 [2025-04-13 20:34:42,497 INFO L175 Difference]: Start difference. First operand has 416 places, 1439 transitions, 39131 flow. Second operand 11 states and 142 transitions. [2025-04-13 20:34:42,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 1474 transitions, 42422 flow [2025-04-13 20:34:45,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 1474 transitions, 42139 flow, removed 62 selfloop flow, removed 5 redundant places. [2025-04-13 20:34:45,831 INFO L231 Difference]: Finished difference. Result has 422 places, 1441 transitions, 39582 flow [2025-04-13 20:34:45,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=38864, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=39582, PETRI_PLACES=422, PETRI_TRANSITIONS=1441} [2025-04-13 20:34:45,832 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 390 predicate places. [2025-04-13 20:34:45,832 INFO L485 AbstractCegarLoop]: Abstraction has has 422 places, 1441 transitions, 39582 flow [2025-04-13 20:34:45,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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:34:45,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:45,832 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:45,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 20:34:46,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 20:34:46,037 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:46,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash -685822162, now seen corresponding path program 1 times [2025-04-13 20:34:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:46,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399755062] [2025-04-13 20:34:46,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:34:46,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:46,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:34:46,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:34:46,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:34:46,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:46,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399755062] [2025-04-13 20:34:46,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399755062] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:46,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641846198] [2025-04-13 20:34:46,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:34:46,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:46,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:46,105 INFO L229 MonitoredProcess]: Starting monitored process 18 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:34:46,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:34:46,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:34:46,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:34:46,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:34:46,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:46,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:34:46,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:46,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641846198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:34:46,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:34:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:34:46,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090389010] [2025-04-13 20:34:46,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:34:46,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:34:46,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:46,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:34:46,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:34:46,318 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:46,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 1441 transitions, 39582 flow. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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:34:46,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:46,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:46,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:50,691 INFO L116 PetriNetUnfolderBase]: 7090/11508 cut-off events. [2025-04-13 20:34:50,691 INFO L117 PetriNetUnfolderBase]: For 502696/502696 co-relation queries the response was YES. [2025-04-13 20:34:51,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137146 conditions, 11508 events. 7090/11508 cut-off events. For 502696/502696 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 81739 event pairs, 2215 based on Foata normal form. 543/11340 useless extension candidates. Maximal degree in co-relation 136398. Up to 9113 conditions per place. [2025-04-13 20:34:51,096 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 1689 selfloop transitions, 39 changer transitions 45/1773 dead transitions. [2025-04-13 20:34:51,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1773 transitions, 49682 flow [2025-04-13 20:34:51,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:34:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:34:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2025-04-13 20:34:51,096 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33088235294117646 [2025-04-13 20:34:51,096 INFO L175 Difference]: Start difference. First operand has 422 places, 1441 transitions, 39582 flow. Second operand 8 states and 90 transitions. [2025-04-13 20:34:51,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1773 transitions, 49682 flow [2025-04-13 20:34:56,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 1773 transitions, 49252 flow, removed 19 selfloop flow, removed 6 redundant places. [2025-04-13 20:34:56,157 INFO L231 Difference]: Finished difference. Result has 426 places, 1476 transitions, 40161 flow [2025-04-13 20:34:56,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=39206, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=40161, PETRI_PLACES=426, PETRI_TRANSITIONS=1476} [2025-04-13 20:34:56,158 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 394 predicate places. [2025-04-13 20:34:56,158 INFO L485 AbstractCegarLoop]: Abstraction has has 426 places, 1476 transitions, 40161 flow [2025-04-13 20:34:56,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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:34:56,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:56,158 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:34:56,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 20:34:56,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:56,363 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:56,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1617645276, now seen corresponding path program 1 times [2025-04-13 20:34:56,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:56,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763913731] [2025-04-13 20:34:56,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:34:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:34:56,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:34:56,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:34:56,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:56,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763913731] [2025-04-13 20:34:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763913731] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:56,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216457058] [2025-04-13 20:34:56,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:34:56,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:56,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:56,414 INFO L229 MonitoredProcess]: Starting monitored process 19 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:34:56,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:34:56,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:34:56,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:34:56,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:34:56,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:56,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:34:56,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:56,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:56,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216457058] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:34:56,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:34:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 20:34:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234359917] [2025-04-13 20:34:56,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:34:56,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:34:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:56,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:34:56,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:34:56,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:34:56,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1476 transitions, 40161 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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:34:56,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:56,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:34:56,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:00,570 INFO L116 PetriNetUnfolderBase]: 6420/10399 cut-off events. [2025-04-13 20:35:00,570 INFO L117 PetriNetUnfolderBase]: For 390056/390056 co-relation queries the response was YES. [2025-04-13 20:35:00,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128272 conditions, 10399 events. 6420/10399 cut-off events. For 390056/390056 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 72521 event pairs, 2019 based on Foata normal form. 110/9909 useless extension candidates. Maximal degree in co-relation 127670. Up to 9113 conditions per place. [2025-04-13 20:35:00,885 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 1437 selfloop transitions, 6 changer transitions 192/1635 dead transitions. [2025-04-13 20:35:00,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 1635 transitions, 46702 flow [2025-04-13 20:35:00,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:35:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:35:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2025-04-13 20:35:00,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31985294117647056 [2025-04-13 20:35:00,886 INFO L175 Difference]: Start difference. First operand has 426 places, 1476 transitions, 40161 flow. Second operand 8 states and 87 transitions. [2025-04-13 20:35:00,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 1635 transitions, 46702 flow [2025-04-13 20:35:05,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 1635 transitions, 46668 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-04-13 20:35:05,202 INFO L231 Difference]: Finished difference. Result has 434 places, 1443 transitions, 39504 flow [2025-04-13 20:35:05,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=40017, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=39504, PETRI_PLACES=434, PETRI_TRANSITIONS=1443} [2025-04-13 20:35:05,204 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 402 predicate places. [2025-04-13 20:35:05,204 INFO L485 AbstractCegarLoop]: Abstraction has has 434 places, 1443 transitions, 39504 flow [2025-04-13 20:35:05,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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:35:05,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:05,204 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:05,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 20:35:05,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:05,405 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:05,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1138447200, now seen corresponding path program 2 times [2025-04-13 20:35:05,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:05,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017463122] [2025-04-13 20:35:05,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:35:05,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:05,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:05,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:05,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:35:05,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:05,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:05,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017463122] [2025-04-13 20:35:05,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017463122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:35:05,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:35:05,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:35:05,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524497213] [2025-04-13 20:35:05,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:05,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:35:05,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:05,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:35:05,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:35:05,469 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:35:05,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 1443 transitions, 39504 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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:35:05,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:05,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:35:05,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:09,421 INFO L116 PetriNetUnfolderBase]: 6553/10062 cut-off events. [2025-04-13 20:35:09,422 INFO L117 PetriNetUnfolderBase]: For 411742/411742 co-relation queries the response was YES. [2025-04-13 20:35:09,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130226 conditions, 10062 events. 6553/10062 cut-off events. For 411742/411742 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 64497 event pairs, 921 based on Foata normal form. 54/9382 useless extension candidates. Maximal degree in co-relation 129990. Up to 3899 conditions per place. [2025-04-13 20:35:09,637 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 1552 selfloop transitions, 212 changer transitions 10/1774 dead transitions. [2025-04-13 20:35:09,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1774 transitions, 51129 flow [2025-04-13 20:35:09,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:35:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:35:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-04-13 20:35:09,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-04-13 20:35:09,638 INFO L175 Difference]: Start difference. First operand has 434 places, 1443 transitions, 39504 flow. Second operand 6 states and 92 transitions. [2025-04-13 20:35:09,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 1774 transitions, 51129 flow [2025-04-13 20:35:13,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 1774 transitions, 50873 flow, removed 122 selfloop flow, removed 5 redundant places. [2025-04-13 20:35:13,451 INFO L231 Difference]: Finished difference. Result has 429 places, 1454 transitions, 40544 flow [2025-04-13 20:35:13,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=39142, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=40544, PETRI_PLACES=429, PETRI_TRANSITIONS=1454} [2025-04-13 20:35:13,453 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 397 predicate places. [2025-04-13 20:35:13,453 INFO L485 AbstractCegarLoop]: Abstraction has has 429 places, 1454 transitions, 40544 flow [2025-04-13 20:35:13,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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:35:13,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:13,453 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:13,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 20:35:13,453 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:13,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1930329718, now seen corresponding path program 1 times [2025-04-13 20:35:13,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:13,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609147992] [2025-04-13 20:35:13,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:35:13,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:13,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:35:13,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:13,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:35:13,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:35:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:13,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609147992] [2025-04-13 20:35:13,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609147992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:13,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935664707] [2025-04-13 20:35:13,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:35:13,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:13,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:13,520 INFO L229 MonitoredProcess]: Starting monitored process 20 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:35:13,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:35:13,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:35:13,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:13,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:35:13,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:13,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:35:13,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:35:13,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:35:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935664707] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:35:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-04-13 20:35:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14251847] [2025-04-13 20:35:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:13,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:35:13,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:13,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:35:13,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:35:13,678 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:35:13,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 1454 transitions, 40544 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:35:13,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:13,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:35:13,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:15,848 INFO L116 PetriNetUnfolderBase]: 4272/6262 cut-off events. [2025-04-13 20:35:15,848 INFO L117 PetriNetUnfolderBase]: For 317239/317239 co-relation queries the response was YES. [2025-04-13 20:35:15,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87537 conditions, 6262 events. 4272/6262 cut-off events. For 317239/317239 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 33895 event pairs, 716 based on Foata normal form. 576/6544 useless extension candidates. Maximal degree in co-relation 87349. Up to 3905 conditions per place. [2025-04-13 20:35:15,992 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 1113 selfloop transitions, 111 changer transitions 0/1224 dead transitions. [2025-04-13 20:35:15,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 1224 transitions, 35512 flow [2025-04-13 20:35:15,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:35:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:35:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2025-04-13 20:35:15,993 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31862745098039214 [2025-04-13 20:35:15,993 INFO L175 Difference]: Start difference. First operand has 429 places, 1454 transitions, 40544 flow. Second operand 6 states and 65 transitions. [2025-04-13 20:35:15,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 1224 transitions, 35512 flow [2025-04-13 20:35:18,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 1224 transitions, 33803 flow, removed 597 selfloop flow, removed 30 redundant places. [2025-04-13 20:35:18,267 INFO L231 Difference]: Finished difference. Result has 383 places, 1099 transitions, 28708 flow [2025-04-13 20:35:18,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=28486, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1099, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=988, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=28708, PETRI_PLACES=383, PETRI_TRANSITIONS=1099} [2025-04-13 20:35:18,269 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 351 predicate places. [2025-04-13 20:35:18,269 INFO L485 AbstractCegarLoop]: Abstraction has has 383 places, 1099 transitions, 28708 flow [2025-04-13 20:35:18,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:35:18,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:18,269 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:18,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 20:35:18,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:18,470 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:18,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1994791496, now seen corresponding path program 2 times [2025-04-13 20:35:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:18,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91062869] [2025-04-13 20:35:18,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:35:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:18,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:18,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:18,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:35:18,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:18,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:18,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91062869] [2025-04-13 20:35:18,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91062869] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:18,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139811239] [2025-04-13 20:35:18,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:35:18,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:18,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:18,638 INFO L229 MonitoredProcess]: Starting monitored process 21 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:35:18,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:35:18,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:18,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:18,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:35:18,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:18,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:35:18,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:35:18,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:35:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139811239] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:18,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:35:18,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:35:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187467296] [2025-04-13 20:35:18,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:18,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:35:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:18,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:35:18,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:35:18,801 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:35:18,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1099 transitions, 28708 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:35:18,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:18,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:35:18,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:20,432 INFO L116 PetriNetUnfolderBase]: 4313/6333 cut-off events. [2025-04-13 20:35:20,432 INFO L117 PetriNetUnfolderBase]: For 249537/249537 co-relation queries the response was YES. [2025-04-13 20:35:20,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83322 conditions, 6333 events. 4313/6333 cut-off events. For 249537/249537 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 34080 event pairs, 860 based on Foata normal form. 44/6043 useless extension candidates. Maximal degree in co-relation 83159. Up to 4706 conditions per place. [2025-04-13 20:35:20,715 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 1125 selfloop transitions, 43 changer transitions 0/1168 dead transitions. [2025-04-13 20:35:20,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 1168 transitions, 32176 flow [2025-04-13 20:35:20,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:35:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:35:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2025-04-13 20:35:20,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31932773109243695 [2025-04-13 20:35:20,716 INFO L175 Difference]: Start difference. First operand has 383 places, 1099 transitions, 28708 flow. Second operand 7 states and 76 transitions. [2025-04-13 20:35:20,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 1168 transitions, 32176 flow [2025-04-13 20:35:22,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 1168 transitions, 31780 flow, removed 72 selfloop flow, removed 8 redundant places. [2025-04-13 20:35:22,814 INFO L231 Difference]: Finished difference. Result has 383 places, 1106 transitions, 28702 flow [2025-04-13 20:35:22,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=28379, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1097, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=28702, PETRI_PLACES=383, PETRI_TRANSITIONS=1106} [2025-04-13 20:35:22,815 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 351 predicate places. [2025-04-13 20:35:22,815 INFO L485 AbstractCegarLoop]: Abstraction has has 383 places, 1106 transitions, 28702 flow [2025-04-13 20:35:22,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:35:22,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:22,816 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:22,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 20:35:23,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 20:35:23,016 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:23,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1166690470, now seen corresponding path program 3 times [2025-04-13 20:35:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:23,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024131605] [2025-04-13 20:35:23,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:35:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:23,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:23,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:23,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:35:23,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:23,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024131605] [2025-04-13 20:35:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024131605] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:23,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598571582] [2025-04-13 20:35:23,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:35:23,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:23,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:23,066 INFO L229 MonitoredProcess]: Starting monitored process 22 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:35:23,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:35:23,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:23,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:23,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:35:23,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:23,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:35:23,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:35:23,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:35:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598571582] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:23,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:35:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:35:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200728501] [2025-04-13 20:35:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:23,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:35:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:23,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:35:23,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:35:23,251 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:35:23,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1106 transitions, 28702 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:35:23,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:23,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:35:23,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:25,211 INFO L116 PetriNetUnfolderBase]: 4368/6425 cut-off events. [2025-04-13 20:35:25,211 INFO L117 PetriNetUnfolderBase]: For 235965/235965 co-relation queries the response was YES. [2025-04-13 20:35:25,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82707 conditions, 6425 events. 4368/6425 cut-off events. For 235965/235965 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 34709 event pairs, 483 based on Foata normal form. 45/6124 useless extension candidates. Maximal degree in co-relation 82547. Up to 4621 conditions per place. [2025-04-13 20:35:25,319 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 1140 selfloop transitions, 85 changer transitions 0/1225 dead transitions. [2025-04-13 20:35:25,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 1225 transitions, 33735 flow [2025-04-13 20:35:25,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:35:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:35:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-13 20:35:25,319 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33613445378151263 [2025-04-13 20:35:25,319 INFO L175 Difference]: Start difference. First operand has 383 places, 1106 transitions, 28702 flow. Second operand 7 states and 80 transitions. [2025-04-13 20:35:25,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 1225 transitions, 33735 flow [2025-04-13 20:35:27,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 1225 transitions, 33675 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-13 20:35:27,361 INFO L231 Difference]: Finished difference. Result has 388 places, 1125 transitions, 29879 flow [2025-04-13 20:35:27,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=28650, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=29879, PETRI_PLACES=388, PETRI_TRANSITIONS=1125} [2025-04-13 20:35:27,362 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 356 predicate places. [2025-04-13 20:35:27,362 INFO L485 AbstractCegarLoop]: Abstraction has has 388 places, 1125 transitions, 29879 flow [2025-04-13 20:35:27,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:35:27,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:27,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:27,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 20:35:27,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 20:35:27,563 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:27,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1187529260, now seen corresponding path program 4 times [2025-04-13 20:35:27,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:27,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422217943] [2025-04-13 20:35:27,564 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:35:27,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:27,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:27,573 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 26 statements. [2025-04-13 20:35:27,574 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:35:27,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:27,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:27,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422217943] [2025-04-13 20:35:27,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422217943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:27,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957707850] [2025-04-13 20:35:27,592 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:35:27,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:27,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:27,594 INFO L229 MonitoredProcess]: Starting monitored process 23 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:35:27,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:35:27,658 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:27,666 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 26 statements. [2025-04-13 20:35:27,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:35:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:27,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:35:27,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:27,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:27,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957707850] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:35:27,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:35:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-13 20:35:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624932379] [2025-04-13 20:35:27,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:35:27,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:35:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:27,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:35:27,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:35:27,722 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:35:27,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1125 transitions, 29879 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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:35:27,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:27,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:35:27,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:30,122 INFO L116 PetriNetUnfolderBase]: 5420/7910 cut-off events. [2025-04-13 20:35:30,122 INFO L117 PetriNetUnfolderBase]: For 302919/302919 co-relation queries the response was YES. [2025-04-13 20:35:30,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100862 conditions, 7910 events. 5420/7910 cut-off events. For 302919/302919 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 43738 event pairs, 135 based on Foata normal form. 12/7435 useless extension candidates. Maximal degree in co-relation 100699. Up to 2666 conditions per place. [2025-04-13 20:35:30,272 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 1419 selfloop transitions, 391 changer transitions 0/1810 dead transitions. [2025-04-13 20:35:30,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 1810 transitions, 50223 flow [2025-04-13 20:35:30,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:35:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:35:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2025-04-13 20:35:30,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4502262443438914 [2025-04-13 20:35:30,273 INFO L175 Difference]: Start difference. First operand has 388 places, 1125 transitions, 29879 flow. Second operand 13 states and 199 transitions. [2025-04-13 20:35:30,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 1810 transitions, 50223 flow [2025-04-13 20:35:32,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 1810 transitions, 50062 flow, removed 78 selfloop flow, removed 3 redundant places. [2025-04-13 20:35:33,000 INFO L231 Difference]: Finished difference. Result has 403 places, 1323 transitions, 36787 flow [2025-04-13 20:35:33,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=29840, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=36787, PETRI_PLACES=403, PETRI_TRANSITIONS=1323} [2025-04-13 20:35:33,001 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 371 predicate places. [2025-04-13 20:35:33,002 INFO L485 AbstractCegarLoop]: Abstraction has has 403 places, 1323 transitions, 36787 flow [2025-04-13 20:35:33,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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:35:33,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:33,002 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:33,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 20:35:33,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:33,202 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:33,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash 789503476, now seen corresponding path program 5 times [2025-04-13 20:35:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:33,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566416638] [2025-04-13 20:35:33,203 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:35:33,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:33,209 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:33,213 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:33,214 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:35:33,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:33,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:33,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566416638] [2025-04-13 20:35:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566416638] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:33,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080073442] [2025-04-13 20:35:33,251 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:35:33,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:33,254 INFO L229 MonitoredProcess]: Starting monitored process 24 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:35:33,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:35:33,321 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:33,343 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:33,343 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:35:33,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:33,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:35:33,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:33,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:33,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080073442] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:35:33,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:35:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 20:35:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360820939] [2025-04-13 20:35:33,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:35:33,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:35:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:33,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:35:33,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:35:33,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:35:33,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1323 transitions, 36787 flow. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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:35:33,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:33,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:35:33,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:37,176 INFO L116 PetriNetUnfolderBase]: 7669/11147 cut-off events. [2025-04-13 20:35:37,177 INFO L117 PetriNetUnfolderBase]: For 489008/489008 co-relation queries the response was YES. [2025-04-13 20:35:37,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140582 conditions, 11147 events. 7669/11147 cut-off events. For 489008/489008 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 63686 event pairs, 346 based on Foata normal form. 16/10792 useless extension candidates. Maximal degree in co-relation 140413. Up to 3723 conditions per place. [2025-04-13 20:35:37,358 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 1465 selfloop transitions, 574 changer transitions 0/2039 dead transitions. [2025-04-13 20:35:37,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 2039 transitions, 58813 flow [2025-04-13 20:35:37,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:35:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:35:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 209 transitions. [2025-04-13 20:35:37,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43907563025210083 [2025-04-13 20:35:37,359 INFO L175 Difference]: Start difference. First operand has 403 places, 1323 transitions, 36787 flow. Second operand 14 states and 209 transitions. [2025-04-13 20:35:37,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 2039 transitions, 58813 flow [2025-04-13 20:35:41,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 2039 transitions, 57974 flow, removed 329 selfloop flow, removed 4 redundant places. [2025-04-13 20:35:41,586 INFO L231 Difference]: Finished difference. Result has 419 places, 1561 transitions, 44993 flow [2025-04-13 20:35:41,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=36262, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=369, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=910, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=44993, PETRI_PLACES=419, PETRI_TRANSITIONS=1561} [2025-04-13 20:35:41,588 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 387 predicate places. [2025-04-13 20:35:41,588 INFO L485 AbstractCegarLoop]: Abstraction has has 419 places, 1561 transitions, 44993 flow [2025-04-13 20:35:41,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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:35:41,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:41,588 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:41,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 20:35:41,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:41,789 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:41,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1916265408, now seen corresponding path program 6 times [2025-04-13 20:35:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:41,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017144523] [2025-04-13 20:35:41,789 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:35:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:41,796 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:35:41,803 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:41,803 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:35:41,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:35:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:41,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017144523] [2025-04-13 20:35:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017144523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:35:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:35:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:35:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231123140] [2025-04-13 20:35:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:41,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:35:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:41,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:35:41,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:35:41,911 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:35:41,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 1561 transitions, 44993 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:35:41,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:41,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:35:41,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:46,102 INFO L116 PetriNetUnfolderBase]: 7648/11116 cut-off events. [2025-04-13 20:35:46,102 INFO L117 PetriNetUnfolderBase]: For 513582/513582 co-relation queries the response was YES. [2025-04-13 20:35:46,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143543 conditions, 11116 events. 7648/11116 cut-off events. For 513582/513582 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 63784 event pairs, 841 based on Foata normal form. 16/10769 useless extension candidates. Maximal degree in co-relation 143369. Up to 5992 conditions per place. [2025-04-13 20:35:46,275 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 1413 selfloop transitions, 305 changer transitions 8/1726 dead transitions. [2025-04-13 20:35:46,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 1726 transitions, 52435 flow [2025-04-13 20:35:46,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:35:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:35:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2025-04-13 20:35:46,276 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36134453781512604 [2025-04-13 20:35:46,276 INFO L175 Difference]: Start difference. First operand has 419 places, 1561 transitions, 44993 flow. Second operand 7 states and 86 transitions. [2025-04-13 20:35:46,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 1726 transitions, 52435 flow [2025-04-13 20:35:50,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 1726 transitions, 51737 flow, removed 342 selfloop flow, removed 1 redundant places. [2025-04-13 20:35:50,571 INFO L231 Difference]: Finished difference. Result has 426 places, 1569 transitions, 45388 flow [2025-04-13 20:35:50,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=44323, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=293, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=45388, PETRI_PLACES=426, PETRI_TRANSITIONS=1569} [2025-04-13 20:35:50,572 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 394 predicate places. [2025-04-13 20:35:50,572 INFO L485 AbstractCegarLoop]: Abstraction has has 426 places, 1569 transitions, 45388 flow [2025-04-13 20:35:50,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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:35:50,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:50,573 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:50,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 20:35:50,573 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:50,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2041899538, now seen corresponding path program 7 times [2025-04-13 20:35:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:50,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631582951] [2025-04-13 20:35:50,573 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:35:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:50,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:35:50,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:50,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:35:50,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:35:50,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:50,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631582951] [2025-04-13 20:35:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631582951] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:50,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909077410] [2025-04-13 20:35:50,659 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:35:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:50,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:50,661 INFO L229 MonitoredProcess]: Starting monitored process 25 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:35:50,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 20:35:50,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:35:50,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:35:50,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:35:50,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:50,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:35:50,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:35:50,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:35:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909077410] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:50,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:35:50,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-04-13 20:35:50,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587634171] [2025-04-13 20:35:50,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:50,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:35:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:50,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:35:50,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:35:50,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:35:50,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1569 transitions, 45388 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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:35:50,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:50,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:35:50,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:55,329 INFO L116 PetriNetUnfolderBase]: 7788/11240 cut-off events. [2025-04-13 20:35:55,330 INFO L117 PetriNetUnfolderBase]: For 516394/516394 co-relation queries the response was YES. [2025-04-13 20:35:55,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143572 conditions, 11240 events. 7788/11240 cut-off events. For 516394/516394 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 63023 event pairs, 929 based on Foata normal form. 90/10904 useless extension candidates. Maximal degree in co-relation 143395. Up to 7336 conditions per place. [2025-04-13 20:35:55,540 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 1413 selfloop transitions, 352 changer transitions 0/1765 dead transitions. [2025-04-13 20:35:55,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 1765 transitions, 53348 flow [2025-04-13 20:35:55,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:35:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:35:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2025-04-13 20:35:55,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3403361344537815 [2025-04-13 20:35:55,541 INFO L175 Difference]: Start difference. First operand has 426 places, 1569 transitions, 45388 flow. Second operand 7 states and 81 transitions. [2025-04-13 20:35:55,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 1765 transitions, 53348 flow [2025-04-13 20:35:59,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 1765 transitions, 52837 flow, removed 62 selfloop flow, removed 6 redundant places. [2025-04-13 20:35:59,990 INFO L231 Difference]: Finished difference. Result has 426 places, 1577 transitions, 46209 flow [2025-04-13 20:35:59,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=44723, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=335, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=46209, PETRI_PLACES=426, PETRI_TRANSITIONS=1577} [2025-04-13 20:35:59,992 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 394 predicate places. [2025-04-13 20:35:59,992 INFO L485 AbstractCegarLoop]: Abstraction has has 426 places, 1577 transitions, 46209 flow [2025-04-13 20:35:59,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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:35:59,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:59,993 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:35:59,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:36:00,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 20:36:00,193 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:00,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash 427719645, now seen corresponding path program 1 times [2025-04-13 20:36:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:00,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32593258] [2025-04-13 20:36:00,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:00,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:36:00,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:36:00,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:00,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:36:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:00,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32593258] [2025-04-13 20:36:00,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32593258] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:00,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492504968] [2025-04-13 20:36:00,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:36:00,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:00,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:00,928 INFO L229 MonitoredProcess]: Starting monitored process 26 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:36:00,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 20:36:00,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:36:01,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:36:01,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:01,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:01,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 20:36:01,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:01,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:36:01,070 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 20:36:01,092 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:36:01,092 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 11 treesize of output 11 [2025-04-13 20:36:01,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:36:01,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 20:36:01,455 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:01,455 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 20:36:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:36:01,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:36:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492504968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:01,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:01,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 10] total 40 [2025-04-13 20:36:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592645347] [2025-04-13 20:36:01,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:01,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 20:36:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:01,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 20:36:01,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1576, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 20:36:01,778 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:36:01,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 1577 transitions, 46209 flow. Second operand has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 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:36:01,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:01,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:36:01,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:09,121 INFO L116 PetriNetUnfolderBase]: 9201/13341 cut-off events. [2025-04-13 20:36:09,122 INFO L117 PetriNetUnfolderBase]: For 602375/602375 co-relation queries the response was YES. [2025-04-13 20:36:09,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171134 conditions, 13341 events. 9201/13341 cut-off events. For 602375/602375 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 77724 event pairs, 584 based on Foata normal form. 1/12919 useless extension candidates. Maximal degree in co-relation 170958. Up to 11410 conditions per place. [2025-04-13 20:36:09,507 INFO L140 encePairwiseOnDemand]: 16/34 looper letters, 1490 selfloop transitions, 469 changer transitions 4/1963 dead transitions. [2025-04-13 20:36:09,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1963 transitions, 59454 flow [2025-04-13 20:36:09,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 20:36:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 20:36:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 303 transitions. [2025-04-13 20:36:09,508 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3300653594771242 [2025-04-13 20:36:09,508 INFO L175 Difference]: Start difference. First operand has 426 places, 1577 transitions, 46209 flow. Second operand 27 states and 303 transitions. [2025-04-13 20:36:09,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1963 transitions, 59454 flow [2025-04-13 20:36:14,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 1963 transitions, 59384 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-04-13 20:36:14,503 INFO L231 Difference]: Finished difference. Result has 457 places, 1776 transitions, 53842 flow [2025-04-13 20:36:14,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=46149, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=53842, PETRI_PLACES=457, PETRI_TRANSITIONS=1776} [2025-04-13 20:36:14,504 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 425 predicate places. [2025-04-13 20:36:14,504 INFO L485 AbstractCegarLoop]: Abstraction has has 457 places, 1776 transitions, 53842 flow [2025-04-13 20:36:14,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 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:36:14,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:14,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:14,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 20:36:14,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:14,706 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:14,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1960342501, now seen corresponding path program 2 times [2025-04-13 20:36:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:14,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010698283] [2025-04-13 20:36:14,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:36:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:14,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:36:14,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:36:14,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:36:14,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:36:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:15,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010698283] [2025-04-13 20:36:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010698283] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:15,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606615496] [2025-04-13 20:36:15,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:36:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:15,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:15,156 INFO L229 MonitoredProcess]: Starting monitored process 27 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:36:15,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 20:36:15,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:36:15,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:36:15,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:36:15,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:15,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:36:15,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:15,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:36:15,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:36:15,511 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 20:36:15,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 59 [2025-04-13 20:36:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:36:15,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:15,824 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:15,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:36:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:36:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606615496] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:15,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:15,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 30 [2025-04-13 20:36:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386960339] [2025-04-13 20:36:15,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:15,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:36:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:15,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:36:15,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:36:15,923 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:36:15,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 1776 transitions, 53842 flow. Second operand has 32 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 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:36:15,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:15,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:36:15,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:24,375 INFO L116 PetriNetUnfolderBase]: 9986/14482 cut-off events. [2025-04-13 20:36:24,376 INFO L117 PetriNetUnfolderBase]: For 695260/695260 co-relation queries the response was YES. [2025-04-13 20:36:24,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191338 conditions, 14482 events. 9986/14482 cut-off events. For 695260/695260 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 85856 event pairs, 592 based on Foata normal form. 1/14443 useless extension candidates. Maximal degree in co-relation 191153. Up to 11422 conditions per place. [2025-04-13 20:36:25,069 INFO L140 encePairwiseOnDemand]: 16/34 looper letters, 1330 selfloop transitions, 717 changer transitions 4/2051 dead transitions. [2025-04-13 20:36:25,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 2051 transitions, 62992 flow [2025-04-13 20:36:25,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:36:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:36:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 279 transitions. [2025-04-13 20:36:25,070 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2930672268907563 [2025-04-13 20:36:25,070 INFO L175 Difference]: Start difference. First operand has 457 places, 1776 transitions, 53842 flow. Second operand 28 states and 279 transitions. [2025-04-13 20:36:25,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 2051 transitions, 62992 flow [2025-04-13 20:36:32,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 2051 transitions, 61417 flow, removed 676 selfloop flow, removed 6 redundant places. [2025-04-13 20:36:32,100 INFO L231 Difference]: Finished difference. Result has 490 places, 1897 transitions, 57023 flow [2025-04-13 20:36:32,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=52333, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=601, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1075, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=57023, PETRI_PLACES=490, PETRI_TRANSITIONS=1897} [2025-04-13 20:36:32,103 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 458 predicate places. [2025-04-13 20:36:32,103 INFO L485 AbstractCegarLoop]: Abstraction has has 490 places, 1897 transitions, 57023 flow [2025-04-13 20:36:32,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 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:36:32,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:32,103 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:32,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 20:36:32,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-04-13 20:36:32,304 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:32,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1959747855, now seen corresponding path program 3 times [2025-04-13 20:36:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:32,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983627884] [2025-04-13 20:36:32,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:36:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:32,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:36:32,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:36:32,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:36:32,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:36:32,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:32,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983627884] [2025-04-13 20:36:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983627884] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:32,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470557496] [2025-04-13 20:36:32,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:36:32,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:32,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:32,911 INFO L229 MonitoredProcess]: Starting monitored process 28 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:36:32,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 20:36:32,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:36:32,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:36:32,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:36:32,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:33,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:36:33,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:33,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:36:33,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:36:33,268 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 20:36:33,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 59 [2025-04-13 20:36:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:36:33,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:33,557 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:33,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:36:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:36:33,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470557496] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:33,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:33,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 30 [2025-04-13 20:36:33,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664833111] [2025-04-13 20:36:33,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:33,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:36:33,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:33,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:36:33,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:36:33,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:36:33,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 1897 transitions, 57023 flow. Second operand has 32 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 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:36:33,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:33,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:36:33,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:42,400 INFO L116 PetriNetUnfolderBase]: 10660/15443 cut-off events. [2025-04-13 20:36:42,401 INFO L117 PetriNetUnfolderBase]: For 729387/729387 co-relation queries the response was YES. [2025-04-13 20:36:43,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203390 conditions, 15443 events. 10660/15443 cut-off events. For 729387/729387 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 92121 event pairs, 606 based on Foata normal form. 1/15407 useless extension candidates. Maximal degree in co-relation 203193. Up to 11763 conditions per place. [2025-04-13 20:36:43,162 INFO L140 encePairwiseOnDemand]: 16/34 looper letters, 1375 selfloop transitions, 753 changer transitions 3/2131 dead transitions. [2025-04-13 20:36:43,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 2131 transitions, 65438 flow [2025-04-13 20:36:43,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 20:36:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-13 20:36:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 307 transitions. [2025-04-13 20:36:43,163 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31135902636916835 [2025-04-13 20:36:43,163 INFO L175 Difference]: Start difference. First operand has 490 places, 1897 transitions, 57023 flow. Second operand 29 states and 307 transitions. [2025-04-13 20:36:43,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 2131 transitions, 65438 flow [2025-04-13 20:36:50,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 2131 transitions, 64610 flow, removed 188 selfloop flow, removed 9 redundant places. [2025-04-13 20:36:50,298 INFO L231 Difference]: Finished difference. Result has 515 places, 1951 transitions, 59443 flow [2025-04-13 20:36:50,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=56233, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1897, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=709, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=59443, PETRI_PLACES=515, PETRI_TRANSITIONS=1951} [2025-04-13 20:36:50,300 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 483 predicate places. [2025-04-13 20:36:50,300 INFO L485 AbstractCegarLoop]: Abstraction has has 515 places, 1951 transitions, 59443 flow [2025-04-13 20:36:50,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 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:36:50,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:50,300 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:36:50,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 20:36:50,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:50,500 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:50,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash 848406341, now seen corresponding path program 4 times [2025-04-13 20:36:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:50,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650976509] [2025-04-13 20:36:50,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:36:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:50,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:36:50,519 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:36:50,519 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:36:50,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:51,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:51,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650976509] [2025-04-13 20:36:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650976509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:51,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170127204] [2025-04-13 20:36:51,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:36:51,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:51,172 INFO L229 MonitoredProcess]: Starting monitored process 29 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:36:51,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 20:36:51,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:36:51,266 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:36:51,266 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:36:51,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:51,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:36:51,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:51,581 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:51,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 179 [2025-04-13 20:36:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:36:52,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:52,315 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:36:52,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:36:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:36:52,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170127204] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:52,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:52,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 34 [2025-04-13 20:36:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396979451] [2025-04-13 20:36:52,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:52,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:36:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:52,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:36:52,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:36:52,411 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:36:52,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 1951 transitions, 59443 flow. Second operand has 36 states, 36 states have (on average 5.0) internal successors, (180), 36 states have internal predecessors, (180), 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:36:52,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:52,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:36:52,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:01,574 INFO L116 PetriNetUnfolderBase]: 10970/15904 cut-off events. [2025-04-13 20:37:01,575 INFO L117 PetriNetUnfolderBase]: For 774617/774617 co-relation queries the response was YES. [2025-04-13 20:37:02,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215328 conditions, 15904 events. 10970/15904 cut-off events. For 774617/774617 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 95429 event pairs, 652 based on Foata normal form. 1/15862 useless extension candidates. Maximal degree in co-relation 215126. Up to 13350 conditions per place. [2025-04-13 20:37:02,447 INFO L140 encePairwiseOnDemand]: 18/34 looper letters, 1482 selfloop transitions, 672 changer transitions 3/2157 dead transitions. [2025-04-13 20:37:02,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 2157 transitions, 68256 flow [2025-04-13 20:37:02,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:37:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:37:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2025-04-13 20:37:02,448 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3205882352941177 [2025-04-13 20:37:02,448 INFO L175 Difference]: Start difference. First operand has 515 places, 1951 transitions, 59443 flow. Second operand 20 states and 218 transitions. [2025-04-13 20:37:02,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 2157 transitions, 68256 flow [2025-04-13 20:37:10,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 2157 transitions, 67061 flow, removed 380 selfloop flow, removed 11 redundant places. [2025-04-13 20:37:10,811 INFO L231 Difference]: Finished difference. Result has 529 places, 2014 transitions, 61975 flow [2025-04-13 20:37:10,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=58266, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=610, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=61975, PETRI_PLACES=529, PETRI_TRANSITIONS=2014} [2025-04-13 20:37:10,813 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 497 predicate places. [2025-04-13 20:37:10,813 INFO L485 AbstractCegarLoop]: Abstraction has has 529 places, 2014 transitions, 61975 flow [2025-04-13 20:37:10,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.0) internal successors, (180), 36 states have internal predecessors, (180), 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:37:10,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:10,814 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:10,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-13 20:37:11,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:11,014 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:11,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1876150727, now seen corresponding path program 5 times [2025-04-13 20:37:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:11,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264700945] [2025-04-13 20:37:11,015 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:37:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:11,024 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:37:11,040 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:37:11,040 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:11,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:11,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:11,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264700945] [2025-04-13 20:37:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264700945] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:11,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119106305] [2025-04-13 20:37:11,641 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:37:11,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:11,643 INFO L229 MonitoredProcess]: Starting monitored process 30 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:37:11,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 20:37:11,723 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:37:11,748 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:37:11,748 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:11,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:11,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:37:11,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:12,156 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:37:12,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 20:37:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:12,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:12,340 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:37:12,341 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:37:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:37:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119106305] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:12,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:12,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 9] total 35 [2025-04-13 20:37:12,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877469361] [2025-04-13 20:37:12,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:12,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:37:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:12,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:37:12,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:37:12,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:37:12,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 2014 transitions, 61975 flow. Second operand has 37 states, 37 states have (on average 4.972972972972973) internal successors, (184), 37 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:37:12,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:12,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:37:12,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:21,089 INFO L116 PetriNetUnfolderBase]: 11067/16071 cut-off events. [2025-04-13 20:37:21,089 INFO L117 PetriNetUnfolderBase]: For 767232/767232 co-relation queries the response was YES. [2025-04-13 20:37:21,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216882 conditions, 16071 events. 11067/16071 cut-off events. For 767232/767232 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 96957 event pairs, 704 based on Foata normal form. 1/15976 useless extension candidates. Maximal degree in co-relation 216673. Up to 14366 conditions per place. [2025-04-13 20:37:21,520 INFO L140 encePairwiseOnDemand]: 16/34 looper letters, 1691 selfloop transitions, 475 changer transitions 4/2170 dead transitions. [2025-04-13 20:37:21,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 2170 transitions, 68949 flow [2025-04-13 20:37:21,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 20:37:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 20:37:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 250 transitions. [2025-04-13 20:37:21,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.319693094629156 [2025-04-13 20:37:21,521 INFO L175 Difference]: Start difference. First operand has 529 places, 2014 transitions, 61975 flow. Second operand 23 states and 250 transitions. [2025-04-13 20:37:21,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 2170 transitions, 68949 flow [2025-04-13 20:37:29,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 2170 transitions, 68110 flow, removed 157 selfloop flow, removed 9 redundant places. [2025-04-13 20:37:29,167 INFO L231 Difference]: Finished difference. Result has 546 places, 2052 transitions, 63230 flow [2025-04-13 20:37:29,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=61146, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=63230, PETRI_PLACES=546, PETRI_TRANSITIONS=2052} [2025-04-13 20:37:29,169 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 514 predicate places. [2025-04-13 20:37:29,169 INFO L485 AbstractCegarLoop]: Abstraction has has 546 places, 2052 transitions, 63230 flow [2025-04-13 20:37:29,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.972972972972973) internal successors, (184), 37 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:37:29,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:29,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:29,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 20:37:29,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:29,370 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:29,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1016086905, now seen corresponding path program 6 times [2025-04-13 20:37:29,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:29,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383511075] [2025-04-13 20:37:29,371 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:37:29,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:29,377 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:37:29,389 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:37:29,389 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:37:29,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:37:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:29,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383511075] [2025-04-13 20:37:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383511075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:29,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353528849] [2025-04-13 20:37:29,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:37:29,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:29,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:29,899 INFO L229 MonitoredProcess]: Starting monitored process 31 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:37:29,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 20:37:29,975 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:37:29,998 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:37:29,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:37:29,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:30,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:37:30,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:30,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:37:30,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:37:30,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 20:37:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:30,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:30,568 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:37:30,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:37:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:37:30,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353528849] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:30,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 31 [2025-04-13 20:37:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546218516] [2025-04-13 20:37:30,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:30,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:37:30,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:30,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:37:30,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:37:30,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:37:30,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 2052 transitions, 63230 flow. Second operand has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 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:37:30,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:30,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:37:30,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:40,138 INFO L116 PetriNetUnfolderBase]: 11523/16823 cut-off events. [2025-04-13 20:37:40,138 INFO L117 PetriNetUnfolderBase]: For 794496/794496 co-relation queries the response was YES. [2025-04-13 20:37:40,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226105 conditions, 16823 events. 11523/16823 cut-off events. For 794496/794496 co-relation queries the response was YES. Maximal size of possible extension queue 1078. Compared 103195 event pairs, 607 based on Foata normal form. 1/16731 useless extension candidates. Maximal degree in co-relation 225891. Up to 12122 conditions per place. [2025-04-13 20:37:40,911 INFO L140 encePairwiseOnDemand]: 14/34 looper letters, 1360 selfloop transitions, 1067 changer transitions 4/2431 dead transitions. [2025-04-13 20:37:40,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 2431 transitions, 74823 flow [2025-04-13 20:37:40,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:37:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:37:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 430 transitions. [2025-04-13 20:37:40,912 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3084648493543759 [2025-04-13 20:37:40,913 INFO L175 Difference]: Start difference. First operand has 546 places, 2052 transitions, 63230 flow. Second operand 41 states and 430 transitions. [2025-04-13 20:37:40,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 2431 transitions, 74823 flow [2025-04-13 20:37:49,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 2431 transitions, 74131 flow, removed 92 selfloop flow, removed 13 redundant places. [2025-04-13 20:37:49,917 INFO L231 Difference]: Finished difference. Result has 587 places, 2228 transitions, 69232 flow [2025-04-13 20:37:49,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62567, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=894, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1077, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=69232, PETRI_PLACES=587, PETRI_TRANSITIONS=2228} [2025-04-13 20:37:49,919 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 555 predicate places. [2025-04-13 20:37:49,919 INFO L485 AbstractCegarLoop]: Abstraction has has 587 places, 2228 transitions, 69232 flow [2025-04-13 20:37:49,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 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:37:49,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:49,919 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:49,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 20:37:50,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-04-13 20:37:50,120 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:50,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1214494965, now seen corresponding path program 7 times [2025-04-13 20:37:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:50,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585726533] [2025-04-13 20:37:50,121 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:37:50,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:50,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:37:50,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:37:50,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:50,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:50,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:50,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585726533] [2025-04-13 20:37:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585726533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:50,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688677270] [2025-04-13 20:37:50,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:37:50,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:50,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:50,935 INFO L229 MonitoredProcess]: Starting monitored process 32 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:37:50,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 20:37:51,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:37:51,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:37:51,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:51,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:51,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 20:37:51,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:51,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:37:51,090 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 20:37:51,113 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:37:51,113 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 11 treesize of output 11 [2025-04-13 20:37:51,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:37:51,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 20:37:51,541 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:37:51,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 47 [2025-04-13 20:37:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:51,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:37:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688677270] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:51,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 11] total 43 [2025-04-13 20:37:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203545073] [2025-04-13 20:37:51,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:51,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 20:37:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:51,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 20:37:51,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 20:37:51,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:37:51,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 2228 transitions, 69232 flow. Second operand has 45 states, 45 states have (on average 4.688888888888889) internal successors, (211), 45 states have internal predecessors, (211), 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:37:51,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:51,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:37:51,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:07,512 INFO L116 PetriNetUnfolderBase]: 16818/24629 cut-off events. [2025-04-13 20:38:07,512 INFO L117 PetriNetUnfolderBase]: For 1207577/1207577 co-relation queries the response was YES. [2025-04-13 20:38:08,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361459 conditions, 24629 events. 16818/24629 cut-off events. For 1207577/1207577 co-relation queries the response was YES. Maximal size of possible extension queue 1510. Compared 160016 event pairs, 787 based on Foata normal form. 114/24694 useless extension candidates. Maximal degree in co-relation 361230. Up to 18294 conditions per place. [2025-04-13 20:38:08,944 INFO L140 encePairwiseOnDemand]: 15/34 looper letters, 2437 selfloop transitions, 1840 changer transitions 2/4279 dead transitions. [2025-04-13 20:38:08,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 4279 transitions, 145034 flow [2025-04-13 20:38:08,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 20:38:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-04-13 20:38:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 676 transitions. [2025-04-13 20:38:08,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3058823529411765 [2025-04-13 20:38:08,946 INFO L175 Difference]: Start difference. First operand has 587 places, 2228 transitions, 69232 flow. Second operand 65 states and 676 transitions. [2025-04-13 20:38:08,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 4279 transitions, 145034 flow [2025-04-13 20:38:28,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 4279 transitions, 140785 flow, removed 894 selfloop flow, removed 24 redundant places. [2025-04-13 20:38:28,804 INFO L231 Difference]: Finished difference. Result has 645 places, 3599 transitions, 121577 flow [2025-04-13 20:38:28,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=67196, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=672, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=121577, PETRI_PLACES=645, PETRI_TRANSITIONS=3599} [2025-04-13 20:38:28,806 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 613 predicate places. [2025-04-13 20:38:28,806 INFO L485 AbstractCegarLoop]: Abstraction has has 645 places, 3599 transitions, 121577 flow [2025-04-13 20:38:28,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.688888888888889) internal successors, (211), 45 states have internal predecessors, (211), 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:38:28,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:28,807 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:38:28,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-13 20:38:29,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:29,007 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:29,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1586701109, now seen corresponding path program 8 times [2025-04-13 20:38:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:29,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445318438] [2025-04-13 20:38:29,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:29,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:38:29,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:38:29,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:29,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:38:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:29,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445318438] [2025-04-13 20:38:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445318438] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:29,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692844724] [2025-04-13 20:38:29,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:29,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:29,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:29,459 INFO L229 MonitoredProcess]: Starting monitored process 33 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:38:29,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 20:38:29,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:38:29,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:38:29,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:29,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:29,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:38:29,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:29,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:38:29,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:29,867 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 20:38:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:38:29,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:30,172 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:30,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:38:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:38:30,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692844724] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:38:30,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:38:30,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 31 [2025-04-13 20:38:30,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399144165] [2025-04-13 20:38:30,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:38:30,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:38:30,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:30,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:38:30,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:38:30,249 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:38:30,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 3599 transitions, 121577 flow. Second operand has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 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:38:30,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:30,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:38:30,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:56,170 INFO L116 PetriNetUnfolderBase]: 16932/24823 cut-off events. [2025-04-13 20:38:56,170 INFO L117 PetriNetUnfolderBase]: For 1232708/1232708 co-relation queries the response was YES. [2025-04-13 20:38:57,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369750 conditions, 24823 events. 16932/24823 cut-off events. For 1232708/1232708 co-relation queries the response was YES. Maximal size of possible extension queue 1514. Compared 161425 event pairs, 814 based on Foata normal form. 1/24775 useless extension candidates. Maximal degree in co-relation 369507. Up to 15892 conditions per place. [2025-04-13 20:38:57,200 INFO L140 encePairwiseOnDemand]: 14/34 looper letters, 1729 selfloop transitions, 2100 changer transitions 4/3833 dead transitions. [2025-04-13 20:38:57,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 3833 transitions, 133257 flow [2025-04-13 20:38:57,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 20:38:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-13 20:38:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 376 transitions. [2025-04-13 20:38:57,202 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31596638655462184 [2025-04-13 20:38:57,202 INFO L175 Difference]: Start difference. First operand has 645 places, 3599 transitions, 121577 flow. Second operand 35 states and 376 transitions. [2025-04-13 20:38:57,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 3833 transitions, 133257 flow [2025-04-13 20:39:20,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 3833 transitions, 131693 flow, removed 775 selfloop flow, removed 2 redundant places. [2025-04-13 20:39:20,885 INFO L231 Difference]: Finished difference. Result has 685 places, 3649 transitions, 125689 flow [2025-04-13 20:39:20,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=120109, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2050, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=125689, PETRI_PLACES=685, PETRI_TRANSITIONS=3649} [2025-04-13 20:39:20,888 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 653 predicate places. [2025-04-13 20:39:20,888 INFO L485 AbstractCegarLoop]: Abstraction has has 685 places, 3649 transitions, 125689 flow [2025-04-13 20:39:20,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 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:39:20,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:20,888 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:20,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 20:39:21,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:21,089 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:21,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1388293049, now seen corresponding path program 9 times [2025-04-13 20:39:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:21,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442962406] [2025-04-13 20:39:21,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:21,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:39:21,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:39:21,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:39:21,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:39:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:21,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442962406] [2025-04-13 20:39:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442962406] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:21,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568323834] [2025-04-13 20:39:21,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:21,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:21,484 INFO L229 MonitoredProcess]: Starting monitored process 34 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:39:21,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 20:39:21,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:39:21,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:39:21,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:39:21,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:21,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:39:21,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:21,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:39:21,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:39:21,956 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 20:39:21,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 59 [2025-04-13 20:39:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:39:22,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:22,355 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:22,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:39:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:39:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568323834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:22,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:22,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 30 [2025-04-13 20:39:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799533840] [2025-04-13 20:39:22,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:22,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:39:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:22,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:39:22,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:39:22,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:39:22,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 3649 transitions, 125689 flow. Second operand has 32 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 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:39:22,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:22,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:39:22,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:43,340 INFO L116 PetriNetUnfolderBase]: 16980/24900 cut-off events. [2025-04-13 20:39:43,340 INFO L117 PetriNetUnfolderBase]: For 1271818/1271818 co-relation queries the response was YES. [2025-04-13 20:39:44,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378313 conditions, 24900 events. 16980/24900 cut-off events. For 1271818/1271818 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 162163 event pairs, 768 based on Foata normal form. 1/24832 useless extension candidates. Maximal degree in co-relation 378061. Up to 15908 conditions per place. [2025-04-13 20:39:44,499 INFO L140 encePairwiseOnDemand]: 14/34 looper letters, 1740 selfloop transitions, 2113 changer transitions 5/3858 dead transitions. [2025-04-13 20:39:44,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 3858 transitions, 136673 flow [2025-04-13 20:39:44,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 20:39:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-13 20:39:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 404 transitions. [2025-04-13 20:39:44,501 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3126934984520124 [2025-04-13 20:39:44,501 INFO L175 Difference]: Start difference. First operand has 685 places, 3649 transitions, 125689 flow. Second operand 38 states and 404 transitions. [2025-04-13 20:39:44,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 3858 transitions, 136673 flow [2025-04-13 20:40:06,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 3858 transitions, 135564 flow, removed 77 selfloop flow, removed 16 redundant places. [2025-04-13 20:40:07,039 INFO L231 Difference]: Finished difference. Result has 710 places, 3662 transitions, 129225 flow [2025-04-13 20:40:07,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=124582, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=129225, PETRI_PLACES=710, PETRI_TRANSITIONS=3662} [2025-04-13 20:40:07,042 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 678 predicate places. [2025-04-13 20:40:07,042 INFO L485 AbstractCegarLoop]: Abstraction has has 710 places, 3662 transitions, 129225 flow [2025-04-13 20:40:07,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.8125) internal successors, (154), 32 states have internal predecessors, (154), 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:40:07,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:07,042 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:07,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-13 20:40:07,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 20:40:07,243 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:07,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:07,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2037053861, now seen corresponding path program 1 times [2025-04-13 20:40:07,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:07,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940245056] [2025-04-13 20:40:07,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:07,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:07,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:40:07,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:40:07,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:07,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:40:08,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:08,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940245056] [2025-04-13 20:40:08,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940245056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:08,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320179897] [2025-04-13 20:40:08,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:08,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:08,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:08,012 INFO L229 MonitoredProcess]: Starting monitored process 35 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:40:08,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 20:40:08,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:40:08,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:40:08,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:08,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:08,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 20:40:08,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:08,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:40:08,173 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 20:40:08,199 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:40:08,200 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 11 treesize of output 11 [2025-04-13 20:40:08,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:40:08,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 20:40:08,578 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:08,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 20:40:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:08,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:40:08,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320179897] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:08,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 11] total 42 [2025-04-13 20:40:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135278601] [2025-04-13 20:40:08,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:08,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 20:40:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:08,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 20:40:08,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1745, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 20:40:08,945 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:40:08,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 3662 transitions, 129225 flow. Second operand has 44 states, 44 states have (on average 4.75) internal successors, (209), 44 states have internal predecessors, (209), 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:40:08,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:08,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:40:08,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:34,695 INFO L116 PetriNetUnfolderBase]: 17657/25941 cut-off events. [2025-04-13 20:40:34,695 INFO L117 PetriNetUnfolderBase]: For 1402602/1402602 co-relation queries the response was YES. [2025-04-13 20:40:35,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401550 conditions, 25941 events. 17657/25941 cut-off events. For 1402602/1402602 co-relation queries the response was YES. Maximal size of possible extension queue 1658. Compared 170944 event pairs, 1067 based on Foata normal form. 2/25874 useless extension candidates. Maximal degree in co-relation 401294. Up to 20128 conditions per place. [2025-04-13 20:40:35,232 INFO L140 encePairwiseOnDemand]: 18/34 looper letters, 2478 selfloop transitions, 1745 changer transitions 4/4227 dead transitions. [2025-04-13 20:40:35,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 4227 transitions, 149937 flow [2025-04-13 20:40:35,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 20:40:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-04-13 20:40:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 691 transitions. [2025-04-13 20:40:35,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31755514705882354 [2025-04-13 20:40:35,233 INFO L175 Difference]: Start difference. First operand has 710 places, 3662 transitions, 129225 flow. Second operand 64 states and 691 transitions. [2025-04-13 20:40:35,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 773 places, 4227 transitions, 149937 flow [2025-04-13 20:40:58,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 747 places, 4227 transitions, 146540 flow, removed 93 selfloop flow, removed 26 redundant places. [2025-04-13 20:40:58,166 INFO L231 Difference]: Finished difference. Result has 762 places, 3850 transitions, 136540 flow [2025-04-13 20:40:58,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=126022, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1561, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=136540, PETRI_PLACES=762, PETRI_TRANSITIONS=3850} [2025-04-13 20:40:58,168 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 730 predicate places. [2025-04-13 20:40:58,168 INFO L485 AbstractCegarLoop]: Abstraction has has 762 places, 3850 transitions, 136540 flow [2025-04-13 20:40:58,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.75) internal successors, (209), 44 states have internal predecessors, (209), 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:40:58,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:58,169 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:58,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 20:40:58,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 20:40:58,369 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:58,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:58,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1877225611, now seen corresponding path program 10 times [2025-04-13 20:40:58,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:58,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131569758] [2025-04-13 20:40:58,370 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:58,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:58,376 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:40:58,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:40:58,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:40:58,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:40:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:58,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131569758] [2025-04-13 20:40:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131569758] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:58,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914389312] [2025-04-13 20:40:58,763 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:58,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:58,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:58,765 INFO L229 MonitoredProcess]: Starting monitored process 36 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:40:58,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 20:40:58,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:40:58,859 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:40:58,859 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:40:58,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:58,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:40:58,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:59,076 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:59,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 67 [2025-04-13 20:40:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:40:59,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:59,376 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:59,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 304 [2025-04-13 20:41:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:41:02,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914389312] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:02,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:02,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 30 [2025-04-13 20:41:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977159610] [2025-04-13 20:41:02,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:02,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:41:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:02,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:41:02,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:41:02,591 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:41:02,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 3850 transitions, 136540 flow. Second operand has 32 states, 32 states have (on average 5.21875) internal successors, (167), 32 states have internal predecessors, (167), 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:41:02,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:02,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:41:02,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:22,243 INFO L116 PetriNetUnfolderBase]: 17795/26154 cut-off events. [2025-04-13 20:41:22,243 INFO L117 PetriNetUnfolderBase]: For 1458961/1458961 co-relation queries the response was YES. [2025-04-13 20:41:22,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406386 conditions, 26154 events. 17795/26154 cut-off events. For 1458961/1458961 co-relation queries the response was YES. Maximal size of possible extension queue 1578. Compared 171981 event pairs, 884 based on Foata normal form. 2/26081 useless extension candidates. Maximal degree in co-relation 406116. Up to 22526 conditions per place. [2025-04-13 20:41:22,926 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 2815 selfloop transitions, 1200 changer transitions 4/4019 dead transitions. [2025-04-13 20:41:22,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 784 places, 4019 transitions, 147801 flow [2025-04-13 20:41:22,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:41:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:41:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 268 transitions. [2025-04-13 20:41:22,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3284313725490196 [2025-04-13 20:41:22,927 INFO L175 Difference]: Start difference. First operand has 762 places, 3850 transitions, 136540 flow. Second operand 24 states and 268 transitions. [2025-04-13 20:41:22,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 784 places, 4019 transitions, 147801 flow [2025-04-13 20:41:49,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 762 places, 4019 transitions, 143502 flow, removed 1082 selfloop flow, removed 22 redundant places. [2025-04-13 20:41:49,168 INFO L231 Difference]: Finished difference. Result has 770 places, 3896 transitions, 136209 flow [2025-04-13 20:41:49,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=132262, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3849, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=136209, PETRI_PLACES=770, PETRI_TRANSITIONS=3896} [2025-04-13 20:41:49,171 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 738 predicate places. [2025-04-13 20:41:49,171 INFO L485 AbstractCegarLoop]: Abstraction has has 770 places, 3896 transitions, 136209 flow [2025-04-13 20:41:49,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.21875) internal successors, (167), 32 states have internal predecessors, (167), 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:41:49,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:49,171 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:49,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 20:41:49,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:49,372 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:49,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1197610865, now seen corresponding path program 2 times [2025-04-13 20:41:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:49,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255947204] [2025-04-13 20:41:49,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:41:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:49,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:41:49,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:41:49,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:49,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:50,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255947204] [2025-04-13 20:41:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255947204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:50,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862089119] [2025-04-13 20:41:50,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:41:50,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:50,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:50,158 INFO L229 MonitoredProcess]: Starting monitored process 37 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:41:50,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 20:41:50,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:41:50,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:41:50,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:50,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:50,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 20:41:50,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:50,398 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:41:50,941 INFO L325 Elim1Store]: treesize reduction 144, result has 38.2 percent of original size [2025-04-13 20:41:50,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 55 treesize of output 103 [2025-04-13 20:41:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:51,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:51,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862089119] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:51,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:51,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 48 [2025-04-13 20:41:51,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070248659] [2025-04-13 20:41:51,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:51,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-13 20:41:51,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:51,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-13 20:41:51,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2168, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 20:41:51,677 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:41:51,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 3896 transitions, 136209 flow. Second operand has 50 states, 50 states have (on average 4.5) internal successors, (225), 50 states have internal predecessors, (225), 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:41:51,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:51,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:41:51,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:31,156 INFO L116 PetriNetUnfolderBase]: 22209/32658 cut-off events. [2025-04-13 20:42:31,156 INFO L117 PetriNetUnfolderBase]: For 1729211/1729211 co-relation queries the response was YES. [2025-04-13 20:42:33,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495603 conditions, 32658 events. 22209/32658 cut-off events. For 1729211/1729211 co-relation queries the response was YES. Maximal size of possible extension queue 1902. Compared 220769 event pairs, 831 based on Foata normal form. 2/32576 useless extension candidates. Maximal degree in co-relation 495328. Up to 17092 conditions per place. [2025-04-13 20:42:33,424 INFO L140 encePairwiseOnDemand]: 16/34 looper letters, 1641 selfloop transitions, 4552 changer transitions 11/6204 dead transitions. [2025-04-13 20:42:33,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 6204 transitions, 209680 flow [2025-04-13 20:42:33,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2025-04-13 20:42:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2025-04-13 20:42:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 1488 transitions. [2025-04-13 20:42:33,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25896275670031327 [2025-04-13 20:42:33,427 INFO L175 Difference]: Start difference. First operand has 770 places, 3896 transitions, 136209 flow. Second operand 169 states and 1488 transitions. [2025-04-13 20:42:33,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 6204 transitions, 209680 flow [2025-04-13 20:43:07,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 927 places, 6204 transitions, 206656 flow, removed 404 selfloop flow, removed 11 redundant places. [2025-04-13 20:43:07,992 INFO L231 Difference]: Finished difference. Result has 952 places, 5582 transitions, 198705 flow [2025-04-13 20:43:07,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=134209, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2927, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=169, PETRI_FLOW=198705, PETRI_PLACES=952, PETRI_TRANSITIONS=5582} [2025-04-13 20:43:07,994 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 920 predicate places. [2025-04-13 20:43:07,994 INFO L485 AbstractCegarLoop]: Abstraction has has 952 places, 5582 transitions, 198705 flow [2025-04-13 20:43:07,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.5) internal successors, (225), 50 states have internal predecessors, (225), 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:43:07,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:07,995 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:43:08,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 20:43:08,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:08,195 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:08,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:08,197 INFO L85 PathProgramCache]: Analyzing trace with hash 106072795, now seen corresponding path program 3 times [2025-04-13 20:43:08,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:08,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956919395] [2025-04-13 20:43:08,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:08,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:08,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:43:08,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:43:08,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:43:08,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:08,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:08,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956919395] [2025-04-13 20:43:08,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956919395] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:08,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851712352] [2025-04-13 20:43:08,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:08,781 INFO L229 MonitoredProcess]: Starting monitored process 38 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:43:08,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 20:43:08,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:43:08,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:43:08,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:43:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:08,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 20:43:08,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:09,000 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:43:09,472 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 20:43:09,472 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 20:43:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:09,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:09,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851712352] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:09,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:09,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 16] total 47 [2025-04-13 20:43:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447257704] [2025-04-13 20:43:09,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:09,966 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-13 20:43:09,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:09,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-13 20:43:09,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2091, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 20:43:09,967 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:43:09,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 5582 transitions, 198705 flow. Second operand has 49 states, 49 states have (on average 4.571428571428571) internal successors, (224), 49 states have internal predecessors, (224), 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:43:09,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:09,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:43:09,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:55,797 INFO L116 PetriNetUnfolderBase]: 22258/32730 cut-off events. [2025-04-13 20:43:55,797 INFO L117 PetriNetUnfolderBase]: For 1812463/1812463 co-relation queries the response was YES. [2025-04-13 20:43:57,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516497 conditions, 32730 events. 22258/32730 cut-off events. For 1812463/1812463 co-relation queries the response was YES. Maximal size of possible extension queue 1901. Compared 221313 event pairs, 914 based on Foata normal form. 3/32649 useless extension candidates. Maximal degree in co-relation 516196. Up to 19686 conditions per place. [2025-04-13 20:43:57,943 INFO L140 encePairwiseOnDemand]: 16/34 looper letters, 1789 selfloop transitions, 4235 changer transitions 5/6029 dead transitions. [2025-04-13 20:43:57,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1081 places, 6029 transitions, 215661 flow [2025-04-13 20:43:57,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-04-13 20:43:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2025-04-13 20:43:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 1147 transitions. [2025-04-13 20:43:57,945 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2555704099821747 [2025-04-13 20:43:57,945 INFO L175 Difference]: Start difference. First operand has 952 places, 5582 transitions, 198705 flow. Second operand 132 states and 1147 transitions. [2025-04-13 20:43:57,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1081 places, 6029 transitions, 215661 flow [2025-04-13 20:44:47,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1051 places, 6029 transitions, 206912 flow, removed 2676 selfloop flow, removed 30 redundant places. [2025-04-13 20:44:47,575 INFO L231 Difference]: Finished difference. Result has 1057 places, 5612 transitions, 199450 flow [2025-04-13 20:44:47,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=190208, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=132, PETRI_FLOW=199450, PETRI_PLACES=1057, PETRI_TRANSITIONS=5612} [2025-04-13 20:44:47,578 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1025 predicate places. [2025-04-13 20:44:47,578 INFO L485 AbstractCegarLoop]: Abstraction has has 1057 places, 5612 transitions, 199450 flow [2025-04-13 20:44:47,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.571428571428571) internal successors, (224), 49 states have internal predecessors, (224), 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:44:47,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:47,578 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:47,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 20:44:47,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:47,779 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:47,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 552466509, now seen corresponding path program 11 times [2025-04-13 20:44:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:47,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283364469] [2025-04-13 20:44:47,780 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:44:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:47,787 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:44:47,795 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:44:47,796 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:44:47,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:48,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:48,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283364469] [2025-04-13 20:44:48,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283364469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:48,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897309693] [2025-04-13 20:44:48,612 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:44:48,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:48,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:48,614 INFO L229 MonitoredProcess]: Starting monitored process 39 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:44:48,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 20:44:48,691 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:44:48,711 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:44:48,711 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:44:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:48,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 20:44:48,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:49,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:44:49,071 INFO L325 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2025-04-13 20:44:49,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 55 [2025-04-13 20:44:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:44:49,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:49,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:49,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 304 [2025-04-13 20:44:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:44:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897309693] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:53,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:53,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 37 [2025-04-13 20:44:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148151975] [2025-04-13 20:44:53,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:53,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:44:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:53,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:44:53,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1361, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:44:53,635 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-04-13 20:44:53,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1057 places, 5612 transitions, 199450 flow. Second operand has 39 states, 39 states have (on average 4.923076923076923) internal successors, (192), 39 states have internal predecessors, (192), 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:44:53,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:53,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-04-13 20:44:53,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:35,150 INFO L116 PetriNetUnfolderBase]: 22513/33106 cut-off events. [2025-04-13 20:45:35,150 INFO L117 PetriNetUnfolderBase]: For 1768583/1768583 co-relation queries the response was YES. [2025-04-13 20:45:37,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519364 conditions, 33106 events. 22513/33106 cut-off events. For 1768583/1768583 co-relation queries the response was YES. Maximal size of possible extension queue 1902. Compared 224112 event pairs, 881 based on Foata normal form. 2/33021 useless extension candidates. Maximal degree in co-relation 519060. Up to 23312 conditions per place. [2025-04-13 20:45:37,940 INFO L140 encePairwiseOnDemand]: 16/34 looper letters, 3109 selfloop transitions, 2805 changer transitions 6/5920 dead transitions. [2025-04-13 20:45:37,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 5920 transitions, 217703 flow [2025-04-13 20:45:37,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 20:45:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-13 20:45:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 406 transitions. [2025-04-13 20:45:37,941 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2985294117647059 [2025-04-13 20:45:37,941 INFO L175 Difference]: Start difference. First operand has 1057 places, 5612 transitions, 199450 flow. Second operand 40 states and 406 transitions. [2025-04-13 20:45:37,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1096 places, 5920 transitions, 217703 flow Received shutdown request... [2025-04-13 20:45:51,221 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:45:51,224 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:45:51,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:45:51,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 20:45:51,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2025-04-13 20:45:51,426 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-13 20:45:51,430 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:45:51,431 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:45:51,431 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:45:51,431 INFO L422 BasicCegarLoop]: Path program histogram: [37, 11, 7, 3, 2, 1, 1, 1, 1] [2025-04-13 20:45:51,439 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:45:51,439 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:45:51,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:45:51 BasicIcfg [2025-04-13 20:45:51,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:45:51,449 INFO L158 Benchmark]: Toolchain (without parser) took 788866.74ms. Allocated memory was 142.6MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 100.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2025-04-13 20:45:51,449 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:45:51,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.82ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 84.8MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:45:51,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.10ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:45:51,450 INFO L158 Benchmark]: Boogie Preprocessor took 65.06ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 79.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:45:51,450 INFO L158 Benchmark]: RCFGBuilder took 840.08ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 49.3MB in the end (delta: 30.1MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. [2025-04-13 20:45:51,450 INFO L158 Benchmark]: TraceAbstraction took 787697.33ms. Allocated memory was 142.6MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 48.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2025-04-13 20:45:51,451 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.82ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 84.8MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.10ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.06ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 79.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 840.08ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 49.3MB in the end (delta: 30.1MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. * TraceAbstraction took 787697.33ms. Allocated memory was 142.6MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 48.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 55 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 787.6s, OverallIterations: 64, TraceHistogramMax: 2, PathProgramHistogramMax: 37, EmptinessCheckTime: 0.0s, AutomataDifference: 724.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8358 SdHoareTripleChecker+Valid, 32.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8358 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 27.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1812 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64281 IncrementalHoareTripleChecker+Invalid, 66093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1812 mSolverCounterUnsat, 0 mSDtfsCounter, 64281 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3206 GetRequests, 1279 SyntacticMatches, 19 SemanticMatches, 1908 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36849 ImplicationChecksByTransitivity, 42.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199450occurred in iteration=63, InterpolantAutomatonStates: 1203, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 50.3s InterpolantComputationTime, 2464 NumberOfCodeBlocks, 2410 NumberOfCodeBlocksAsserted, 153 NumberOfCheckSat, 3272 ConstructedInterpolants, 100 QuantifiedInterpolants, 51571 SizeOfPredicates, 529 NumberOfNonLiveVariables, 9530 ConjunctsInSsa, 1430 ConjunctsInUnsatCore, 140 InterpolantComputations, 46 PerfectInterpolantSequences, 383/656 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown