/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-queue-add-3-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:43:35,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:43:35,163 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:43:35,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:43:35,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:43:35,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:43:35,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:43:35,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:43:35,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:43:35,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:43:35,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:43:35,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:43:35,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:43:35,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:43:35,189 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:43:35,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:43:35,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:43:35,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:43:35,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:43:35,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:43:35,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:43:35,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:43:35,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:43:35,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:43:35,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:43:35,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:43:35,193 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:43:35,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:43:35,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:43:35,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:43:35,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:43:35,406 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:43:35,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-04-13 20:43:36,624 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3afe6ce9/90c9f1fb129141e7ba4d3c0b0c67a57e/FLAG3b4bcce2c [2025-04-13 20:43:36,816 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:43:36,817 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-04-13 20:43:36,825 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3afe6ce9/90c9f1fb129141e7ba4d3c0b0c67a57e/FLAG3b4bcce2c [2025-04-13 20:43:37,824 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3afe6ce9/90c9f1fb129141e7ba4d3c0b0c67a57e [2025-04-13 20:43:37,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:43:37,827 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:43:37,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:43:37,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:43:37,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:43:37,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:43:37" (1/1) ... [2025-04-13 20:43:37,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c70a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:37, skipping insertion in model container [2025-04-13 20:43:37,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:43:37" (1/1) ... [2025-04-13 20:43:37,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:43:38,008 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-queue-add-3-nl.wvr.c[3654,3667] [2025-04-13 20:43:38,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:43:38,027 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:43:38,052 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-queue-add-3-nl.wvr.c[3654,3667] [2025-04-13 20:43:38,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:43:38,063 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:43:38,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38 WrapperNode [2025-04-13 20:43:38,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:43:38,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:43:38,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:43:38,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:43:38,068 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:43:38" (1/1) ... [2025-04-13 20:43:38,074 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:43:38" (1/1) ... [2025-04-13 20:43:38,098 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-04-13 20:43:38,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:43:38,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:43:38,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:43:38,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:43:38,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,122 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 20:43:38,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:43:38,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:43:38,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:43:38,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:43:38,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (1/1) ... [2025-04-13 20:43:38,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:43:38,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:38,159 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:43:38,160 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:43:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:43:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:43:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:43:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:43:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:43:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:43:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:43:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:43:38,177 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:43:38,261 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:43:38,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:43:38,525 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:43:38,526 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:43:38,526 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:43:38,788 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:43:38,791 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 20:43:38,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:43:38 BoogieIcfgContainer [2025-04-13 20:43:38,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:43:38,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:43:38,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:43:38,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:43:38,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:43:37" (1/3) ... [2025-04-13 20:43:38,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f150008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:43:38, skipping insertion in model container [2025-04-13 20:43:38,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:43:38" (2/3) ... [2025-04-13 20:43:38,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f150008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:43:38, skipping insertion in model container [2025-04-13 20:43:38,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:43:38" (3/3) ... [2025-04-13 20:43:38,798 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-04-13 20:43:38,808 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:43:38,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 30 locations, 34 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 20:43:38,810 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:43:38,854 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:43:38,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 95 flow [2025-04-13 20:43:38,902 INFO L116 PetriNetUnfolderBase]: 8/34 cut-off events. [2025-04-13 20:43:38,903 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:43:38,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 8/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-13 20:43:38,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 95 flow [2025-04-13 20:43:38,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 84 flow [2025-04-13 20:43:38,918 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:43:38,928 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;@3711788a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:43:38,928 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:43:38,941 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:43:38,941 INFO L116 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-04-13 20:43:38,941 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:43:38,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:38,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] [2025-04-13 20:43:38,943 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:43:38,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1140930696, now seen corresponding path program 1 times [2025-04-13 20:43:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:38,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407231954] [2025-04-13 20:43:38,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:39,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:43:39,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:43:39,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:39,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:39,127 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:43:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:39,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407231954] [2025-04-13 20:43:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407231954] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:39,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:43:39,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323578214] [2025-04-13 20:43:39,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:39,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 20:43:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:39,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 20:43:39,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 20:43:39,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:39,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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:39,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:39,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:39,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:39,362 INFO L116 PetriNetUnfolderBase]: 831/1172 cut-off events. [2025-04-13 20:43:39,362 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-13 20:43:39,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1172 events. 831/1172 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3775 event pairs, 595 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 2264. Up to 1173 conditions per place. [2025-04-13 20:43:39,375 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 31 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2025-04-13 20:43:39,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 142 flow [2025-04-13 20:43:39,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 20:43:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 20:43:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-04-13 20:43:39,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2025-04-13 20:43:39,385 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 84 flow. Second operand 2 states and 39 transitions. [2025-04-13 20:43:39,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 142 flow [2025-04-13 20:43:39,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:43:39,393 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 68 flow [2025-04-13 20:43:39,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2025-04-13 20:43:39,398 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-13 20:43:39,399 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 68 flow [2025-04-13 20:43:39,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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:39,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:39,399 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, 1] [2025-04-13 20:43:39,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:43:39,399 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:43:39,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1234248290, now seen corresponding path program 1 times [2025-04-13 20:43:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:39,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675897230] [2025-04-13 20:43:39,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:39,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:43:39,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:43:39,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:39,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:39,658 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:43:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:39,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675897230] [2025-04-13 20:43:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675897230] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:39,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:43:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918473785] [2025-04-13 20:43:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:39,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:43:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:39,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:43:39,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:43:39,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:39,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:39,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:39,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:39,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:39,861 INFO L116 PetriNetUnfolderBase]: 932/1343 cut-off events. [2025-04-13 20:43:39,862 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 20:43:39,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 1343 events. 932/1343 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4601 event pairs, 682 based on Foata normal form. 74/1144 useless extension candidates. Maximal degree in co-relation 2733. Up to 1173 conditions per place. [2025-04-13 20:43:39,869 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 30 selfloop transitions, 2 changer transitions 18/50 dead transitions. [2025-04-13 20:43:39,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 209 flow [2025-04-13 20:43:39,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:43:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:43:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-13 20:43:39,870 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2025-04-13 20:43:39,870 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 68 flow. Second operand 5 states and 68 transitions. [2025-04-13 20:43:39,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 209 flow [2025-04-13 20:43:39,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:43:39,872 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 90 flow [2025-04-13 20:43:39,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-04-13 20:43:39,872 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-04-13 20:43:39,872 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 90 flow [2025-04-13 20:43:39,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:39,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:39,873 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, 1, 1] [2025-04-13 20:43:39,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:43:39,873 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:43:39,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash -161004848, now seen corresponding path program 1 times [2025-04-13 20:43:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:39,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721273953] [2025-04-13 20:43:39,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:39,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:43:39,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:43:39,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:39,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:43:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:40,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721273953] [2025-04-13 20:43:40,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721273953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:40,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:40,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:43:40,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894806282] [2025-04-13 20:43:40,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:40,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:43:40,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:40,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:43:40,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:43:40,036 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:40,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:40,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:40,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:40,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:40,186 INFO L116 PetriNetUnfolderBase]: 1051/1521 cut-off events. [2025-04-13 20:43:40,186 INFO L117 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2025-04-13 20:43:40,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 1521 events. 1051/1521 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5423 event pairs, 775 based on Foata normal form. 77/1321 useless extension candidates. Maximal degree in co-relation 3359. Up to 1174 conditions per place. [2025-04-13 20:43:40,193 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2025-04-13 20:43:40,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 244 flow [2025-04-13 20:43:40,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:43:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:43:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-13 20:43:40,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-04-13 20:43:40,195 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 90 flow. Second operand 4 states and 64 transitions. [2025-04-13 20:43:40,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 244 flow [2025-04-13 20:43:40,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 232 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:43:40,198 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 98 flow [2025-04-13 20:43:40,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-13 20:43:40,199 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-04-13 20:43:40,199 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 98 flow [2025-04-13 20:43:40,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:40,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:40,199 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, 1, 1, 1] [2025-04-13 20:43:40,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:43:40,199 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:43:40,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash 432277403, now seen corresponding path program 1 times [2025-04-13 20:43:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:40,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802451276] [2025-04-13 20:43:40,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:40,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:43:40,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:40,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:40,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:40,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:43:40,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:40,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802451276] [2025-04-13 20:43:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802451276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:40,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:40,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298466622] [2025-04-13 20:43:40,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:40,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:40,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:40,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:40,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:40,927 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:40,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 98 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:40,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:40,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:40,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:41,447 INFO L116 PetriNetUnfolderBase]: 1668/2317 cut-off events. [2025-04-13 20:43:41,447 INFO L117 PetriNetUnfolderBase]: For 418/418 co-relation queries the response was YES. [2025-04-13 20:43:41,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5338 conditions, 2317 events. 1668/2317 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8923 event pairs, 153 based on Foata normal form. 1/1854 useless extension candidates. Maximal degree in co-relation 5330. Up to 1521 conditions per place. [2025-04-13 20:43:41,458 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 85 selfloop transitions, 35 changer transitions 2/122 dead transitions. [2025-04-13 20:43:41,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 122 transitions, 579 flow [2025-04-13 20:43:41,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:43:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:43:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2025-04-13 20:43:41,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4081081081081081 [2025-04-13 20:43:41,461 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 98 flow. Second operand 10 states and 151 transitions. [2025-04-13 20:43:41,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 122 transitions, 579 flow [2025-04-13 20:43:41,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 122 transitions, 575 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:43:41,463 INFO L231 Difference]: Finished difference. Result has 49 places, 66 transitions, 276 flow [2025-04-13 20:43:41,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=49, PETRI_TRANSITIONS=66} [2025-04-13 20:43:41,466 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2025-04-13 20:43:41,466 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 66 transitions, 276 flow [2025-04-13 20:43:41,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:41,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:41,466 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, 1, 1, 1] [2025-04-13 20:43:41,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:43:41,466 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:43:41,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash -506355665, now seen corresponding path program 2 times [2025-04-13 20:43:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:41,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955120380] [2025-04-13 20:43:41,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:41,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:41,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:41,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:41,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:43:41,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:41,519 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:43:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:41,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955120380] [2025-04-13 20:43:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955120380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:41,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:41,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:43:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977071066] [2025-04-13 20:43:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:41,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:43:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:41,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:43:41,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:43:41,520 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:41,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 66 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:41,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:41,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:41,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:41,674 INFO L116 PetriNetUnfolderBase]: 1373/1956 cut-off events. [2025-04-13 20:43:41,675 INFO L117 PetriNetUnfolderBase]: For 867/867 co-relation queries the response was YES. [2025-04-13 20:43:41,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5751 conditions, 1956 events. 1373/1956 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7575 event pairs, 306 based on Foata normal form. 46/1684 useless extension candidates. Maximal degree in co-relation 5739. Up to 1689 conditions per place. [2025-04-13 20:43:41,689 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 82 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-04-13 20:43:41,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 519 flow [2025-04-13 20:43:41,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:43:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:43:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-13 20:43:41,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2025-04-13 20:43:41,693 INFO L175 Difference]: Start difference. First operand has 49 places, 66 transitions, 276 flow. Second operand 3 states and 53 transitions. [2025-04-13 20:43:41,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 519 flow [2025-04-13 20:43:41,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:43:41,698 INFO L231 Difference]: Finished difference. Result has 51 places, 68 transitions, 297 flow [2025-04-13 20:43:41,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=51, PETRI_TRANSITIONS=68} [2025-04-13 20:43:41,699 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2025-04-13 20:43:41,699 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 68 transitions, 297 flow [2025-04-13 20:43:41,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:41,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:41,699 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, 1, 1, 1] [2025-04-13 20:43:41,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:43:41,699 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:43:41,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash -288389487, now seen corresponding path program 3 times [2025-04-13 20:43:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:41,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408220782] [2025-04-13 20:43:41,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:41,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:41,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:41,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:43:41,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:41,745 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:43:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:41,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408220782] [2025-04-13 20:43:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408220782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:41,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:43:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886041332] [2025-04-13 20:43:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:41,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:43:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:41,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:43:41,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:43:41,746 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:41,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 68 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:41,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:41,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:41,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:41,895 INFO L116 PetriNetUnfolderBase]: 1129/1666 cut-off events. [2025-04-13 20:43:41,895 INFO L117 PetriNetUnfolderBase]: For 1270/1270 co-relation queries the response was YES. [2025-04-13 20:43:41,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5222 conditions, 1666 events. 1129/1666 cut-off events. For 1270/1270 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6388 event pairs, 387 based on Foata normal form. 85/1506 useless extension candidates. Maximal degree in co-relation 5208. Up to 1068 conditions per place. [2025-04-13 20:43:41,904 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 83 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-04-13 20:43:41,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 543 flow [2025-04-13 20:43:41,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:43:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:43:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-13 20:43:41,905 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2025-04-13 20:43:41,905 INFO L175 Difference]: Start difference. First operand has 51 places, 68 transitions, 297 flow. Second operand 3 states and 53 transitions. [2025-04-13 20:43:41,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 543 flow [2025-04-13 20:43:41,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 524 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-13 20:43:41,911 INFO L231 Difference]: Finished difference. Result has 52 places, 68 transitions, 294 flow [2025-04-13 20:43:41,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=52, PETRI_TRANSITIONS=68} [2025-04-13 20:43:41,911 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-13 20:43:41,911 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 68 transitions, 294 flow [2025-04-13 20:43:41,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:41,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:41,912 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, 1, 1, 1] [2025-04-13 20:43:41,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:43:41,912 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:43:41,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 199683211, now seen corresponding path program 4 times [2025-04-13 20:43:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:41,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165406220] [2025-04-13 20:43:41,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:43:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:41,920 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:41,949 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:41,949 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:43:41,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:42,384 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:43:42,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:42,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165406220] [2025-04-13 20:43:42,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165406220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:42,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:42,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:42,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963096097] [2025-04-13 20:43:42,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:42,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:42,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:42,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:42,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:42,386 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:42,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 68 transitions, 294 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:42,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:42,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:42,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:42,751 INFO L116 PetriNetUnfolderBase]: 1192/1769 cut-off events. [2025-04-13 20:43:42,751 INFO L117 PetriNetUnfolderBase]: For 1148/1148 co-relation queries the response was YES. [2025-04-13 20:43:42,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 1769 events. 1192/1769 cut-off events. For 1148/1148 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7039 event pairs, 184 based on Foata normal form. 1/1503 useless extension candidates. Maximal degree in co-relation 5455. Up to 1415 conditions per place. [2025-04-13 20:43:42,762 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 85 selfloop transitions, 38 changer transitions 2/125 dead transitions. [2025-04-13 20:43:42,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 125 transitions, 776 flow [2025-04-13 20:43:42,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-04-13 20:43:42,763 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39039039039039036 [2025-04-13 20:43:42,763 INFO L175 Difference]: Start difference. First operand has 52 places, 68 transitions, 294 flow. Second operand 9 states and 130 transitions. [2025-04-13 20:43:42,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 125 transitions, 776 flow [2025-04-13 20:43:42,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 125 transitions, 744 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-13 20:43:42,767 INFO L231 Difference]: Finished difference. Result has 63 places, 85 transitions, 500 flow [2025-04-13 20:43:42,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=500, PETRI_PLACES=63, PETRI_TRANSITIONS=85} [2025-04-13 20:43:42,768 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2025-04-13 20:43:42,768 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 85 transitions, 500 flow [2025-04-13 20:43:42,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:42,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:42,768 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, 1, 1, 1] [2025-04-13 20:43:42,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:43:42,769 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:43:42,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1277511681, now seen corresponding path program 5 times [2025-04-13 20:43:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:42,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500994505] [2025-04-13 20:43:42,769 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:43:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:42,779 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:42,801 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:42,802 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:42,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:43,199 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:43:43,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:43,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500994505] [2025-04-13 20:43:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500994505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:43,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:43,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689407345] [2025-04-13 20:43:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:43,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:43,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:43,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:43,200 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:43,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 85 transitions, 500 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:43,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:43,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:43,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:43,547 INFO L116 PetriNetUnfolderBase]: 1205/1799 cut-off events. [2025-04-13 20:43:43,547 INFO L117 PetriNetUnfolderBase]: For 1559/1559 co-relation queries the response was YES. [2025-04-13 20:43:43,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6051 conditions, 1799 events. 1205/1799 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7310 event pairs, 147 based on Foata normal form. 1/1540 useless extension candidates. Maximal degree in co-relation 6033. Up to 1407 conditions per place. [2025-04-13 20:43:43,557 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 92 selfloop transitions, 42 changer transitions 3/137 dead transitions. [2025-04-13 20:43:43,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 942 flow [2025-04-13 20:43:43,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:43:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:43:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-04-13 20:43:43,558 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3864864864864865 [2025-04-13 20:43:43,558 INFO L175 Difference]: Start difference. First operand has 63 places, 85 transitions, 500 flow. Second operand 10 states and 143 transitions. [2025-04-13 20:43:43,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 942 flow [2025-04-13 20:43:43,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 137 transitions, 926 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 20:43:43,565 INFO L231 Difference]: Finished difference. Result has 73 places, 88 transitions, 599 flow [2025-04-13 20:43:43,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=599, PETRI_PLACES=73, PETRI_TRANSITIONS=88} [2025-04-13 20:43:43,567 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2025-04-13 20:43:43,567 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 88 transitions, 599 flow [2025-04-13 20:43:43,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:43,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:43,567 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, 1, 1, 1] [2025-04-13 20:43:43,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:43:43,567 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:43:43,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash -373580643, now seen corresponding path program 6 times [2025-04-13 20:43:43,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:43,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740435852] [2025-04-13 20:43:43,568 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:43:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:43,580 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:43,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:43,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:43:43,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:44,022 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:43:44,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:44,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740435852] [2025-04-13 20:43:44,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740435852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:44,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:44,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:44,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162514988] [2025-04-13 20:43:44,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:44,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:44,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:44,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:44,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:44,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:44,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 88 transitions, 599 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:44,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:44,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:44,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:44,380 INFO L116 PetriNetUnfolderBase]: 1295/1945 cut-off events. [2025-04-13 20:43:44,380 INFO L117 PetriNetUnfolderBase]: For 2688/2688 co-relation queries the response was YES. [2025-04-13 20:43:44,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6926 conditions, 1945 events. 1295/1945 cut-off events. For 2688/2688 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8104 event pairs, 156 based on Foata normal form. 1/1733 useless extension candidates. Maximal degree in co-relation 6905. Up to 1348 conditions per place. [2025-04-13 20:43:44,392 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 94 selfloop transitions, 55 changer transitions 2/151 dead transitions. [2025-04-13 20:43:44,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 151 transitions, 1140 flow [2025-04-13 20:43:44,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:43:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:43:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2025-04-13 20:43:44,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41081081081081083 [2025-04-13 20:43:44,394 INFO L175 Difference]: Start difference. First operand has 73 places, 88 transitions, 599 flow. Second operand 10 states and 152 transitions. [2025-04-13 20:43:44,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 151 transitions, 1140 flow [2025-04-13 20:43:44,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 151 transitions, 1079 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-04-13 20:43:44,402 INFO L231 Difference]: Finished difference. Result has 79 places, 97 transitions, 759 flow [2025-04-13 20:43:44,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=759, PETRI_PLACES=79, PETRI_TRANSITIONS=97} [2025-04-13 20:43:44,403 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2025-04-13 20:43:44,403 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 97 transitions, 759 flow [2025-04-13 20:43:44,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:44,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:44,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, 1, 1, 1] [2025-04-13 20:43:44,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:43:44,404 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:43:44,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash -448585615, now seen corresponding path program 7 times [2025-04-13 20:43:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:44,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792881998] [2025-04-13 20:43:44,405 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:43:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:44,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:43:44,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:44,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:44,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:44,750 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:43:44,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:44,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792881998] [2025-04-13 20:43:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792881998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:44,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851576427] [2025-04-13 20:43:44,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:44,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:44,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:44,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:44,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:44,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 97 transitions, 759 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:44,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:44,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:44,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:45,052 INFO L116 PetriNetUnfolderBase]: 1313/1982 cut-off events. [2025-04-13 20:43:45,052 INFO L117 PetriNetUnfolderBase]: For 3839/3839 co-relation queries the response was YES. [2025-04-13 20:43:45,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7770 conditions, 1982 events. 1313/1982 cut-off events. For 3839/3839 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8414 event pairs, 246 based on Foata normal form. 1/1783 useless extension candidates. Maximal degree in co-relation 7745. Up to 1715 conditions per place. [2025-04-13 20:43:45,087 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 100 selfloop transitions, 34 changer transitions 3/137 dead transitions. [2025-04-13 20:43:45,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 137 transitions, 1201 flow [2025-04-13 20:43:45,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2025-04-13 20:43:45,089 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35735735735735735 [2025-04-13 20:43:45,089 INFO L175 Difference]: Start difference. First operand has 79 places, 97 transitions, 759 flow. Second operand 9 states and 119 transitions. [2025-04-13 20:43:45,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 137 transitions, 1201 flow [2025-04-13 20:43:45,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 137 transitions, 1108 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-04-13 20:43:45,103 INFO L231 Difference]: Finished difference. Result has 84 places, 103 transitions, 807 flow [2025-04-13 20:43:45,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=807, PETRI_PLACES=84, PETRI_TRANSITIONS=103} [2025-04-13 20:43:45,103 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2025-04-13 20:43:45,103 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 103 transitions, 807 flow [2025-04-13 20:43:45,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:45,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:45,104 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, 1, 1, 1] [2025-04-13 20:43:45,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:43:45,104 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:43:45,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:45,104 INFO L85 PathProgramCache]: Analyzing trace with hash -580263009, now seen corresponding path program 8 times [2025-04-13 20:43:45,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:45,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747199035] [2025-04-13 20:43:45,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:45,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:45,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:45,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:45,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:43:45,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:45,400 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:43:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:45,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747199035] [2025-04-13 20:43:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747199035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:45,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088233218] [2025-04-13 20:43:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:45,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:45,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:45,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:45,401 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:45,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 103 transitions, 807 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:45,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:45,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:45,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:45,729 INFO L116 PetriNetUnfolderBase]: 1422/2142 cut-off events. [2025-04-13 20:43:45,729 INFO L117 PetriNetUnfolderBase]: For 4361/4361 co-relation queries the response was YES. [2025-04-13 20:43:45,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8561 conditions, 2142 events. 1422/2142 cut-off events. For 4361/4361 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9218 event pairs, 261 based on Foata normal form. 1/1910 useless extension candidates. Maximal degree in co-relation 8533. Up to 1784 conditions per place. [2025-04-13 20:43:45,738 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 113 selfloop transitions, 39 changer transitions 2/154 dead transitions. [2025-04-13 20:43:45,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 154 transitions, 1356 flow [2025-04-13 20:43:45,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-04-13 20:43:45,739 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39039039039039036 [2025-04-13 20:43:45,739 INFO L175 Difference]: Start difference. First operand has 84 places, 103 transitions, 807 flow. Second operand 9 states and 130 transitions. [2025-04-13 20:43:45,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 154 transitions, 1356 flow [2025-04-13 20:43:45,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 154 transitions, 1273 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-04-13 20:43:45,752 INFO L231 Difference]: Finished difference. Result has 89 places, 114 transitions, 940 flow [2025-04-13 20:43:45,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=940, PETRI_PLACES=89, PETRI_TRANSITIONS=114} [2025-04-13 20:43:45,753 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2025-04-13 20:43:45,753 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 114 transitions, 940 flow [2025-04-13 20:43:45,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:45,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:45,753 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, 1, 1, 1] [2025-04-13 20:43:45,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:43:45,753 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:43:45,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash -281757189, now seen corresponding path program 9 times [2025-04-13 20:43:45,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:45,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32208592] [2025-04-13 20:43:45,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:45,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:45,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:45,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:45,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:43:45,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:46,010 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:43:46,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:46,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32208592] [2025-04-13 20:43:46,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32208592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:46,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:46,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:46,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848655567] [2025-04-13 20:43:46,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:46,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:46,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:46,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:46,012 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:46,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 114 transitions, 940 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:46,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:46,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:46,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:46,310 INFO L116 PetriNetUnfolderBase]: 1442/2184 cut-off events. [2025-04-13 20:43:46,310 INFO L117 PetriNetUnfolderBase]: For 5482/5482 co-relation queries the response was YES. [2025-04-13 20:43:46,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9215 conditions, 2184 events. 1442/2184 cut-off events. For 5482/5482 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9529 event pairs, 276 based on Foata normal form. 1/1960 useless extension candidates. Maximal degree in co-relation 9185. Up to 1874 conditions per place. [2025-04-13 20:43:46,320 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 116 selfloop transitions, 38 changer transitions 2/156 dead transitions. [2025-04-13 20:43:46,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 156 transitions, 1435 flow [2025-04-13 20:43:46,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2025-04-13 20:43:46,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-13 20:43:46,321 INFO L175 Difference]: Start difference. First operand has 89 places, 114 transitions, 940 flow. Second operand 9 states and 126 transitions. [2025-04-13 20:43:46,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 156 transitions, 1435 flow [2025-04-13 20:43:46,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 156 transitions, 1309 flow, removed 47 selfloop flow, removed 4 redundant places. [2025-04-13 20:43:46,337 INFO L231 Difference]: Finished difference. Result has 95 places, 119 transitions, 973 flow [2025-04-13 20:43:46,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=973, PETRI_PLACES=95, PETRI_TRANSITIONS=119} [2025-04-13 20:43:46,338 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2025-04-13 20:43:46,338 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 119 transitions, 973 flow [2025-04-13 20:43:46,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:46,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:46,339 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, 1, 1, 1] [2025-04-13 20:43:46,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:43:46,339 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:43:46,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -282351835, now seen corresponding path program 10 times [2025-04-13 20:43:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:46,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421422261] [2025-04-13 20:43:46,339 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:43:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:46,347 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:46,358 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:46,358 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:43:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:46,609 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:43:46,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:46,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421422261] [2025-04-13 20:43:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421422261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515201612] [2025-04-13 20:43:46,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:46,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:46,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:46,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:46,610 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:46,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 119 transitions, 973 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:46,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:46,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:46,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:46,948 INFO L116 PetriNetUnfolderBase]: 1462/2226 cut-off events. [2025-04-13 20:43:46,949 INFO L117 PetriNetUnfolderBase]: For 5958/5958 co-relation queries the response was YES. [2025-04-13 20:43:46,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9509 conditions, 2226 events. 1462/2226 cut-off events. For 5958/5958 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9833 event pairs, 306 based on Foata normal form. 1/1997 useless extension candidates. Maximal degree in co-relation 9476. Up to 1949 conditions per place. [2025-04-13 20:43:46,961 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 120 selfloop transitions, 35 changer transitions 3/158 dead transitions. [2025-04-13 20:43:46,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 158 transitions, 1470 flow [2025-04-13 20:43:46,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2025-04-13 20:43:46,963 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3633633633633634 [2025-04-13 20:43:46,963 INFO L175 Difference]: Start difference. First operand has 95 places, 119 transitions, 973 flow. Second operand 9 states and 121 transitions. [2025-04-13 20:43:46,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 158 transitions, 1470 flow [2025-04-13 20:43:46,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 158 transitions, 1373 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-04-13 20:43:46,988 INFO L231 Difference]: Finished difference. Result has 100 places, 123 transitions, 1034 flow [2025-04-13 20:43:46,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1034, PETRI_PLACES=100, PETRI_TRANSITIONS=123} [2025-04-13 20:43:46,989 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2025-04-13 20:43:46,989 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 123 transitions, 1034 flow [2025-04-13 20:43:46,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:46,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:46,989 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, 1, 1, 1] [2025-04-13 20:43:46,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:43:46,989 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:43:46,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1563203851, now seen corresponding path program 11 times [2025-04-13 20:43:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:46,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26096493] [2025-04-13 20:43:46,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:43:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:46,997 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:47,012 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:47,012 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:47,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:47,318 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:43:47,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:47,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26096493] [2025-04-13 20:43:47,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26096493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:47,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:47,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:47,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497269375] [2025-04-13 20:43:47,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:47,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:47,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:47,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:47,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:47,319 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:47,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 123 transitions, 1034 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:47,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:47,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:47,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:47,729 INFO L116 PetriNetUnfolderBase]: 1691/2567 cut-off events. [2025-04-13 20:43:47,729 INFO L117 PetriNetUnfolderBase]: For 9568/9568 co-relation queries the response was YES. [2025-04-13 20:43:47,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11526 conditions, 2567 events. 1691/2567 cut-off events. For 9568/9568 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11777 event pairs, 297 based on Foata normal form. 1/2301 useless extension candidates. Maximal degree in co-relation 11490. Up to 1983 conditions per place. [2025-04-13 20:43:47,742 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 135 selfloop transitions, 53 changer transitions 2/190 dead transitions. [2025-04-13 20:43:47,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 190 transitions, 1813 flow [2025-04-13 20:43:47,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:43:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:43:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-04-13 20:43:47,744 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4027027027027027 [2025-04-13 20:43:47,744 INFO L175 Difference]: Start difference. First operand has 100 places, 123 transitions, 1034 flow. Second operand 10 states and 149 transitions. [2025-04-13 20:43:47,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 190 transitions, 1813 flow [2025-04-13 20:43:47,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 190 transitions, 1705 flow, removed 35 selfloop flow, removed 6 redundant places. [2025-04-13 20:43:47,779 INFO L231 Difference]: Finished difference. Result has 106 places, 139 transitions, 1310 flow [2025-04-13 20:43:47,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1310, PETRI_PLACES=106, PETRI_TRANSITIONS=139} [2025-04-13 20:43:47,779 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 71 predicate places. [2025-04-13 20:43:47,779 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 139 transitions, 1310 flow [2025-04-13 20:43:47,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:47,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:47,779 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, 1, 1, 1] [2025-04-13 20:43:47,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:43:47,780 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:43:47,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1557894301, now seen corresponding path program 12 times [2025-04-13 20:43:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:47,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145116484] [2025-04-13 20:43:47,780 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:43:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:47,786 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:47,794 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:47,794 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:43:47,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:48,009 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:43:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:48,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145116484] [2025-04-13 20:43:48,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145116484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:48,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:48,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:48,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110041787] [2025-04-13 20:43:48,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:48,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:48,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:48,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:48,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:48,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:48,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 139 transitions, 1310 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:48,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:48,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:48,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:48,404 INFO L116 PetriNetUnfolderBase]: 1759/2673 cut-off events. [2025-04-13 20:43:48,405 INFO L117 PetriNetUnfolderBase]: For 13476/13476 co-relation queries the response was YES. [2025-04-13 20:43:48,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13041 conditions, 2673 events. 1759/2673 cut-off events. For 13476/13476 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12215 event pairs, 396 based on Foata normal form. 1/2407 useless extension candidates. Maximal degree in co-relation 13002. Up to 2231 conditions per place. [2025-04-13 20:43:48,420 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 137 selfloop transitions, 54 changer transitions 2/193 dead transitions. [2025-04-13 20:43:48,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 193 transitions, 2026 flow [2025-04-13 20:43:48,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:43:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:43:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-04-13 20:43:48,421 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3810810810810811 [2025-04-13 20:43:48,422 INFO L175 Difference]: Start difference. First operand has 106 places, 139 transitions, 1310 flow. Second operand 10 states and 141 transitions. [2025-04-13 20:43:48,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 193 transitions, 2026 flow [2025-04-13 20:43:48,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 193 transitions, 1764 flow, removed 115 selfloop flow, removed 4 redundant places. [2025-04-13 20:43:48,475 INFO L231 Difference]: Finished difference. Result has 114 places, 150 transitions, 1386 flow [2025-04-13 20:43:48,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1386, PETRI_PLACES=114, PETRI_TRANSITIONS=150} [2025-04-13 20:43:48,476 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 79 predicate places. [2025-04-13 20:43:48,476 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 150 transitions, 1386 flow [2025-04-13 20:43:48,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:48,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:48,477 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, 1, 1, 1] [2025-04-13 20:43:48,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:43:48,477 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:43:48,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1039353523, now seen corresponding path program 13 times [2025-04-13 20:43:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:48,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666905381] [2025-04-13 20:43:48,477 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:43:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:48,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:43:48,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:48,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:48,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:48,760 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:43:48,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:48,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666905381] [2025-04-13 20:43:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666905381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:48,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319216743] [2025-04-13 20:43:48,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:48,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:48,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:48,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:48,761 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:48,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 150 transitions, 1386 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:48,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:48,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:48,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:49,167 INFO L116 PetriNetUnfolderBase]: 1822/2776 cut-off events. [2025-04-13 20:43:49,168 INFO L117 PetriNetUnfolderBase]: For 11465/11465 co-relation queries the response was YES. [2025-04-13 20:43:49,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13084 conditions, 2776 events. 1822/2776 cut-off events. For 11465/11465 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12887 event pairs, 386 based on Foata normal form. 1/2467 useless extension candidates. Maximal degree in co-relation 13041. Up to 2238 conditions per place. [2025-04-13 20:43:49,185 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 144 selfloop transitions, 56 changer transitions 2/202 dead transitions. [2025-04-13 20:43:49,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 202 transitions, 2008 flow [2025-04-13 20:43:49,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:43:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:43:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2025-04-13 20:43:49,186 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2025-04-13 20:43:49,186 INFO L175 Difference]: Start difference. First operand has 114 places, 150 transitions, 1386 flow. Second operand 10 states and 145 transitions. [2025-04-13 20:43:49,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 202 transitions, 2008 flow [2025-04-13 20:43:49,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 202 transitions, 1840 flow, removed 56 selfloop flow, removed 6 redundant places. [2025-04-13 20:43:49,227 INFO L231 Difference]: Finished difference. Result has 119 places, 156 transitions, 1434 flow [2025-04-13 20:43:49,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1434, PETRI_PLACES=119, PETRI_TRANSITIONS=156} [2025-04-13 20:43:49,228 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 84 predicate places. [2025-04-13 20:43:49,228 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 156 transitions, 1434 flow [2025-04-13 20:43:49,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:49,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:49,228 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, 1, 1, 1] [2025-04-13 20:43:49,228 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:43:49,228 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:43:49,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1982625465, now seen corresponding path program 14 times [2025-04-13 20:43:49,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:49,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761983426] [2025-04-13 20:43:49,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:49,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:49,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:49,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:43:49,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:49,494 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:43:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:49,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761983426] [2025-04-13 20:43:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761983426] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670236585] [2025-04-13 20:43:49,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:49,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:49,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:49,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:49,495 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:49,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 156 transitions, 1434 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:49,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:49,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:49,839 INFO L116 PetriNetUnfolderBase]: 1840/2813 cut-off events. [2025-04-13 20:43:49,839 INFO L117 PetriNetUnfolderBase]: For 11260/11260 co-relation queries the response was YES. [2025-04-13 20:43:49,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13533 conditions, 2813 events. 1840/2813 cut-off events. For 11260/11260 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13147 event pairs, 495 based on Foata normal form. 1/2512 useless extension candidates. Maximal degree in co-relation 13488. Up to 2546 conditions per place. [2025-04-13 20:43:49,855 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 157 selfloop transitions, 34 changer transitions 3/194 dead transitions. [2025-04-13 20:43:49,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 194 transitions, 2066 flow [2025-04-13 20:43:49,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-04-13 20:43:49,857 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35435435435435436 [2025-04-13 20:43:49,857 INFO L175 Difference]: Start difference. First operand has 119 places, 156 transitions, 1434 flow. Second operand 9 states and 118 transitions. [2025-04-13 20:43:49,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 194 transitions, 2066 flow [2025-04-13 20:43:49,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 194 transitions, 1931 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-04-13 20:43:49,906 INFO L231 Difference]: Finished difference. Result has 121 places, 162 transitions, 1508 flow [2025-04-13 20:43:49,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1508, PETRI_PLACES=121, PETRI_TRANSITIONS=162} [2025-04-13 20:43:49,907 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 86 predicate places. [2025-04-13 20:43:49,907 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 162 transitions, 1508 flow [2025-04-13 20:43:49,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:49,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:49,907 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, 1, 1, 1] [2025-04-13 20:43:49,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:43:49,907 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:43:49,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2145513405, now seen corresponding path program 15 times [2025-04-13 20:43:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:49,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018697284] [2025-04-13 20:43:49,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:49,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:49,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:49,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:43:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:50,157 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:43:50,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:50,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018697284] [2025-04-13 20:43:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018697284] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:50,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139052253] [2025-04-13 20:43:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:50,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:50,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:50,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:50,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:50,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 162 transitions, 1508 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:50,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:50,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:50,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:50,535 INFO L116 PetriNetUnfolderBase]: 1858/2848 cut-off events. [2025-04-13 20:43:50,535 INFO L117 PetriNetUnfolderBase]: For 12245/12245 co-relation queries the response was YES. [2025-04-13 20:43:50,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13706 conditions, 2848 events. 1858/2848 cut-off events. For 12245/12245 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13518 event pairs, 438 based on Foata normal form. 1/2546 useless extension candidates. Maximal degree in co-relation 13660. Up to 2538 conditions per place. [2025-04-13 20:43:50,552 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 165 selfloop transitions, 38 changer transitions 2/205 dead transitions. [2025-04-13 20:43:50,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 205 transitions, 2165 flow [2025-04-13 20:43:50,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-04-13 20:43:50,553 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37537537537537535 [2025-04-13 20:43:50,553 INFO L175 Difference]: Start difference. First operand has 121 places, 162 transitions, 1508 flow. Second operand 9 states and 125 transitions. [2025-04-13 20:43:50,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 205 transitions, 2165 flow [2025-04-13 20:43:50,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 205 transitions, 2014 flow, removed 58 selfloop flow, removed 5 redundant places. [2025-04-13 20:43:50,584 INFO L231 Difference]: Finished difference. Result has 127 places, 170 transitions, 1597 flow [2025-04-13 20:43:50,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1597, PETRI_PLACES=127, PETRI_TRANSITIONS=170} [2025-04-13 20:43:50,585 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 92 predicate places. [2025-04-13 20:43:50,585 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 170 transitions, 1597 flow [2025-04-13 20:43:50,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:50,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:50,585 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, 1, 1, 1] [2025-04-13 20:43:50,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:43:50,585 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:43:50,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:50,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2146108051, now seen corresponding path program 16 times [2025-04-13 20:43:50,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:50,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865313275] [2025-04-13 20:43:50,586 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:43:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:50,593 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:50,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:50,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:43:50,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:50,842 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:43:50,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:50,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865313275] [2025-04-13 20:43:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865313275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:50,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:50,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60622635] [2025-04-13 20:43:50,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:50,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:50,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:50,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:50,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:50,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:50,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 170 transitions, 1597 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:50,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:50,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:50,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:51,231 INFO L116 PetriNetUnfolderBase]: 1878/2890 cut-off events. [2025-04-13 20:43:51,232 INFO L117 PetriNetUnfolderBase]: For 14168/14168 co-relation queries the response was YES. [2025-04-13 20:43:51,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14287 conditions, 2890 events. 1878/2890 cut-off events. For 14168/14168 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13814 event pairs, 462 based on Foata normal form. 1/2591 useless extension candidates. Maximal degree in co-relation 14238. Up to 2613 conditions per place. [2025-04-13 20:43:51,249 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 169 selfloop transitions, 35 changer transitions 3/207 dead transitions. [2025-04-13 20:43:51,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 207 transitions, 2234 flow [2025-04-13 20:43:51,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2025-04-13 20:43:51,252 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36036036036036034 [2025-04-13 20:43:51,252 INFO L175 Difference]: Start difference. First operand has 127 places, 170 transitions, 1597 flow. Second operand 9 states and 120 transitions. [2025-04-13 20:43:51,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 207 transitions, 2234 flow [2025-04-13 20:43:51,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 207 transitions, 2098 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-04-13 20:43:51,292 INFO L231 Difference]: Finished difference. Result has 133 places, 174 transitions, 1665 flow [2025-04-13 20:43:51,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1665, PETRI_PLACES=133, PETRI_TRANSITIONS=174} [2025-04-13 20:43:51,293 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 98 predicate places. [2025-04-13 20:43:51,293 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 174 transitions, 1665 flow [2025-04-13 20:43:51,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:51,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:51,293 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, 1, 1, 1] [2025-04-13 20:43:51,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:43:51,293 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:43:51,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1170171853, now seen corresponding path program 17 times [2025-04-13 20:43:51,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:51,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680044234] [2025-04-13 20:43:51,294 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:43:51,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:51,301 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:51,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:51,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:51,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:51,578 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:43:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:51,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680044234] [2025-04-13 20:43:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680044234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:51,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:51,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794068049] [2025-04-13 20:43:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:51,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:51,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:51,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:51,579 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:51,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 174 transitions, 1665 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:51,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:51,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:51,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:51,988 INFO L116 PetriNetUnfolderBase]: 1889/2911 cut-off events. [2025-04-13 20:43:51,988 INFO L117 PetriNetUnfolderBase]: For 15908/15908 co-relation queries the response was YES. [2025-04-13 20:43:51,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14670 conditions, 2911 events. 1889/2911 cut-off events. For 15908/15908 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13986 event pairs, 452 based on Foata normal form. 1/2609 useless extension candidates. Maximal degree in co-relation 14618. Up to 2614 conditions per place. [2025-04-13 20:43:52,006 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 176 selfloop transitions, 35 changer transitions 3/214 dead transitions. [2025-04-13 20:43:52,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 214 transitions, 2320 flow [2025-04-13 20:43:52,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2025-04-13 20:43:52,008 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37237237237237236 [2025-04-13 20:43:52,008 INFO L175 Difference]: Start difference. First operand has 133 places, 174 transitions, 1665 flow. Second operand 9 states and 124 transitions. [2025-04-13 20:43:52,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 214 transitions, 2320 flow [2025-04-13 20:43:52,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 214 transitions, 2166 flow, removed 58 selfloop flow, removed 6 redundant places. [2025-04-13 20:43:52,058 INFO L231 Difference]: Finished difference. Result has 137 places, 177 transitions, 1680 flow [2025-04-13 20:43:52,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1680, PETRI_PLACES=137, PETRI_TRANSITIONS=177} [2025-04-13 20:43:52,058 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 102 predicate places. [2025-04-13 20:43:52,058 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 177 transitions, 1680 flow [2025-04-13 20:43:52,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:52,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:52,059 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, 1, 1, 1] [2025-04-13 20:43:52,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:43:52,059 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:43:52,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1851178711, now seen corresponding path program 18 times [2025-04-13 20:43:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:52,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583857097] [2025-04-13 20:43:52,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:43:52,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:52,066 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:52,079 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 20:43:52,079 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:43:52,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:52,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:43:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:52,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583857097] [2025-04-13 20:43:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583857097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:52,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:52,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:43:52,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594368887] [2025-04-13 20:43:52,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:52,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:43:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:52,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:43:52,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:43:52,368 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:52,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 177 transitions, 1680 flow. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:52,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:52,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:52,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:52,790 INFO L116 PetriNetUnfolderBase]: 1895/2926 cut-off events. [2025-04-13 20:43:52,790 INFO L117 PetriNetUnfolderBase]: For 17268/17268 co-relation queries the response was YES. [2025-04-13 20:43:52,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14925 conditions, 2926 events. 1895/2926 cut-off events. For 17268/17268 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14041 event pairs, 466 based on Foata normal form. 1/2622 useless extension candidates. Maximal degree in co-relation 14871. Up to 2568 conditions per place. [2025-04-13 20:43:52,807 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 178 selfloop transitions, 39 changer transitions 2/219 dead transitions. [2025-04-13 20:43:52,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 219 transitions, 2321 flow [2025-04-13 20:43:52,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2025-04-13 20:43:52,808 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2025-04-13 20:43:52,808 INFO L175 Difference]: Start difference. First operand has 137 places, 177 transitions, 1680 flow. Second operand 9 states and 129 transitions. [2025-04-13 20:43:52,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 219 transitions, 2321 flow [2025-04-13 20:43:52,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 219 transitions, 2202 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-04-13 20:43:52,869 INFO L231 Difference]: Finished difference. Result has 142 places, 181 transitions, 1739 flow [2025-04-13 20:43:52,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1739, PETRI_PLACES=142, PETRI_TRANSITIONS=181} [2025-04-13 20:43:52,869 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 107 predicate places. [2025-04-13 20:43:52,869 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 181 transitions, 1739 flow [2025-04-13 20:43:52,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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:43:52,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:52,869 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, 1, 1, 1] [2025-04-13 20:43:52,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:43:52,870 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:43:52,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -225947973, now seen corresponding path program 1 times [2025-04-13 20:43:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:52,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323889627] [2025-04-13 20:43:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:52,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:43:52,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:43:52,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:52,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:43:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:52,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323889627] [2025-04-13 20:43:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323889627] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:52,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:52,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:43:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108154643] [2025-04-13 20:43:52,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:52,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:43:52,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:52,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:43:52,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:43:52,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:52,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 181 transitions, 1739 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:52,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:52,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:52,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:53,257 INFO L116 PetriNetUnfolderBase]: 2862/4315 cut-off events. [2025-04-13 20:43:53,257 INFO L117 PetriNetUnfolderBase]: For 45120/45120 co-relation queries the response was YES. [2025-04-13 20:43:53,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23693 conditions, 4315 events. 2862/4315 cut-off events. For 45120/45120 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21544 event pairs, 710 based on Foata normal form. 45/3851 useless extension candidates. Maximal degree in co-relation 23636. Up to 1703 conditions per place. [2025-04-13 20:43:53,287 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 329 selfloop transitions, 5 changer transitions 10/344 dead transitions. [2025-04-13 20:43:53,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 344 transitions, 4045 flow [2025-04-13 20:43:53,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:43:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:43:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-13 20:43:53,288 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-04-13 20:43:53,288 INFO L175 Difference]: Start difference. First operand has 142 places, 181 transitions, 1739 flow. Second operand 4 states and 83 transitions. [2025-04-13 20:43:53,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 344 transitions, 4045 flow [2025-04-13 20:43:53,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 344 transitions, 3765 flow, removed 80 selfloop flow, removed 6 redundant places. [2025-04-13 20:43:53,393 INFO L231 Difference]: Finished difference. Result has 141 places, 178 transitions, 1538 flow [2025-04-13 20:43:53,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1538, PETRI_PLACES=141, PETRI_TRANSITIONS=178} [2025-04-13 20:43:53,393 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 106 predicate places. [2025-04-13 20:43:53,393 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 178 transitions, 1538 flow [2025-04-13 20:43:53,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:53,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:53,393 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, 1, 1, 1, 1, 1] [2025-04-13 20:43:53,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 20:43:53,393 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:43:53,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2031882093, now seen corresponding path program 1 times [2025-04-13 20:43:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:53,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356821527] [2025-04-13 20:43:53,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:53,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:43:53,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:43:53,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:53,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:53,448 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:43:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:53,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356821527] [2025-04-13 20:43:53,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356821527] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:53,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017156360] [2025-04-13 20:43:53,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:53,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:53,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:53,450 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:43:53,452 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:43:53,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:43:53,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:43:53,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:53,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:53,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:43:53,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:53,600 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:43:53,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:53,664 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:43:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017156360] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:53,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:43:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086763710] [2025-04-13 20:43:53,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:53,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:43:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:53,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:43:53,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:43:53,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:53,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 178 transitions, 1538 flow. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:53,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:53,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:53,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:54,349 INFO L116 PetriNetUnfolderBase]: 5016/7534 cut-off events. [2025-04-13 20:43:54,349 INFO L117 PetriNetUnfolderBase]: For 83150/83150 co-relation queries the response was YES. [2025-04-13 20:43:54,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43244 conditions, 7534 events. 5016/7534 cut-off events. For 83150/83150 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 40807 event pairs, 2057 based on Foata normal form. 248/6834 useless extension candidates. Maximal degree in co-relation 43185. Up to 4048 conditions per place. [2025-04-13 20:43:54,388 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 339 selfloop transitions, 6 changer transitions 15/360 dead transitions. [2025-04-13 20:43:54,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 360 transitions, 3792 flow [2025-04-13 20:43:54,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:43:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:43:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2025-04-13 20:43:54,390 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3552123552123552 [2025-04-13 20:43:54,390 INFO L175 Difference]: Start difference. First operand has 141 places, 178 transitions, 1538 flow. Second operand 7 states and 92 transitions. [2025-04-13 20:43:54,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 360 transitions, 3792 flow [2025-04-13 20:43:54,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 360 transitions, 3710 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-04-13 20:43:54,663 INFO L231 Difference]: Finished difference. Result has 145 places, 182 transitions, 1553 flow [2025-04-13 20:43:54,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1553, PETRI_PLACES=145, PETRI_TRANSITIONS=182} [2025-04-13 20:43:54,664 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 110 predicate places. [2025-04-13 20:43:54,664 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 182 transitions, 1553 flow [2025-04-13 20:43:54,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:54,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:54,664 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, 1, 1, 1, 1] [2025-04-13 20:43:54,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:43:54,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 20:43:54,868 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:43:54,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1067321135, now seen corresponding path program 2 times [2025-04-13 20:43:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:54,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568645442] [2025-04-13 20:43:54,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:54,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:54,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:43:54,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-04-13 20:43:54,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:43:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:43:54,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:54,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568645442] [2025-04-13 20:43:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568645442] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:54,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:43:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849554011] [2025-04-13 20:43:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:54,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:43:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:54,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:43:54,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:43:54,956 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:54,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 182 transitions, 1553 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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:43:54,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:54,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:54,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:55,536 INFO L116 PetriNetUnfolderBase]: 4301/6465 cut-off events. [2025-04-13 20:43:55,536 INFO L117 PetriNetUnfolderBase]: For 71409/71409 co-relation queries the response was YES. [2025-04-13 20:43:55,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35725 conditions, 6465 events. 4301/6465 cut-off events. For 71409/71409 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 34257 event pairs, 569 based on Foata normal form. 65/5689 useless extension candidates. Maximal degree in co-relation 35667. Up to 4162 conditions per place. [2025-04-13 20:43:55,575 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 201 selfloop transitions, 55 changer transitions 0/256 dead transitions. [2025-04-13 20:43:55,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 256 transitions, 2618 flow [2025-04-13 20:43:55,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:43:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:43:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-04-13 20:43:55,576 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4009009009009009 [2025-04-13 20:43:55,576 INFO L175 Difference]: Start difference. First operand has 145 places, 182 transitions, 1553 flow. Second operand 6 states and 89 transitions. [2025-04-13 20:43:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 256 transitions, 2618 flow [2025-04-13 20:43:55,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 256 transitions, 2595 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-13 20:43:55,746 INFO L231 Difference]: Finished difference. Result has 149 places, 183 transitions, 1754 flow [2025-04-13 20:43:55,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1754, PETRI_PLACES=149, PETRI_TRANSITIONS=183} [2025-04-13 20:43:55,746 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2025-04-13 20:43:55,746 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 183 transitions, 1754 flow [2025-04-13 20:43:55,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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:43:55,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:55,746 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, 1, 1] [2025-04-13 20:43:55,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:43:55,747 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:43:55,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1864750223, now seen corresponding path program 1 times [2025-04-13 20:43:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:55,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167056249] [2025-04-13 20:43:55,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:55,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:43:55,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:43:55,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:55,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:55,821 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:43:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:55,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167056249] [2025-04-13 20:43:55,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167056249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:55,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856997340] [2025-04-13 20:43:55,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:55,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:55,823 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:43:55,825 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:43:55,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:43:55,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:43:55,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:55,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:55,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:43:55,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:55,978 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:43:55,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:56,068 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:43:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856997340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:56,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-13 20:43:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818136343] [2025-04-13 20:43:56,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:56,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:43:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:56,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:43:56,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:43:56,069 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:56,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 183 transitions, 1754 flow. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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:56,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:56,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:56,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:56,698 INFO L116 PetriNetUnfolderBase]: 3083/4716 cut-off events. [2025-04-13 20:43:56,698 INFO L117 PetriNetUnfolderBase]: For 57026/57026 co-relation queries the response was YES. [2025-04-13 20:43:56,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27809 conditions, 4716 events. 3083/4716 cut-off events. For 57026/57026 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 23883 event pairs, 839 based on Foata normal form. 131/4483 useless extension candidates. Maximal degree in co-relation 27751. Up to 4012 conditions per place. [2025-04-13 20:43:56,734 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 183 selfloop transitions, 5 changer transitions 99/287 dead transitions. [2025-04-13 20:43:56,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 287 transitions, 3250 flow [2025-04-13 20:43:56,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:43:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:43:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2025-04-13 20:43:56,735 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3213213213213213 [2025-04-13 20:43:56,735 INFO L175 Difference]: Start difference. First operand has 149 places, 183 transitions, 1754 flow. Second operand 9 states and 107 transitions. [2025-04-13 20:43:56,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 287 transitions, 3250 flow [2025-04-13 20:43:56,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 287 transitions, 3243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:43:56,879 INFO L231 Difference]: Finished difference. Result has 157 places, 180 transitions, 1731 flow [2025-04-13 20:43:56,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1731, PETRI_PLACES=157, PETRI_TRANSITIONS=180} [2025-04-13 20:43:56,879 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 122 predicate places. [2025-04-13 20:43:56,879 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 180 transitions, 1731 flow [2025-04-13 20:43:56,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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:56,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:56,880 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, 1] [2025-04-13 20:43:56,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:43:57,081 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,SelfDestructingSolverStorable24 [2025-04-13 20:43:57,081 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:43:57,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash 418832029, now seen corresponding path program 2 times [2025-04-13 20:43:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:57,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238710821] [2025-04-13 20:43:57,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:57,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 20:43:57,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:43:57,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:57,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:57,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:57,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238710821] [2025-04-13 20:43:57,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238710821] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:57,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979612096] [2025-04-13 20:43:57,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:57,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:57,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:57,154 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:43:57,155 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:43:57,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 20:43:57,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 20:43:57,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:57,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:57,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:43:57,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:43:57,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:43:57,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979612096] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:57,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:43:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-04-13 20:43:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560903401] [2025-04-13 20:43:57,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:57,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:43:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:57,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:43:57,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:43:57,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:57,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 180 transitions, 1731 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:57,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:57,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:57,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:57,814 INFO L116 PetriNetUnfolderBase]: 4598/6851 cut-off events. [2025-04-13 20:43:57,814 INFO L117 PetriNetUnfolderBase]: For 152098/152098 co-relation queries the response was YES. [2025-04-13 20:43:57,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45265 conditions, 6851 events. 4598/6851 cut-off events. For 152098/152098 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 35184 event pairs, 1407 based on Foata normal form. 258/6294 useless extension candidates. Maximal degree in co-relation 45204. Up to 2528 conditions per place. [2025-04-13 20:43:57,859 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 102 selfloop transitions, 8 changer transitions 68/178 dead transitions. [2025-04-13 20:43:57,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 178 transitions, 2192 flow [2025-04-13 20:43:57,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:43:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:43:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-13 20:43:57,860 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2025-04-13 20:43:57,860 INFO L175 Difference]: Start difference. First operand has 157 places, 180 transitions, 1731 flow. Second operand 4 states and 89 transitions. [2025-04-13 20:43:57,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 178 transitions, 2192 flow [2025-04-13 20:43:58,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 178 transitions, 2081 flow, removed 30 selfloop flow, removed 15 redundant places. [2025-04-13 20:43:58,207 INFO L231 Difference]: Finished difference. Result has 140 places, 55 transitions, 545 flow [2025-04-13 20:43:58,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=545, PETRI_PLACES=140, PETRI_TRANSITIONS=55} [2025-04-13 20:43:58,207 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2025-04-13 20:43:58,207 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 55 transitions, 545 flow [2025-04-13 20:43:58,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:58,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:58,208 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, 1, 1, 1] [2025-04-13 20:43:58,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:43:58,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:58,408 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:43:58,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1994585567, now seen corresponding path program 1 times [2025-04-13 20:43:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:58,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490754069] [2025-04-13 20:43:58,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:58,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:43:58,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:43:58,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:58,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:58,473 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:43:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:58,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490754069] [2025-04-13 20:43:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490754069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:58,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173544616] [2025-04-13 20:43:58,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:43:58,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:58,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:58,475 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:43:58,477 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:43:58,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:43:58,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:43:58,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:43:58,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:58,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:43:58,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:58,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:58,664 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:43:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173544616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:58,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:43:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764490712] [2025-04-13 20:43:58,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:58,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:43:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:58,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:43:58,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:43:58,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:58,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 55 transitions, 545 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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:58,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:58,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:58,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:59,267 INFO L116 PetriNetUnfolderBase]: 5729/8487 cut-off events. [2025-04-13 20:43:59,267 INFO L117 PetriNetUnfolderBase]: For 134499/134499 co-relation queries the response was YES. [2025-04-13 20:43:59,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54101 conditions, 8487 events. 5729/8487 cut-off events. For 134499/134499 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 42887 event pairs, 3719 based on Foata normal form. 195/7636 useless extension candidates. Maximal degree in co-relation 54049. Up to 6332 conditions per place. [2025-04-13 20:43:59,318 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 53 selfloop transitions, 3 changer transitions 58/114 dead transitions. [2025-04-13 20:43:59,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 114 transitions, 1347 flow [2025-04-13 20:43:59,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:43:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:43:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-04-13 20:43:59,319 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-13 20:43:59,319 INFO L175 Difference]: Start difference. First operand has 140 places, 55 transitions, 545 flow. Second operand 6 states and 84 transitions. [2025-04-13 20:43:59,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 114 transitions, 1347 flow [2025-04-13 20:43:59,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 114 transitions, 832 flow, removed 113 selfloop flow, removed 30 redundant places. [2025-04-13 20:43:59,601 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 322 flow [2025-04-13 20:43:59,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-04-13 20:43:59,602 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-04-13 20:43:59,602 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 322 flow [2025-04-13 20:43:59,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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:59,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:59,602 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, 1, 1, 1, 1] [2025-04-13 20:43:59,607 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:43:59,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:43:59,802 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:43:59,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:59,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1778606372, now seen corresponding path program 2 times [2025-04-13 20:43:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:59,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694764681] [2025-04-13 20:43:59,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:59,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:59,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 20:43:59,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 32 statements. [2025-04-13 20:43:59,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:43:59,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:43:59,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:59,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694764681] [2025-04-13 20:43:59,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694764681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:43:59,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:43:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:43:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447613301] [2025-04-13 20:43:59,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:43:59,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:43:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:59,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:43:59,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:43:59,874 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:43:59,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:59,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:59,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:43:59,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:00,347 INFO L116 PetriNetUnfolderBase]: 5569/8100 cut-off events. [2025-04-13 20:44:00,348 INFO L117 PetriNetUnfolderBase]: For 13800/13800 co-relation queries the response was YES. [2025-04-13 20:44:00,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29366 conditions, 8100 events. 5569/8100 cut-off events. For 13800/13800 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 40460 event pairs, 904 based on Foata normal form. 0/7201 useless extension candidates. Maximal degree in co-relation 29339. Up to 2788 conditions per place. [2025-04-13 20:44:00,383 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 137 selfloop transitions, 15 changer transitions 0/152 dead transitions. [2025-04-13 20:44:00,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 152 transitions, 1148 flow [2025-04-13 20:44:00,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:44:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:44:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2025-04-13 20:44:00,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44015444015444016 [2025-04-13 20:44:00,384 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 322 flow. Second operand 7 states and 114 transitions. [2025-04-13 20:44:00,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 152 transitions, 1148 flow [2025-04-13 20:44:00,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 152 transitions, 1128 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-13 20:44:00,397 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 437 flow [2025-04-13 20:44:00,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-04-13 20:44:00,397 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2025-04-13 20:44:00,397 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 437 flow [2025-04-13 20:44:00,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:00,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:00,398 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, 1, 1, 1, 1] [2025-04-13 20:44:00,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 20:44:00,398 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:44:00,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash -728230300, now seen corresponding path program 3 times [2025-04-13 20:44:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:00,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850187382] [2025-04-13 20:44:00,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:44:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:00,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 20:44:00,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 32 statements. [2025-04-13 20:44:00,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:44:00,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:44:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:00,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850187382] [2025-04-13 20:44:00,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850187382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:44:00,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:44:00,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:44:00,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041955654] [2025-04-13 20:44:00,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:44:00,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:44:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:00,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:44:00,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:44:00,460 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:44:00,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 437 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:00,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:00,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:44:00,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:01,069 INFO L116 PetriNetUnfolderBase]: 7151/10620 cut-off events. [2025-04-13 20:44:01,070 INFO L117 PetriNetUnfolderBase]: For 25635/25635 co-relation queries the response was YES. [2025-04-13 20:44:01,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41888 conditions, 10620 events. 7151/10620 cut-off events. For 25635/25635 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 56099 event pairs, 1255 based on Foata normal form. 331/10323 useless extension candidates. Maximal degree in co-relation 41860. Up to 4431 conditions per place. [2025-04-13 20:44:01,118 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 125 selfloop transitions, 21 changer transitions 0/146 dead transitions. [2025-04-13 20:44:01,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 146 transitions, 1161 flow [2025-04-13 20:44:01,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:44:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:44:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-04-13 20:44:01,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-04-13 20:44:01,119 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 437 flow. Second operand 6 states and 108 transitions. [2025-04-13 20:44:01,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 146 transitions, 1161 flow [2025-04-13 20:44:01,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 146 transitions, 1153 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:44:01,147 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 604 flow [2025-04-13 20:44:01,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2025-04-13 20:44:01,148 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-04-13 20:44:01,148 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 604 flow [2025-04-13 20:44:01,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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:01,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:01,148 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, 1, 1, 1, 1] [2025-04-13 20:44:01,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:44:01,148 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:44:01,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash 108642328, now seen corresponding path program 4 times [2025-04-13 20:44:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:01,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609941608] [2025-04-13 20:44:01,149 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:44:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:01,154 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 20:44:01,173 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:44:01,173 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:44:01,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:44:01,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:01,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609941608] [2025-04-13 20:44:01,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609941608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:01,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351886289] [2025-04-13 20:44:01,413 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:44:01,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:01,415 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:44:01,417 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:44:01,473 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 20:44:01,500 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:44:01,501 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:44:01,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:01,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:44:01,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:01,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-04-13 20:44:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:44:01,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:01,788 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:44:01,788 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 24 treesize of output 11 [2025-04-13 20:44:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:44:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351886289] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:02,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2025-04-13 20:44:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271394348] [2025-04-13 20:44:02,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:02,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:44:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:02,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:44:02,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:44:02,014 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:44:02,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 604 flow. Second operand has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 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:02,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:02,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:44:02,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:04,004 INFO L116 PetriNetUnfolderBase]: 12089/17873 cut-off events. [2025-04-13 20:44:04,004 INFO L117 PetriNetUnfolderBase]: For 65260/65260 co-relation queries the response was YES. [2025-04-13 20:44:04,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80829 conditions, 17873 events. 12089/17873 cut-off events. For 65260/65260 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 103206 event pairs, 1115 based on Foata normal form. 94/16909 useless extension candidates. Maximal degree in co-relation 80798. Up to 5964 conditions per place. [2025-04-13 20:44:04,104 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 326 selfloop transitions, 64 changer transitions 44/434 dead transitions. [2025-04-13 20:44:04,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 434 transitions, 3848 flow [2025-04-13 20:44:04,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 20:44:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 20:44:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 335 transitions. [2025-04-13 20:44:04,105 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3621621621621622 [2025-04-13 20:44:04,105 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 604 flow. Second operand 25 states and 335 transitions. [2025-04-13 20:44:04,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 434 transitions, 3848 flow [2025-04-13 20:44:04,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 434 transitions, 3809 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-13 20:44:04,232 INFO L231 Difference]: Finished difference. Result has 116 places, 130 transitions, 1510 flow [2025-04-13 20:44:04,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1510, PETRI_PLACES=116, PETRI_TRANSITIONS=130} [2025-04-13 20:44:04,233 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 81 predicate places. [2025-04-13 20:44:04,233 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 130 transitions, 1510 flow [2025-04-13 20:44:04,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 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:04,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:04,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1] [2025-04-13 20:44:04,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:44:04,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:04,433 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:44:04,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 560660448, now seen corresponding path program 1 times [2025-04-13 20:44:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:04,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892239194] [2025-04-13 20:44:04,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:44:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:04,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:44:04,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:44:04,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:04,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:06,060 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:44:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:06,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892239194] [2025-04-13 20:44:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892239194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:06,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619632279] [2025-04-13 20:44:06,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:44:06,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:06,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:06,063 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:44:06,063 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:44:06,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:44:06,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:44:06,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:44:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:06,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 20:44:06,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:07,317 INFO L325 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2025-04-13 20:44:07,318 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 13 [2025-04-13 20:44:07,475 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:44:07,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:12,917 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:12,917 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 118 treesize of output 293 [2025-04-13 20:44:14,031 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:44:14,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619632279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:14,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:14,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 17] total 58 [2025-04-13 20:44:14,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449873573] [2025-04-13 20:44:14,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:14,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-13 20:44:14,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:14,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-13 20:44:14,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3349, Unknown=1, NotChecked=0, Total=3540 [2025-04-13 20:44:14,033 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:44:14,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 130 transitions, 1510 flow. Second operand has 60 states, 60 states have (on average 4.683333333333334) internal successors, (281), 60 states have internal predecessors, (281), 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:14,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:14,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:44:14,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:19,355 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:23,360 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:27,370 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:31,374 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:35,379 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:39,383 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:43,872 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:47,876 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:51,885 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:55,898 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:44:59,902 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:04,370 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:08,415 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:12,420 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:16,431 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:20,438 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:24,443 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:28,834 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:32,846 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:36,854 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:37,955 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:41,956 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:45,984 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:49,987 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:53,992 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:45:57,995 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:02,009 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:06,013 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:09,059 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:13,065 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:17,077 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:21,086 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:25,094 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:29,448 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:33,451 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:37,456 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:41,462 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:45,470 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:49,474 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:53,478 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:46:57,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:01,509 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:05,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:09,531 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:13,537 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:17,544 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:21,548 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:25,562 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:29,567 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:33,631 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:37,995 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:42,046 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:46,193 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:50,198 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:54,213 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:47:58,220 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:02,234 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:06,241 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:10,249 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:14,260 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:18,280 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:22,475 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:25,446 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:29,596 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:33,609 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:37,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:41,626 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:45,630 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:49,639 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:53,644 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:48:57,776 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:02,242 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:06,246 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:10,253 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:14,260 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:18,591 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:22,661 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:26,668 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:30,675 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:34,965 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:38,983 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:43,000 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:47,365 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:51,368 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:54,186 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:49:57,089 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:50:00,847 INFO L116 PetriNetUnfolderBase]: 13176/19565 cut-off events. [2025-04-13 20:50:00,847 INFO L117 PetriNetUnfolderBase]: For 106200/106200 co-relation queries the response was YES. [2025-04-13 20:50:00,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100739 conditions, 19565 events. 13176/19565 cut-off events. For 106200/106200 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 113909 event pairs, 2555 based on Foata normal form. 4/18467 useless extension candidates. Maximal degree in co-relation 100696. Up to 17614 conditions per place. [2025-04-13 20:50:00,975 INFO L140 encePairwiseOnDemand]: 17/37 looper letters, 386 selfloop transitions, 175 changer transitions 4/565 dead transitions. [2025-04-13 20:50:00,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 565 transitions, 5747 flow [2025-04-13 20:50:00,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 20:50:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-04-13 20:50:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 564 transitions. [2025-04-13 20:50:00,977 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27714987714987716 [2025-04-13 20:50:00,977 INFO L175 Difference]: Start difference. First operand has 116 places, 130 transitions, 1510 flow. Second operand 55 states and 564 transitions. [2025-04-13 20:50:00,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 565 transitions, 5747 flow [2025-04-13 20:50:01,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 565 transitions, 5523 flow, removed 73 selfloop flow, removed 7 redundant places. [2025-04-13 20:50:01,438 INFO L231 Difference]: Finished difference. Result has 173 places, 301 transitions, 3632 flow [2025-04-13 20:50:01,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3632, PETRI_PLACES=173, PETRI_TRANSITIONS=301} [2025-04-13 20:50:01,439 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 138 predicate places. [2025-04-13 20:50:01,439 INFO L485 AbstractCegarLoop]: Abstraction has has 173 places, 301 transitions, 3632 flow [2025-04-13 20:50:01,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.683333333333334) internal successors, (281), 60 states have internal predecessors, (281), 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:50:01,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:50:01,439 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1] [2025-04-13 20:50:01,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:50:01,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:50:01,640 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:50:01,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:50:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1456241284, now seen corresponding path program 2 times [2025-04-13 20:50:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:50:01,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234921439] [2025-04-13 20:50:01,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:50:01,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:50:01,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:50:01,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:50:01,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:50:01,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:03,645 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:50:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:50:03,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234921439] [2025-04-13 20:50:03,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234921439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:50:03,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369074550] [2025-04-13 20:50:03,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:50:03,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:50:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:50:03,648 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:50:03,648 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:50:03,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:50:03,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:50:03,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:50:03,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:03,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-04-13 20:50:03,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:50:03,941 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:50:04,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:50:05,040 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:50:05,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:50:07,116 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:07,117 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 515 treesize of output 509 [2025-04-13 20:50:07,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2025-04-13 20:50:07,195 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:07,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 426 treesize of output 400 [2025-04-13 20:50:07,592 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:07,593 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 541 treesize of output 533 [2025-04-13 20:50:07,649 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:07,650 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 140 treesize of output 136 [2025-04-13 20:50:07,794 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:07,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 626 treesize of output 622 [2025-04-13 20:50:11,605 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:11,606 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 515 treesize of output 509 [2025-04-13 20:50:11,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 162 [2025-04-13 20:50:11,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:50:11,719 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:11,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 604 treesize of output 524 [2025-04-13 20:50:12,419 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:50:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369074550] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:50:12,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:50:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 65 [2025-04-13 20:50:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553161623] [2025-04-13 20:50:12,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:50:12,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-13 20:50:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:50:12,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-13 20:50:12,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=4083, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 20:50:12,422 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:50:12,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 301 transitions, 3632 flow. Second operand has 67 states, 67 states have (on average 4.522388059701493) internal successors, (303), 67 states have internal predecessors, (303), 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:50:12,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:50:12,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:50:12,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:50:39,295 WARN L286 SmtUtils]: Spent 17.72s on a formula simplification. DAG size of input: 141 DAG size of output: 115 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:50:43,588 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:51:21,538 WARN L286 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 136 DAG size of output: 117 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:51:23,744 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:51:31,383 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:51:41,624 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 99 DAG size of output: 85 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:51:46,439 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:02,201 WARN L286 SmtUtils]: Spent 15.16s on a formula simplification. DAG size of input: 106 DAG size of output: 94 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:52:07,394 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:12,381 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:19,009 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:21,046 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:25,262 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:29,908 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:33,937 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:39,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:43,138 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:47,274 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:49,177 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:53,178 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:52:57,351 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:53:01,365 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:53:05,716 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:53:09,753 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:53:24,628 WARN L286 SmtUtils]: Spent 10.55s on a formula simplification. DAG size of input: 131 DAG size of output: 110 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:53:42,488 INFO L116 PetriNetUnfolderBase]: 23259/34235 cut-off events. [2025-04-13 20:53:42,488 INFO L117 PetriNetUnfolderBase]: For 265060/265060 co-relation queries the response was YES. [2025-04-13 20:53:42,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200919 conditions, 34235 events. 23259/34235 cut-off events. For 265060/265060 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 216070 event pairs, 1578 based on Foata normal form. 7/32736 useless extension candidates. Maximal degree in co-relation 200866. Up to 21823 conditions per place. [2025-04-13 20:53:42,901 INFO L140 encePairwiseOnDemand]: 17/37 looper letters, 541 selfloop transitions, 686 changer transitions 30/1257 dead transitions. [2025-04-13 20:53:42,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 1257 transitions, 15318 flow [2025-04-13 20:53:42,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2025-04-13 20:53:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2025-04-13 20:53:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 1078 transitions. [2025-04-13 20:53:42,904 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2511649580615098 [2025-04-13 20:53:42,904 INFO L175 Difference]: Start difference. First operand has 173 places, 301 transitions, 3632 flow. Second operand 116 states and 1078 transitions. [2025-04-13 20:53:42,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 1257 transitions, 15318 flow [2025-04-13 20:53:44,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 1257 transitions, 14874 flow, removed 220 selfloop flow, removed 2 redundant places. [2025-04-13 20:53:44,144 INFO L231 Difference]: Finished difference. Result has 321 places, 856 transitions, 12686 flow [2025-04-13 20:53:44,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3374, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=116, PETRI_FLOW=12686, PETRI_PLACES=321, PETRI_TRANSITIONS=856} [2025-04-13 20:53:44,145 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 286 predicate places. [2025-04-13 20:53:44,145 INFO L485 AbstractCegarLoop]: Abstraction has has 321 places, 856 transitions, 12686 flow [2025-04-13 20:53:44,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.522388059701493) internal successors, (303), 67 states have internal predecessors, (303), 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:53:44,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:53:44,145 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1] [2025-04-13 20:53:44,151 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:53:44,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:44,348 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:53:44,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:53:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash -208598582, now seen corresponding path program 3 times [2025-04-13 20:53:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:53:44,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816760836] [2025-04-13 20:53:44,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:53:44,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:53:44,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:53:44,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:53:44,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:53:44,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:46,482 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:53:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:53:46,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816760836] [2025-04-13 20:53:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816760836] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:53:46,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965907428] [2025-04-13 20:53:46,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:53:46,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:53:46,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:53:46,484 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:53:46,485 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:53:46,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 20:53:46,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:53:46,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:53:46,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:53:46,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-13 20:53:46,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:53:46,712 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:53:46,778 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:53:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:53:47,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:53:50,811 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:53:50,811 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 541 treesize of output 533 [2025-04-13 20:53:50,876 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:53:50,877 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 140 treesize of output 136 [2025-04-13 20:53:51,017 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:53:51,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 759 treesize of output 719 [2025-04-13 20:53:54,080 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:53:54,081 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 515 treesize of output 509 [2025-04-13 20:53:54,124 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 162 [2025-04-13 20:53:54,156 INFO L325 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-04-13 20:53:54,156 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 332 [2025-04-13 20:53:54,369 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:53:54,369 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 515 treesize of output 509 [2025-04-13 20:53:54,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2025-04-13 20:53:54,452 INFO L325 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-04-13 20:53:54,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 558 treesize of output 488 [2025-04-13 20:53:54,911 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:53:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965907428] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:53:54,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:53:54,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 60 [2025-04-13 20:53:54,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038888125] [2025-04-13 20:53:54,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:53:54,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-04-13 20:53:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:53:54,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-04-13 20:53:54,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3534, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 20:53:54,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-13 20:53:54,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 856 transitions, 12686 flow. Second operand has 62 states, 62 states have (on average 4.629032258064516) internal successors, (287), 62 states have internal predecessors, (287), 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:53:54,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:53:54,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-13 20:53:54,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:54:05,987 WARN L286 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 125 DAG size of output: 96 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:54:30,960 WARN L286 SmtUtils]: Spent 17.68s on a formula simplification. DAG size of input: 124 DAG size of output: 94 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:55:24,360 WARN L286 SmtUtils]: Spent 49.05s on a formula simplification. DAG size of input: 130 DAG size of output: 62 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:55:33,774 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:56:12,095 WARN L286 SmtUtils]: Spent 25.70s on a formula simplification. DAG size of input: 117 DAG size of output: 60 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:56:25,640 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:56:57,336 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification. DAG size of input: 108 DAG size of output: 97 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:57:10,393 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-13 20:57:27,754 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:57:31,789 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-04-13 20:57:51,196 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:57:51,197 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:57:52,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 20:57:52,401 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 20:57:52,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-13 20:57:52,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-04-13 20:57:52,439 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:57:52,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 20:57:52,440 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-13 20:57:52,441 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:57:52,441 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:57:52,441 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:57:52,441 INFO L422 BasicCegarLoop]: Path program histogram: [18, 4, 3, 2, 2, 1, 1, 1, 1] [2025-04-13 20:57:52,444 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:57:52,444 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:57:52,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:57:52 BasicIcfg [2025-04-13 20:57:52,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:57:52,450 INFO L158 Benchmark]: Toolchain (without parser) took 854623.42ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 859.8MB). Free memory was 108.1MB in the beginning and 134.2MB in the end (delta: -26.1MB). Peak memory consumption was 831.1MB. Max. memory is 8.0GB. [2025-04-13 20:57:52,451 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:57:52,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.43ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 92.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:57:52,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.65ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 89.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:57:52,451 INFO L158 Benchmark]: Boogie Preprocessor took 35.04ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 87.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:57:52,451 INFO L158 Benchmark]: RCFGBuilder took 656.86ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 76.5MB in the end (delta: 10.9MB). Peak memory consumption was 70.2MB. Max. memory is 8.0GB. [2025-04-13 20:57:52,451 INFO L158 Benchmark]: TraceAbstraction took 853656.10ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 859.8MB). Free memory was 76.5MB in the beginning and 134.2MB in the end (delta: -57.7MB). Peak memory consumption was 798.7MB. Max. memory is 8.0GB. [2025-04-13 20:57:52,452 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.14ms. Allocated memory is still 155.2MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.43ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 92.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.65ms. Allocated memory is still 155.2MB. Free memory was 92.2MB in the beginning and 89.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 35.04ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 87.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 656.86ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 76.5MB in the end (delta: 10.9MB). Peak memory consumption was 70.2MB. Max. memory is 8.0GB. * TraceAbstraction took 853656.10ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 859.8MB). Free memory was 76.5MB in the beginning and 134.2MB in the end (delta: -57.7MB). Peak memory consumption was 798.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 61 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: 853.6s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 812.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 99 mSolverCounterUnknown, 3035 SdHoareTripleChecker+Valid, 472.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3035 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 469.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31543 IncrementalHoareTripleChecker+Invalid, 32852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1210 mSolverCounterUnsat, 0 mSDtfsCounter, 31543 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 945 GetRequests, 322 SyntacticMatches, 5 SemanticMatches, 617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15227 ImplicationChecksByTransitivity, 314.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12686occurred in iteration=32, InterpolantAutomatonStates: 412, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 37.7s InterpolantComputationTime, 1134 NumberOfCodeBlocks, 1105 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1306 ConstructedInterpolants, 84 QuantifiedInterpolants, 23903 SizeOfPredicates, 93 NumberOfNonLiveVariables, 2280 ConjunctsInSsa, 271 ConjunctsInUnsatCore, 48 InterpolantComputations, 26 PerfectInterpolantSequences, 105/207 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