./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:19:49,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:19:49,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:19:49,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:19:49,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:19:49,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:19:49,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:19:49,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:19:49,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:19:49,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:19:49,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:19:49,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:19:49,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:19:49,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:19:49,198 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:19:49,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:19:49,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:19:49,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:19:49,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:19:49,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:19:49,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:19:49,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:19:49,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:19:49,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:19:49,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:19:49,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:19:49,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:19:49,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:19:49,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:19:49,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:19:49,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:19:49,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:19:49,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:19:49,201 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-03-04 02:19:49,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:19:49,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:19:49,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:19:49,521 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:19:49,522 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:19:49,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-04 02:19:50,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e337b6c17/6476cbbec5ec419d90145feed57ceb73/FLAG13fd38ddf [2025-03-04 02:19:50,926 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:19:50,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-03-04 02:19:50,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e337b6c17/6476cbbec5ec419d90145feed57ceb73/FLAG13fd38ddf [2025-03-04 02:19:51,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e337b6c17/6476cbbec5ec419d90145feed57ceb73 [2025-03-04 02:19:51,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:19:51,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:19:51,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:19:51,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:19:51,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:19:51,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2b9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51, skipping insertion in model container [2025-03-04 02:19:51,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:19:51,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c[2874,2887] [2025-03-04 02:19:51,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:19:51,356 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:19:51,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c[2874,2887] [2025-03-04 02:19:51,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:19:51,386 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:19:51,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51 WrapperNode [2025-03-04 02:19:51,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:19:51,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:19:51,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:19:51,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:19:51,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,414 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 117 [2025-03-04 02:19:51,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:19:51,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:19:51,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:19:51,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:19:51,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,435 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 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-03-04 02:19:51,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:19:51,448 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:19:51,448 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:19:51,448 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:19:51,449 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (1/1) ... [2025-03-04 02:19:51,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:19:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:51,470 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-03-04 02:19:51,472 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-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:19:51,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:19:51,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:19:51,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:19:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:19:51,488 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:19:51,564 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:19:51,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:19:51,819 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:19:51,820 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:19:52,007 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:19:52,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:19:52,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:19:52 BoogieIcfgContainer [2025-03-04 02:19:52,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:19:52,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:19:52,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:19:52,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:19:52,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:19:51" (1/3) ... [2025-03-04 02:19:52,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517e251c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:19:52, skipping insertion in model container [2025-03-04 02:19:52,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:51" (2/3) ... [2025-03-04 02:19:52,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517e251c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:19:52, skipping insertion in model container [2025-03-04 02:19:52,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:19:52" (3/3) ... [2025-03-04 02:19:52,016 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-03-04 02:19:52,026 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:19:52,027 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:19:52,028 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:19:52,074 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:19:52,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 82 flow [2025-03-04 02:19:52,123 INFO L124 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-03-04 02:19:52,124 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:19:52,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 8/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-04 02:19:52,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 82 flow [2025-03-04 02:19:52,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 31 transitions, 74 flow [2025-03-04 02:19:52,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:19:52,141 INFO L333 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;@347c6de8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:19:52,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:19:52,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:19:52,151 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2025-03-04 02:19:52,152 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:19:52,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:52,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:52,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:52,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -371042857, now seen corresponding path program 1 times [2025-03-04 02:19:52,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:52,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740673522] [2025-03-04 02:19:52,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:52,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:19:52,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:19:52,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:52,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740673522] [2025-03-04 02:19:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740673522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:52,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:52,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718202778] [2025-03-04 02:19:52,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:52,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:52,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:52,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:52,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:52,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 74 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-03-04 02:19:52,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:52,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:52,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:52,872 INFO L124 PetriNetUnfolderBase]: 244/413 cut-off events. [2025-03-04 02:19:52,872 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 02:19:52,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 413 events. 244/413 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1458 event pairs, 115 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 755. Up to 301 conditions per place. [2025-03-04 02:19:52,879 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 37 selfloop transitions, 1 changer transitions 7/48 dead transitions. [2025-03-04 02:19:52,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 210 flow [2025-03-04 02:19:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:19:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:19:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-04 02:19:52,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2025-03-04 02:19:52,890 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 74 flow. Second operand 4 states and 67 transitions. [2025-03-04 02:19:52,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 210 flow [2025-03-04 02:19:52,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:19:52,896 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 75 flow [2025-03-04 02:19:52,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-03-04 02:19:52,901 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-03-04 02:19:52,901 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 75 flow [2025-03-04 02:19:52,901 INFO L472 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-03-04 02:19:52,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:52,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:52,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:19:52,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:52,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash 105205641, now seen corresponding path program 2 times [2025-03-04 02:19:52,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:52,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064485966] [2025-03-04 02:19:52,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:52,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:52,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:19:52,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:19:52,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:52,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064485966] [2025-03-04 02:19:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064485966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:53,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:53,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362080432] [2025-03-04 02:19:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:53,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:19:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:53,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:19:53,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:19:53,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:53,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 75 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-03-04 02:19:53,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:53,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:53,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:53,272 INFO L124 PetriNetUnfolderBase]: 284/495 cut-off events. [2025-03-04 02:19:53,272 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 02:19:53,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 495 events. 284/495 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1982 event pairs, 156 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 1022. Up to 367 conditions per place. [2025-03-04 02:19:53,276 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 37 selfloop transitions, 1 changer transitions 9/50 dead transitions. [2025-03-04 02:19:53,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 50 transitions, 217 flow [2025-03-04 02:19:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:19:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:19:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-04 02:19:53,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2025-03-04 02:19:53,278 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 75 flow. Second operand 4 states and 69 transitions. [2025-03-04 02:19:53,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 50 transitions, 217 flow [2025-03-04 02:19:53,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 50 transitions, 211 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 02:19:53,280 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 81 flow [2025-03-04 02:19:53,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-03-04 02:19:53,280 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-03-04 02:19:53,280 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 81 flow [2025-03-04 02:19:53,280 INFO L472 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-03-04 02:19:53,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:53,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:19:53,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2008152445, now seen corresponding path program 1 times [2025-03-04 02:19:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152954447] [2025-03-04 02:19:53,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:53,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:19:53,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:19:53,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:53,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:53,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152954447] [2025-03-04 02:19:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152954447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:53,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:19:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864492086] [2025-03-04 02:19:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:53,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:19:53,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:53,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:19:53,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:19:53,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:53,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:53,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:53,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:53,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:53,375 INFO L124 PetriNetUnfolderBase]: 194/341 cut-off events. [2025-03-04 02:19:53,376 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-04 02:19:53,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 341 events. 194/341 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1177 event pairs, 62 based on Foata normal form. 17/325 useless extension candidates. Maximal degree in co-relation 716. Up to 255 conditions per place. [2025-03-04 02:19:53,379 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 31 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2025-03-04 02:19:53,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 183 flow [2025-03-04 02:19:53,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:19:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:19:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 02:19:53,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-03-04 02:19:53,382 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 81 flow. Second operand 3 states and 55 transitions. [2025-03-04 02:19:53,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 183 flow [2025-03-04 02:19:53,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:19:53,384 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 84 flow [2025-03-04 02:19:53,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-03-04 02:19:53,385 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-03-04 02:19:53,386 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 84 flow [2025-03-04 02:19:53,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:53,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:53,386 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] [2025-03-04 02:19:53,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:19:53,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:53,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:53,387 INFO L85 PathProgramCache]: Analyzing trace with hash -304591366, now seen corresponding path program 1 times [2025-03-04 02:19:53,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:53,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708596829] [2025-03-04 02:19:53,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:53,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:19:53,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:19:53,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:53,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708596829] [2025-03-04 02:19:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708596829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:53,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:53,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:19:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629548854] [2025-03-04 02:19:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:53,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:53,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:53,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:53,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:53,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 84 flow. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:53,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:53,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:53,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:53,943 INFO L124 PetriNetUnfolderBase]: 416/713 cut-off events. [2025-03-04 02:19:53,944 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-04 02:19:53,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1570 conditions, 713 events. 416/713 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2994 event pairs, 74 based on Foata normal form. 1/645 useless extension candidates. Maximal degree in co-relation 499. Up to 245 conditions per place. [2025-03-04 02:19:53,947 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 79 selfloop transitions, 14 changer transitions 1/97 dead transitions. [2025-03-04 02:19:53,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 97 transitions, 448 flow [2025-03-04 02:19:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:19:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:19:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2025-03-04 02:19:53,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48161764705882354 [2025-03-04 02:19:53,949 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 84 flow. Second operand 8 states and 131 transitions. [2025-03-04 02:19:53,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 97 transitions, 448 flow [2025-03-04 02:19:53,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 97 transitions, 424 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 02:19:53,950 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 168 flow [2025-03-04 02:19:53,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2025-03-04 02:19:53,951 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2025-03-04 02:19:53,951 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 168 flow [2025-03-04 02:19:53,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:53,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:53,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:53,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:19:53,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:53,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1250945975, now seen corresponding path program 1 times [2025-03-04 02:19:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:53,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912629331] [2025-03-04 02:19:53,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:53,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:19:53,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:19:53,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:53,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:54,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912629331] [2025-03-04 02:19:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912629331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:54,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302309584] [2025-03-04 02:19:54,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:54,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:54,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:54,196 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-03-04 02:19:54,198 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-03-04 02:19:54,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:19:54,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:19:54,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:54,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:19:54,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:54,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:55,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302309584] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:55,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:19:55,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 25 [2025-03-04 02:19:55,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908366300] [2025-03-04 02:19:55,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:55,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:19:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:55,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:19:55,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:19:55,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:55,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 168 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:55,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:55,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:55,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:55,841 INFO L124 PetriNetUnfolderBase]: 930/1613 cut-off events. [2025-03-04 02:19:55,841 INFO L125 PetriNetUnfolderBase]: For 390/394 co-relation queries the response was YES. [2025-03-04 02:19:55,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 1613 events. 930/1613 cut-off events. For 390/394 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8412 event pairs, 98 based on Foata normal form. 5/1615 useless extension candidates. Maximal degree in co-relation 2669. Up to 304 conditions per place. [2025-03-04 02:19:55,849 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 122 selfloop transitions, 46 changer transitions 6/177 dead transitions. [2025-03-04 02:19:55,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 177 transitions, 946 flow [2025-03-04 02:19:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:19:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:19:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 212 transitions. [2025-03-04 02:19:55,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796380090497738 [2025-03-04 02:19:55,851 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 168 flow. Second operand 13 states and 212 transitions. [2025-03-04 02:19:55,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 177 transitions, 946 flow [2025-03-04 02:19:55,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 177 transitions, 942 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 02:19:55,856 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 521 flow [2025-03-04 02:19:55,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=521, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2025-03-04 02:19:55,858 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2025-03-04 02:19:55,858 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 521 flow [2025-03-04 02:19:55,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:55,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:55,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:55,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:19:56,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:56,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash 473989398, now seen corresponding path program 1 times [2025-03-04 02:19:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720354096] [2025-03-04 02:19:56,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:56,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:19:56,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:19:56,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:56,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:56,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:56,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720354096] [2025-03-04 02:19:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720354096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700171475] [2025-03-04 02:19:56,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:56,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:56,261 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-03-04 02:19:56,263 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-03-04 02:19:56,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:19:56,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:19:56,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:56,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:56,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:19:56,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:56,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700171475] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:57,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:19:57,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 22 [2025-03-04 02:19:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340957311] [2025-03-04 02:19:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:57,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:19:57,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:57,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:19:57,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:19:57,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:57,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 521 flow. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:57,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:57,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:57,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:57,714 INFO L124 PetriNetUnfolderBase]: 1355/2368 cut-off events. [2025-03-04 02:19:57,715 INFO L125 PetriNetUnfolderBase]: For 3741/3745 co-relation queries the response was YES. [2025-03-04 02:19:57,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7575 conditions, 2368 events. 1355/2368 cut-off events. For 3741/3745 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13438 event pairs, 267 based on Foata normal form. 5/2370 useless extension candidates. Maximal degree in co-relation 7496. Up to 697 conditions per place. [2025-03-04 02:19:57,730 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 175 selfloop transitions, 48 changer transitions 7/233 dead transitions. [2025-03-04 02:19:57,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 233 transitions, 1629 flow [2025-03-04 02:19:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:19:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:19:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 257 transitions. [2025-03-04 02:19:57,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5399159663865546 [2025-03-04 02:19:57,733 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 521 flow. Second operand 14 states and 257 transitions. [2025-03-04 02:19:57,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 233 transitions, 1629 flow [2025-03-04 02:19:57,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 233 transitions, 1606 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-04 02:19:57,750 INFO L231 Difference]: Finished difference. Result has 79 places, 97 transitions, 798 flow [2025-03-04 02:19:57,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=798, PETRI_PLACES=79, PETRI_TRANSITIONS=97} [2025-03-04 02:19:57,751 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2025-03-04 02:19:57,752 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 97 transitions, 798 flow [2025-03-04 02:19:57,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:57,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:57,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:57,758 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-03-04 02:19:57,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:19:57,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:57,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash -523255044, now seen corresponding path program 1 times [2025-03-04 02:19:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:57,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810493784] [2025-03-04 02:19:57,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:57,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:57,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:19:57,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:19:57,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:57,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:19:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810493784] [2025-03-04 02:19:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810493784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:58,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:58,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:19:58,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850528866] [2025-03-04 02:19:58,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:58,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:58,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:58,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:58,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:58,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 97 transitions, 798 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-03-04 02:19:58,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:58,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:58,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:58,240 INFO L124 PetriNetUnfolderBase]: 980/1860 cut-off events. [2025-03-04 02:19:58,241 INFO L125 PetriNetUnfolderBase]: For 5104/5104 co-relation queries the response was YES. [2025-03-04 02:19:58,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6331 conditions, 1860 events. 980/1860 cut-off events. For 5104/5104 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11046 event pairs, 563 based on Foata normal form. 72/1928 useless extension candidates. Maximal degree in co-relation 6256. Up to 906 conditions per place. [2025-03-04 02:19:58,252 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 100 selfloop transitions, 14 changer transitions 8/125 dead transitions. [2025-03-04 02:19:58,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1169 flow [2025-03-04 02:19:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:19:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:19:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-03-04 02:19:58,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2025-03-04 02:19:58,254 INFO L175 Difference]: Start difference. First operand has 79 places, 97 transitions, 798 flow. Second operand 6 states and 90 transitions. [2025-03-04 02:19:58,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1169 flow [2025-03-04 02:19:58,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 1087 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-03-04 02:19:58,269 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 668 flow [2025-03-04 02:19:58,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2025-03-04 02:19:58,271 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2025-03-04 02:19:58,271 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 668 flow [2025-03-04 02:19:58,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-03-04 02:19:58,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:58,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:58,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:19:58,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:58,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1633933854, now seen corresponding path program 2 times [2025-03-04 02:19:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:58,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438052916] [2025-03-04 02:19:58,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:58,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:58,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:19:58,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 02:19:58,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438052916] [2025-03-04 02:19:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438052916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:58,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:58,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:19:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782752669] [2025-03-04 02:19:58,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:58,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:19:58,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:58,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:19:58,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:19:58,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:58,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 668 flow. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:58,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:58,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:58,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:59,018 INFO L124 PetriNetUnfolderBase]: 896/1664 cut-off events. [2025-03-04 02:19:59,018 INFO L125 PetriNetUnfolderBase]: For 4856/4868 co-relation queries the response was YES. [2025-03-04 02:19:59,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 1664 events. 896/1664 cut-off events. For 4856/4868 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9312 event pairs, 182 based on Foata normal form. 29/1690 useless extension candidates. Maximal degree in co-relation 5108. Up to 697 conditions per place. [2025-03-04 02:19:59,025 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 102 selfloop transitions, 40 changer transitions 14/159 dead transitions. [2025-03-04 02:19:59,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 159 transitions, 1318 flow [2025-03-04 02:19:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:19:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:19:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 192 transitions. [2025-03-04 02:19:59,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2025-03-04 02:19:59,027 INFO L175 Difference]: Start difference. First operand has 82 places, 85 transitions, 668 flow. Second operand 15 states and 192 transitions. [2025-03-04 02:19:59,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 159 transitions, 1318 flow [2025-03-04 02:19:59,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 159 transitions, 1300 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 02:19:59,040 INFO L231 Difference]: Finished difference. Result has 102 places, 89 transitions, 818 flow [2025-03-04 02:19:59,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=818, PETRI_PLACES=102, PETRI_TRANSITIONS=89} [2025-03-04 02:19:59,042 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2025-03-04 02:19:59,043 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 89 transitions, 818 flow [2025-03-04 02:19:59,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:59,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:59,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:19:59,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1267178366, now seen corresponding path program 3 times [2025-03-04 02:19:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549896167] [2025-03-04 02:19:59,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:59,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:19:59,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 02:19:59,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:19:59,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:59,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:59,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549896167] [2025-03-04 02:19:59,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549896167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:59,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:59,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:19:59,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740731108] [2025-03-04 02:19:59,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:59,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:19:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:59,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:19:59,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:19:59,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:59,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 89 transitions, 818 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:59,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:59,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:59,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:59,545 INFO L124 PetriNetUnfolderBase]: 846/1559 cut-off events. [2025-03-04 02:19:59,545 INFO L125 PetriNetUnfolderBase]: For 5779/5783 co-relation queries the response was YES. [2025-03-04 02:19:59,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6321 conditions, 1559 events. 846/1559 cut-off events. For 5779/5783 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8524 event pairs, 171 based on Foata normal form. 5/1562 useless extension candidates. Maximal degree in co-relation 6240. Up to 959 conditions per place. [2025-03-04 02:19:59,555 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 88 selfloop transitions, 38 changer transitions 6/135 dead transitions. [2025-03-04 02:19:59,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 135 transitions, 1288 flow [2025-03-04 02:19:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:19:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:19:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2025-03-04 02:19:59,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.393048128342246 [2025-03-04 02:19:59,557 INFO L175 Difference]: Start difference. First operand has 102 places, 89 transitions, 818 flow. Second operand 11 states and 147 transitions. [2025-03-04 02:19:59,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 135 transitions, 1288 flow [2025-03-04 02:19:59,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 135 transitions, 1224 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-04 02:19:59,570 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 842 flow [2025-03-04 02:19:59,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=842, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2025-03-04 02:19:59,571 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2025-03-04 02:19:59,571 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 842 flow [2025-03-04 02:19:59,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:59,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:59,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:19:59,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:19:59,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:19:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1854384621, now seen corresponding path program 2 times [2025-03-04 02:19:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381855793] [2025-03-04 02:19:59,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:59,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:19:59,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 02:19:59,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:59,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:19:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381855793] [2025-03-04 02:19:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381855793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:19:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447052535] [2025-03-04 02:19:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:59,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:19:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:59,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:19:59,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:19:59,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:19:59,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 842 flow. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:19:59,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:59,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:19:59,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:00,128 INFO L124 PetriNetUnfolderBase]: 833/1532 cut-off events. [2025-03-04 02:20:00,128 INFO L125 PetriNetUnfolderBase]: For 5759/5763 co-relation queries the response was YES. [2025-03-04 02:20:00,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6340 conditions, 1532 events. 833/1532 cut-off events. For 5759/5763 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8273 event pairs, 105 based on Foata normal form. 5/1534 useless extension candidates. Maximal degree in co-relation 5926. Up to 595 conditions per place. [2025-03-04 02:20:00,138 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 110 selfloop transitions, 49 changer transitions 7/169 dead transitions. [2025-03-04 02:20:00,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 169 transitions, 1649 flow [2025-03-04 02:20:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 172 transitions. [2025-03-04 02:20:00,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2025-03-04 02:20:00,140 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 842 flow. Second operand 12 states and 172 transitions. [2025-03-04 02:20:00,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 169 transitions, 1649 flow [2025-03-04 02:20:00,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 169 transitions, 1542 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:00,154 INFO L231 Difference]: Finished difference. Result has 110 places, 99 transitions, 1008 flow [2025-03-04 02:20:00,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1008, PETRI_PLACES=110, PETRI_TRANSITIONS=99} [2025-03-04 02:20:00,155 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2025-03-04 02:20:00,155 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 99 transitions, 1008 flow [2025-03-04 02:20:00,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:00,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:00,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:00,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:20:00,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:00,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1172597149, now seen corresponding path program 3 times [2025-03-04 02:20:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:00,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448524301] [2025-03-04 02:20:00,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:00,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:00,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 02:20:00,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:00,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448524301] [2025-03-04 02:20:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448524301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:20:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817890024] [2025-03-04 02:20:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:20:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:00,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:20:00,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:20:00,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:00,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 99 transitions, 1008 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:00,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:00,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:00,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:00,889 INFO L124 PetriNetUnfolderBase]: 584/1120 cut-off events. [2025-03-04 02:20:00,889 INFO L125 PetriNetUnfolderBase]: For 4897/4901 co-relation queries the response was YES. [2025-03-04 02:20:00,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4644 conditions, 1120 events. 584/1120 cut-off events. For 4897/4901 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5861 event pairs, 109 based on Foata normal form. 43/1161 useless extension candidates. Maximal degree in co-relation 4583. Up to 450 conditions per place. [2025-03-04 02:20:00,898 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 114 selfloop transitions, 43 changer transitions 19/179 dead transitions. [2025-03-04 02:20:00,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 179 transitions, 1681 flow [2025-03-04 02:20:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:20:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:20:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 224 transitions. [2025-03-04 02:20:00,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875432525951557 [2025-03-04 02:20:00,900 INFO L175 Difference]: Start difference. First operand has 110 places, 99 transitions, 1008 flow. Second operand 17 states and 224 transitions. [2025-03-04 02:20:00,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 179 transitions, 1681 flow [2025-03-04 02:20:00,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 179 transitions, 1591 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:00,915 INFO L231 Difference]: Finished difference. Result has 125 places, 92 transitions, 916 flow [2025-03-04 02:20:00,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=916, PETRI_PLACES=125, PETRI_TRANSITIONS=92} [2025-03-04 02:20:00,916 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2025-03-04 02:20:00,916 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 92 transitions, 916 flow [2025-03-04 02:20:00,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:00,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:00,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:00,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:20:00,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:00,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash -506572549, now seen corresponding path program 4 times [2025-03-04 02:20:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:00,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33681709] [2025-03-04 02:20:00,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:00,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:00,939 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:00,939 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:01,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:01,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33681709] [2025-03-04 02:20:01,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33681709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:01,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246846255] [2025-03-04 02:20:01,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:01,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:01,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:01,150 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-03-04 02:20:01,188 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:01,203 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:01,203 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:01,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:01,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:20:01,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:01,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:01,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246846255] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:01,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:01,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 25 [2025-03-04 02:20:01,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413170893] [2025-03-04 02:20:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:01,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:01,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:01,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:01,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:20:01,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:01,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 92 transitions, 916 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:01,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:01,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:01,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:02,141 INFO L124 PetriNetUnfolderBase]: 545/1023 cut-off events. [2025-03-04 02:20:02,141 INFO L125 PetriNetUnfolderBase]: For 4961/4969 co-relation queries the response was YES. [2025-03-04 02:20:02,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4452 conditions, 1023 events. 545/1023 cut-off events. For 4961/4969 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5146 event pairs, 106 based on Foata normal form. 9/1030 useless extension candidates. Maximal degree in co-relation 4390. Up to 450 conditions per place. [2025-03-04 02:20:02,149 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 103 selfloop transitions, 34 changer transitions 6/146 dead transitions. [2025-03-04 02:20:02,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 146 transitions, 1436 flow [2025-03-04 02:20:02,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2025-03-04 02:20:02,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2025-03-04 02:20:02,151 INFO L175 Difference]: Start difference. First operand has 125 places, 92 transitions, 916 flow. Second operand 12 states and 162 transitions. [2025-03-04 02:20:02,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 146 transitions, 1436 flow [2025-03-04 02:20:02,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 146 transitions, 1262 flow, removed 38 selfloop flow, removed 19 redundant places. [2025-03-04 02:20:02,165 INFO L231 Difference]: Finished difference. Result has 113 places, 91 transitions, 821 flow [2025-03-04 02:20:02,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=821, PETRI_PLACES=113, PETRI_TRANSITIONS=91} [2025-03-04 02:20:02,166 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2025-03-04 02:20:02,166 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 91 transitions, 821 flow [2025-03-04 02:20:02,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:02,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:02,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:02,173 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-03-04 02:20:02,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:02,371 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash 756732539, now seen corresponding path program 5 times [2025-03-04 02:20:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18337350] [2025-03-04 02:20:02,372 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:02,376 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:02,383 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:02,384 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:02,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:02,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:02,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18337350] [2025-03-04 02:20:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18337350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:02,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731672725] [2025-03-04 02:20:02,527 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:02,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:02,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:02,529 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-03-04 02:20:02,531 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-03-04 02:20:02,566 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:02,581 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:02,581 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:02,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:02,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:20:02,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:02,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731672725] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 25 [2025-03-04 02:20:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519483409] [2025-03-04 02:20:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:03,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:03,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:03,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:03,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:20:03,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:03,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 91 transitions, 821 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:03,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:03,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:03,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:03,746 INFO L124 PetriNetUnfolderBase]: 565/1081 cut-off events. [2025-03-04 02:20:03,746 INFO L125 PetriNetUnfolderBase]: For 3783/3791 co-relation queries the response was YES. [2025-03-04 02:20:03,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4319 conditions, 1081 events. 565/1081 cut-off events. For 3783/3791 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5623 event pairs, 115 based on Foata normal form. 9/1087 useless extension candidates. Maximal degree in co-relation 4259. Up to 450 conditions per place. [2025-03-04 02:20:03,773 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 105 selfloop transitions, 35 changer transitions 11/154 dead transitions. [2025-03-04 02:20:03,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 154 transitions, 1390 flow [2025-03-04 02:20:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:20:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:20:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2025-03-04 02:20:03,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4004524886877828 [2025-03-04 02:20:03,775 INFO L175 Difference]: Start difference. First operand has 113 places, 91 transitions, 821 flow. Second operand 13 states and 177 transitions. [2025-03-04 02:20:03,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 154 transitions, 1390 flow [2025-03-04 02:20:03,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 154 transitions, 1315 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-03-04 02:20:03,785 INFO L231 Difference]: Finished difference. Result has 114 places, 90 transitions, 820 flow [2025-03-04 02:20:03,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=820, PETRI_PLACES=114, PETRI_TRANSITIONS=90} [2025-03-04 02:20:03,786 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2025-03-04 02:20:03,786 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 820 flow [2025-03-04 02:20:03,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:03,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:03,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:03,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:03,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:03,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:03,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash -841204085, now seen corresponding path program 6 times [2025-03-04 02:20:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:03,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22496336] [2025-03-04 02:20:03,991 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:03,995 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:04,001 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 02:20:04,004 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:04,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:04,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22496336] [2025-03-04 02:20:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22496336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:20:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074289433] [2025-03-04 02:20:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:20:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:04,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:20:04,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:20:04,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:04,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 820 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:04,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:04,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:04,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:04,557 INFO L124 PetriNetUnfolderBase]: 548/1043 cut-off events. [2025-03-04 02:20:04,557 INFO L125 PetriNetUnfolderBase]: For 3735/3741 co-relation queries the response was YES. [2025-03-04 02:20:04,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 1043 events. 548/1043 cut-off events. For 3735/3741 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5340 event pairs, 121 based on Foata normal form. 5/1045 useless extension candidates. Maximal degree in co-relation 4203. Up to 450 conditions per place. [2025-03-04 02:20:04,562 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 89 selfloop transitions, 32 changer transitions 15/139 dead transitions. [2025-03-04 02:20:04,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 139 transitions, 1290 flow [2025-03-04 02:20:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:20:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:20:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 160 transitions. [2025-03-04 02:20:04,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36199095022624433 [2025-03-04 02:20:04,563 INFO L175 Difference]: Start difference. First operand has 114 places, 90 transitions, 820 flow. Second operand 13 states and 160 transitions. [2025-03-04 02:20:04,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 139 transitions, 1290 flow [2025-03-04 02:20:04,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 139 transitions, 1229 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:04,576 INFO L231 Difference]: Finished difference. Result has 117 places, 88 transitions, 811 flow [2025-03-04 02:20:04,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=811, PETRI_PLACES=117, PETRI_TRANSITIONS=88} [2025-03-04 02:20:04,577 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 87 predicate places. [2025-03-04 02:20:04,577 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 88 transitions, 811 flow [2025-03-04 02:20:04,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:04,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:04,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:20:04,578 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1105301812, now seen corresponding path program 4 times [2025-03-04 02:20:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453458322] [2025-03-04 02:20:04,578 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:04,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:04,589 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:04,590 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:04,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:04,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453458322] [2025-03-04 02:20:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453458322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654206181] [2025-03-04 02:20:04,747 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:04,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:04,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:04,749 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-03-04 02:20:04,752 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-03-04 02:20:04,793 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:04,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:04,808 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:04,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:04,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:20:04,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:05,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654206181] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:05,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 10] total 26 [2025-03-04 02:20:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714726617] [2025-03-04 02:20:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:05,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:05,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:05,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:20:05,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-03-04 02:20:05,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 88 transitions, 811 flow. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:05,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:05,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-03-04 02:20:05,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:05,827 INFO L124 PetriNetUnfolderBase]: 849/1565 cut-off events. [2025-03-04 02:20:05,828 INFO L125 PetriNetUnfolderBase]: For 5410/5414 co-relation queries the response was YES. [2025-03-04 02:20:05,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6331 conditions, 1565 events. 849/1565 cut-off events. For 5410/5414 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8496 event pairs, 133 based on Foata normal form. 6/1569 useless extension candidates. Maximal degree in co-relation 6265. Up to 257 conditions per place. [2025-03-04 02:20:05,835 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 148 selfloop transitions, 57 changer transitions 12/219 dead transitions. [2025-03-04 02:20:05,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 219 transitions, 2046 flow [2025-03-04 02:20:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:20:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:20:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 218 transitions. [2025-03-04 02:20:05,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42745098039215684 [2025-03-04 02:20:05,836 INFO L175 Difference]: Start difference. First operand has 117 places, 88 transitions, 811 flow. Second operand 15 states and 218 transitions. [2025-03-04 02:20:05,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 219 transitions, 2046 flow [2025-03-04 02:20:05,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 219 transitions, 1960 flow, removed 7 selfloop flow, removed 12 redundant places. [2025-03-04 02:20:05,849 INFO L231 Difference]: Finished difference. Result has 123 places, 106 transitions, 1146 flow [2025-03-04 02:20:05,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1146, PETRI_PLACES=123, PETRI_TRANSITIONS=106} [2025-03-04 02:20:05,849 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2025-03-04 02:20:05,849 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 106 transitions, 1146 flow [2025-03-04 02:20:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:05,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:05,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:05,856 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-03-04 02:20:06,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:20:06,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1747793310, now seen corresponding path program 5 times [2025-03-04 02:20:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:06,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124998840] [2025-03-04 02:20:06,052 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:06,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:06,057 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:06,063 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:06,064 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:06,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124998840] [2025-03-04 02:20:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124998840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950306876] [2025-03-04 02:20:06,184 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:06,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:06,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:06,185 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-03-04 02:20:06,187 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-03-04 02:20:06,225 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:06,241 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:20:06,241 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:06,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:06,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:20:06,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:06,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950306876] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 22 [2025-03-04 02:20:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623130960] [2025-03-04 02:20:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:06,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:06,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:06,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:20:06,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:06,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 106 transitions, 1146 flow. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:06,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:06,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:06,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:07,304 INFO L124 PetriNetUnfolderBase]: 715/1362 cut-off events. [2025-03-04 02:20:07,305 INFO L125 PetriNetUnfolderBase]: For 6992/7014 co-relation queries the response was YES. [2025-03-04 02:20:07,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6175 conditions, 1362 events. 715/1362 cut-off events. For 6992/7014 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7414 event pairs, 150 based on Foata normal form. 5/1364 useless extension candidates. Maximal degree in co-relation 6105. Up to 683 conditions per place. [2025-03-04 02:20:07,312 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 109 selfloop transitions, 34 changer transitions 18/166 dead transitions. [2025-03-04 02:20:07,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 166 transitions, 1843 flow [2025-03-04 02:20:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:20:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:20:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2025-03-04 02:20:07,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3914027149321267 [2025-03-04 02:20:07,313 INFO L175 Difference]: Start difference. First operand has 123 places, 106 transitions, 1146 flow. Second operand 13 states and 173 transitions. [2025-03-04 02:20:07,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 166 transitions, 1843 flow [2025-03-04 02:20:07,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 166 transitions, 1654 flow, removed 48 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:07,331 INFO L231 Difference]: Finished difference. Result has 128 places, 100 transitions, 961 flow [2025-03-04 02:20:07,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=961, PETRI_PLACES=128, PETRI_TRANSITIONS=100} [2025-03-04 02:20:07,332 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2025-03-04 02:20:07,332 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 100 transitions, 961 flow [2025-03-04 02:20:07,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:07,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:07,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:07,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:20:07,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:20:07,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:07,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1418893820, now seen corresponding path program 6 times [2025-03-04 02:20:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345110052] [2025-03-04 02:20:07,535 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:07,539 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:20:07,543 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 02:20:07,543 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:07,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:07,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:07,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345110052] [2025-03-04 02:20:07,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345110052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:07,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:07,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:07,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43980132] [2025-03-04 02:20:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:07,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:20:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:07,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:20:07,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:20:07,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:07,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 100 transitions, 961 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:07,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:07,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:07,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:07,982 INFO L124 PetriNetUnfolderBase]: 686/1295 cut-off events. [2025-03-04 02:20:07,982 INFO L125 PetriNetUnfolderBase]: For 5398/5416 co-relation queries the response was YES. [2025-03-04 02:20:07,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5543 conditions, 1295 events. 686/1295 cut-off events. For 5398/5416 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6905 event pairs, 140 based on Foata normal form. 1/1293 useless extension candidates. Maximal degree in co-relation 5477. Up to 683 conditions per place. [2025-03-04 02:20:07,989 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 104 selfloop transitions, 32 changer transitions 12/153 dead transitions. [2025-03-04 02:20:07,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 153 transitions, 1567 flow [2025-03-04 02:20:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 159 transitions. [2025-03-04 02:20:07,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3897058823529412 [2025-03-04 02:20:07,990 INFO L175 Difference]: Start difference. First operand has 128 places, 100 transitions, 961 flow. Second operand 12 states and 159 transitions. [2025-03-04 02:20:07,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 153 transitions, 1567 flow [2025-03-04 02:20:08,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 153 transitions, 1470 flow, removed 15 selfloop flow, removed 12 redundant places. [2025-03-04 02:20:08,003 INFO L231 Difference]: Finished difference. Result has 123 places, 95 transitions, 890 flow [2025-03-04 02:20:08,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=890, PETRI_PLACES=123, PETRI_TRANSITIONS=95} [2025-03-04 02:20:08,003 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2025-03-04 02:20:08,003 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 95 transitions, 890 flow [2025-03-04 02:20:08,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:08,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:08,004 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-03-04 02:20:08,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:20:08,004 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:08,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1460550903, now seen corresponding path program 1 times [2025-03-04 02:20:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541081735] [2025-03-04 02:20:08,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:08,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:20:08,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:20:08,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:08,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:08,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541081735] [2025-03-04 02:20:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541081735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033068539] [2025-03-04 02:20:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:08,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:08,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:08,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:08,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:08,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 95 transitions, 890 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:08,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:08,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:08,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:08,186 INFO L124 PetriNetUnfolderBase]: 548/1032 cut-off events. [2025-03-04 02:20:08,187 INFO L125 PetriNetUnfolderBase]: For 3896/3906 co-relation queries the response was YES. [2025-03-04 02:20:08,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 1032 events. 548/1032 cut-off events. For 3896/3906 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5200 event pairs, 333 based on Foata normal form. 12/1040 useless extension candidates. Maximal degree in co-relation 4205. Up to 898 conditions per place. [2025-03-04 02:20:08,191 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 73 selfloop transitions, 2 changer transitions 23/103 dead transitions. [2025-03-04 02:20:08,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 103 transitions, 1056 flow [2025-03-04 02:20:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2025-03-04 02:20:08,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3872549019607843 [2025-03-04 02:20:08,193 INFO L175 Difference]: Start difference. First operand has 123 places, 95 transitions, 890 flow. Second operand 6 states and 79 transitions. [2025-03-04 02:20:08,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 103 transitions, 1056 flow [2025-03-04 02:20:08,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 103 transitions, 962 flow, removed 12 selfloop flow, removed 17 redundant places. [2025-03-04 02:20:08,201 INFO L231 Difference]: Finished difference. Result has 102 places, 80 transitions, 636 flow [2025-03-04 02:20:08,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=102, PETRI_TRANSITIONS=80} [2025-03-04 02:20:08,202 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2025-03-04 02:20:08,202 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 80 transitions, 636 flow [2025-03-04 02:20:08,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:08,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:08,202 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-03-04 02:20:08,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 02:20:08,203 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:08,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash -861854821, now seen corresponding path program 1 times [2025-03-04 02:20:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:08,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419425378] [2025-03-04 02:20:08,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:08,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:20:08,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:20:08,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:08,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419425378] [2025-03-04 02:20:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419425378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955231106] [2025-03-04 02:20:08,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:08,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:08,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:08,286 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-03-04 02:20:08,287 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-03-04 02:20:08,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:20:08,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:20:08,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:08,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:08,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:20:08,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:08,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955231106] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:08,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:08,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-04 02:20:08,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066134493] [2025-03-04 02:20:08,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:08,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:08,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:08,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:08,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:20:08,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-03-04 02:20:08,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 80 transitions, 636 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:08,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:08,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-03-04 02:20:08,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:08,625 INFO L124 PetriNetUnfolderBase]: 641/1125 cut-off events. [2025-03-04 02:20:08,625 INFO L125 PetriNetUnfolderBase]: For 2892/2909 co-relation queries the response was YES. [2025-03-04 02:20:08,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4407 conditions, 1125 events. 641/1125 cut-off events. For 2892/2909 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5333 event pairs, 295 based on Foata normal form. 32/1153 useless extension candidates. Maximal degree in co-relation 4366. Up to 487 conditions per place. [2025-03-04 02:20:08,630 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 107 selfloop transitions, 13 changer transitions 1/125 dead transitions. [2025-03-04 02:20:08,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 125 transitions, 1159 flow [2025-03-04 02:20:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:20:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:20:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-03-04 02:20:08,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2025-03-04 02:20:08,632 INFO L175 Difference]: Start difference. First operand has 102 places, 80 transitions, 636 flow. Second operand 8 states and 99 transitions. [2025-03-04 02:20:08,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 125 transitions, 1159 flow [2025-03-04 02:20:08,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 125 transitions, 1057 flow, removed 24 selfloop flow, removed 11 redundant places. [2025-03-04 02:20:08,640 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 634 flow [2025-03-04 02:20:08,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=634, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2025-03-04 02:20:08,640 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2025-03-04 02:20:08,640 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 634 flow [2025-03-04 02:20:08,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:08,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:08,641 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-03-04 02:20:08,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:08,845 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1193489489, now seen corresponding path program 1 times [2025-03-04 02:20:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321831649] [2025-03-04 02:20:08,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:08,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:20:08,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:20:08,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:08,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:08,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321831649] [2025-03-04 02:20:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321831649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:08,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508073839] [2025-03-04 02:20:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:08,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:08,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:08,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:08,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 634 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:08,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:08,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:08,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:08,990 INFO L124 PetriNetUnfolderBase]: 456/875 cut-off events. [2025-03-04 02:20:08,990 INFO L125 PetriNetUnfolderBase]: For 2271/2290 co-relation queries the response was YES. [2025-03-04 02:20:08,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 875 events. 456/875 cut-off events. For 2271/2290 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4271 event pairs, 295 based on Foata normal form. 25/896 useless extension candidates. Maximal degree in co-relation 3512. Up to 673 conditions per place. [2025-03-04 02:20:08,994 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 49 selfloop transitions, 2 changer transitions 28/84 dead transitions. [2025-03-04 02:20:08,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 84 transitions, 734 flow [2025-03-04 02:20:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-03-04 02:20:08,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4176470588235294 [2025-03-04 02:20:08,995 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 634 flow. Second operand 5 states and 71 transitions. [2025-03-04 02:20:08,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 84 transitions, 734 flow [2025-03-04 02:20:08,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 714 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:09,000 INFO L231 Difference]: Finished difference. Result has 85 places, 56 transitions, 382 flow [2025-03-04 02:20:09,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=85, PETRI_TRANSITIONS=56} [2025-03-04 02:20:09,000 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2025-03-04 02:20:09,000 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 56 transitions, 382 flow [2025-03-04 02:20:09,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:09,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:09,000 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-03-04 02:20:09,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 02:20:09,002 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:09,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash -879196581, now seen corresponding path program 1 times [2025-03-04 02:20:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911570518] [2025-03-04 02:20:09,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:09,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:20:09,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:20:09,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:09,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:09,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:09,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911570518] [2025-03-04 02:20:09,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911570518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:09,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223622104] [2025-03-04 02:20:09,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:09,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:09,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:09,077 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-03-04 02:20:09,078 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-03-04 02:20:09,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:20:09,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:20:09,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:09,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:09,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:20:09,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:09,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:09,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223622104] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:09,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:09,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-04 02:20:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602384563] [2025-03-04 02:20:09,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:09,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:09,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:09,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:20:09,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-03-04 02:20:09,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 56 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:09,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:09,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-03-04 02:20:09,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:09,334 INFO L124 PetriNetUnfolderBase]: 329/570 cut-off events. [2025-03-04 02:20:09,334 INFO L125 PetriNetUnfolderBase]: For 1443/1451 co-relation queries the response was YES. [2025-03-04 02:20:09,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2410 conditions, 570 events. 329/570 cut-off events. For 1443/1451 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2125 event pairs, 161 based on Foata normal form. 18/585 useless extension candidates. Maximal degree in co-relation 2385. Up to 392 conditions per place. [2025-03-04 02:20:09,336 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 47 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2025-03-04 02:20:09,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 61 transitions, 518 flow [2025-03-04 02:20:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2025-03-04 02:20:09,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2025-03-04 02:20:09,337 INFO L175 Difference]: Start difference. First operand has 85 places, 56 transitions, 382 flow. Second operand 7 states and 70 transitions. [2025-03-04 02:20:09,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 61 transitions, 518 flow [2025-03-04 02:20:09,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 476 flow, removed 14 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:09,339 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 331 flow [2025-03-04 02:20:09,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=331, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2025-03-04 02:20:09,340 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2025-03-04 02:20:09,340 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 331 flow [2025-03-04 02:20:09,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:09,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:09,340 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-03-04 02:20:09,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:20:09,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 02:20:09,540 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:09,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash 391262306, now seen corresponding path program 1 times [2025-03-04 02:20:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119632377] [2025-03-04 02:20:09,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:09,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:20:09,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:09,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:09,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:10,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119632377] [2025-03-04 02:20:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119632377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984478522] [2025-03-04 02:20:10,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:10,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:10,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:20:10,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:20:10,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:10,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:10,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:10,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 02:20:10,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:10,597 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:20:10,598 INFO L378 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 83 treesize of output 52 [2025-03-04 02:20:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:10,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:11,002 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:20:11,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 63 [2025-03-04 02:20:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:11,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984478522] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:11,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:11,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 13] total 33 [2025-03-04 02:20:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466285262] [2025-03-04 02:20:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:11,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:11,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:11,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 02:20:11,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:11,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 331 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:11,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:11,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:11,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:11,787 INFO L124 PetriNetUnfolderBase]: 483/840 cut-off events. [2025-03-04 02:20:11,787 INFO L125 PetriNetUnfolderBase]: For 1644/1674 co-relation queries the response was YES. [2025-03-04 02:20:11,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3402 conditions, 840 events. 483/840 cut-off events. For 1644/1674 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3670 event pairs, 65 based on Foata normal form. 5/840 useless extension candidates. Maximal degree in co-relation 3384. Up to 337 conditions per place. [2025-03-04 02:20:11,791 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 101 selfloop transitions, 32 changer transitions 10/146 dead transitions. [2025-03-04 02:20:11,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 1116 flow [2025-03-04 02:20:11,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:20:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:20:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2025-03-04 02:20:11,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-03-04 02:20:11,793 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 331 flow. Second operand 14 states and 196 transitions. [2025-03-04 02:20:11,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 1116 flow [2025-03-04 02:20:11,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 146 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:11,797 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 610 flow [2025-03-04 02:20:11,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=610, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2025-03-04 02:20:11,798 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2025-03-04 02:20:11,798 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 610 flow [2025-03-04 02:20:11,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:11,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:11,798 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-03-04 02:20:11,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:12,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:12,002 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:12,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1163734736, now seen corresponding path program 2 times [2025-03-04 02:20:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4069489] [2025-03-04 02:20:12,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:12,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:12,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 02:20:12,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:12,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4069489] [2025-03-04 02:20:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4069489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:12,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:12,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:20:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415142965] [2025-03-04 02:20:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:12,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:12,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:12,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:12,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:12,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:12,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 610 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:12,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:12,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:12,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:12,707 INFO L124 PetriNetUnfolderBase]: 547/957 cut-off events. [2025-03-04 02:20:12,707 INFO L125 PetriNetUnfolderBase]: For 4114/4133 co-relation queries the response was YES. [2025-03-04 02:20:12,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 957 events. 547/957 cut-off events. For 4114/4133 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4341 event pairs, 243 based on Foata normal form. 1/955 useless extension candidates. Maximal degree in co-relation 4613. Up to 658 conditions per place. [2025-03-04 02:20:12,714 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 77 selfloop transitions, 29 changer transitions 17/126 dead transitions. [2025-03-04 02:20:12,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 126 transitions, 1350 flow [2025-03-04 02:20:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:20:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:20:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2025-03-04 02:20:12,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33031674208144796 [2025-03-04 02:20:12,716 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 610 flow. Second operand 13 states and 146 transitions. [2025-03-04 02:20:12,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 126 transitions, 1350 flow [2025-03-04 02:20:12,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 1264 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:12,729 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 914 flow [2025-03-04 02:20:12,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=914, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2025-03-04 02:20:12,731 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-03-04 02:20:12,731 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 914 flow [2025-03-04 02:20:12,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:12,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:12,731 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-03-04 02:20:12,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 02:20:12,732 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1285375142, now seen corresponding path program 3 times [2025-03-04 02:20:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77342782] [2025-03-04 02:20:12,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:12,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:12,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 02:20:12,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:12,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:13,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77342782] [2025-03-04 02:20:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77342782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:13,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:13,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:20:13,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740529531] [2025-03-04 02:20:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:13,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:13,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:13,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:13,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:13,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 914 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:13,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:13,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:13,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:13,530 INFO L124 PetriNetUnfolderBase]: 532/928 cut-off events. [2025-03-04 02:20:13,530 INFO L125 PetriNetUnfolderBase]: For 4481/4507 co-relation queries the response was YES. [2025-03-04 02:20:13,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 928 events. 532/928 cut-off events. For 4481/4507 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4214 event pairs, 180 based on Foata normal form. 5/931 useless extension candidates. Maximal degree in co-relation 4684. Up to 460 conditions per place. [2025-03-04 02:20:13,533 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 109 selfloop transitions, 27 changer transitions 18/157 dead transitions. [2025-03-04 02:20:13,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 157 transitions, 1681 flow [2025-03-04 02:20:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:20:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:20:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 171 transitions. [2025-03-04 02:20:13,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3592436974789916 [2025-03-04 02:20:13,534 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 914 flow. Second operand 14 states and 171 transitions. [2025-03-04 02:20:13,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 157 transitions, 1681 flow [2025-03-04 02:20:13,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 157 transitions, 1546 flow, removed 66 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:13,543 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 863 flow [2025-03-04 02:20:13,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=863, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2025-03-04 02:20:13,544 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2025-03-04 02:20:13,544 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 863 flow [2025-03-04 02:20:13,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:13,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:13,544 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-03-04 02:20:13,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 02:20:13,544 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:13,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1620554356, now seen corresponding path program 4 times [2025-03-04 02:20:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:13,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993895847] [2025-03-04 02:20:13,544 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:13,550 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:13,557 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:13,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:13,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:13,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:13,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993895847] [2025-03-04 02:20:13,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993895847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:13,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:13,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:13,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426595073] [2025-03-04 02:20:13,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:13,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:13,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:13,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:13,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:20:13,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:13,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 863 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:13,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:13,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:13,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:14,265 INFO L124 PetriNetUnfolderBase]: 532/938 cut-off events. [2025-03-04 02:20:14,265 INFO L125 PetriNetUnfolderBase]: For 4424/4443 co-relation queries the response was YES. [2025-03-04 02:20:14,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 938 events. 532/938 cut-off events. For 4424/4443 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4291 event pairs, 234 based on Foata normal form. 1/937 useless extension candidates. Maximal degree in co-relation 4707. Up to 637 conditions per place. [2025-03-04 02:20:14,269 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 78 selfloop transitions, 30 changer transitions 17/128 dead transitions. [2025-03-04 02:20:14,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 1406 flow [2025-03-04 02:20:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2025-03-04 02:20:14,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3553921568627451 [2025-03-04 02:20:14,270 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 863 flow. Second operand 12 states and 145 transitions. [2025-03-04 02:20:14,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 1406 flow [2025-03-04 02:20:14,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 128 transitions, 1320 flow, removed 11 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:14,279 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 955 flow [2025-03-04 02:20:14,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=955, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2025-03-04 02:20:14,279 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2025-03-04 02:20:14,279 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 955 flow [2025-03-04 02:20:14,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:14,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:14,280 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-03-04 02:20:14,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 02:20:14,280 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:14,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1179248294, now seen corresponding path program 5 times [2025-03-04 02:20:14,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:14,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735309065] [2025-03-04 02:20:14,280 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:14,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:14,285 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:14,297 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:14,297 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:14,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735309065] [2025-03-04 02:20:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735309065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352844276] [2025-03-04 02:20:14,815 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:14,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:14,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:14,817 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:14,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:20:14,863 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:14,886 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:14,887 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:14,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:14,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 02:20:14,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:15,228 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:20:15,228 INFO L378 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 83 treesize of output 47 [2025-03-04 02:20:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:15,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:15,603 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:20:15,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 63 [2025-03-04 02:20:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352844276] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:15,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:15,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 13] total 32 [2025-03-04 02:20:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145468810] [2025-03-04 02:20:15,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:15,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:15,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:15,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:15,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-04 02:20:15,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:15,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 955 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:15,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:15,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:15,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:16,419 INFO L124 PetriNetUnfolderBase]: 563/972 cut-off events. [2025-03-04 02:20:16,419 INFO L125 PetriNetUnfolderBase]: For 5220/5258 co-relation queries the response was YES. [2025-03-04 02:20:16,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5222 conditions, 972 events. 563/972 cut-off events. For 5220/5258 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4374 event pairs, 76 based on Foata normal form. 9/978 useless extension candidates. Maximal degree in co-relation 5184. Up to 563 conditions per place. [2025-03-04 02:20:16,424 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 101 selfloop transitions, 54 changer transitions 6/164 dead transitions. [2025-03-04 02:20:16,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 164 transitions, 1913 flow [2025-03-04 02:20:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:20:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:20:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 181 transitions. [2025-03-04 02:20:16,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3802521008403361 [2025-03-04 02:20:16,425 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 955 flow. Second operand 14 states and 181 transitions. [2025-03-04 02:20:16,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 164 transitions, 1913 flow [2025-03-04 02:20:16,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 164 transitions, 1827 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:16,437 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 1370 flow [2025-03-04 02:20:16,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1370, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2025-03-04 02:20:16,437 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2025-03-04 02:20:16,437 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 1370 flow [2025-03-04 02:20:16,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:16,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:16,438 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-03-04 02:20:16,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:16,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 02:20:16,638 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1864008420, now seen corresponding path program 6 times [2025-03-04 02:20:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:16,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383419785] [2025-03-04 02:20:16,643 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:16,651 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:16,670 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 02:20:16,670 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:16,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:16,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383419785] [2025-03-04 02:20:16,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383419785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:16,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:16,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:20:16,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707741476] [2025-03-04 02:20:16,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:16,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:16,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:16,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:16,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 1370 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:16,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:16,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:16,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:17,380 INFO L124 PetriNetUnfolderBase]: 571/1003 cut-off events. [2025-03-04 02:20:17,380 INFO L125 PetriNetUnfolderBase]: For 5274/5295 co-relation queries the response was YES. [2025-03-04 02:20:17,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 1003 events. 571/1003 cut-off events. For 5274/5295 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4663 event pairs, 242 based on Foata normal form. 1/1001 useless extension candidates. Maximal degree in co-relation 5426. Up to 671 conditions per place. [2025-03-04 02:20:17,385 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 78 selfloop transitions, 41 changer transitions 19/141 dead transitions. [2025-03-04 02:20:17,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 141 transitions, 1856 flow [2025-03-04 02:20:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2025-03-04 02:20:17,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-03-04 02:20:17,387 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 1370 flow. Second operand 12 states and 136 transitions. [2025-03-04 02:20:17,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 141 transitions, 1856 flow [2025-03-04 02:20:17,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 141 transitions, 1760 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:17,402 INFO L231 Difference]: Finished difference. Result has 126 places, 104 transitions, 1314 flow [2025-03-04 02:20:17,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1314, PETRI_PLACES=126, PETRI_TRANSITIONS=104} [2025-03-04 02:20:17,402 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2025-03-04 02:20:17,402 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 104 transitions, 1314 flow [2025-03-04 02:20:17,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:17,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:17,402 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-03-04 02:20:17,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 02:20:17,402 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:17,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:17,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1671403286, now seen corresponding path program 7 times [2025-03-04 02:20:17,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352144911] [2025-03-04 02:20:17,403 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:17,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:17,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:20:17,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:17,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:17,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352144911] [2025-03-04 02:20:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352144911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135764310] [2025-03-04 02:20:17,844 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:17,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:17,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:17,846 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:17,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:20:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:20:17,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:17,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:17,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:17,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:20:17,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:18,116 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:20:18,116 INFO L378 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 83 treesize of output 52 [2025-03-04 02:20:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:18,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:18,532 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:18,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 71 [2025-03-04 02:20:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135764310] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:18,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:18,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 12] total 32 [2025-03-04 02:20:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805439774] [2025-03-04 02:20:18,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:18,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:18,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:18,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-04 02:20:18,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:18,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 104 transitions, 1314 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:18,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:18,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:18,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:19,430 INFO L124 PetriNetUnfolderBase]: 687/1189 cut-off events. [2025-03-04 02:20:19,430 INFO L125 PetriNetUnfolderBase]: For 7206/7247 co-relation queries the response was YES. [2025-03-04 02:20:19,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6627 conditions, 1189 events. 687/1189 cut-off events. For 7206/7247 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5565 event pairs, 88 based on Foata normal form. 5/1194 useless extension candidates. Maximal degree in co-relation 6581. Up to 573 conditions per place. [2025-03-04 02:20:19,436 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 114 selfloop transitions, 73 changer transitions 10/200 dead transitions. [2025-03-04 02:20:19,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 200 transitions, 2480 flow [2025-03-04 02:20:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:20:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:20:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 210 transitions. [2025-03-04 02:20:19,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3633217993079585 [2025-03-04 02:20:19,438 INFO L175 Difference]: Start difference. First operand has 126 places, 104 transitions, 1314 flow. Second operand 17 states and 210 transitions. [2025-03-04 02:20:19,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 200 transitions, 2480 flow [2025-03-04 02:20:19,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 200 transitions, 2420 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:19,454 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 2000 flow [2025-03-04 02:20:19,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2000, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2025-03-04 02:20:19,455 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2025-03-04 02:20:19,455 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 2000 flow [2025-03-04 02:20:19,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:19,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:19,455 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-03-04 02:20:19,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 02:20:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 02:20:19,659 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1755043334, now seen corresponding path program 8 times [2025-03-04 02:20:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561113089] [2025-03-04 02:20:19,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:19,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:19,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 02:20:19,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:19,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:19,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561113089] [2025-03-04 02:20:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561113089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:20:19,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147458575] [2025-03-04 02:20:19,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:19,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:19,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:19,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 2000 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:19,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:19,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:19,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:20,376 INFO L124 PetriNetUnfolderBase]: 745/1287 cut-off events. [2025-03-04 02:20:20,376 INFO L125 PetriNetUnfolderBase]: For 10222/10259 co-relation queries the response was YES. [2025-03-04 02:20:20,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7917 conditions, 1287 events. 745/1287 cut-off events. For 10222/10259 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6182 event pairs, 238 based on Foata normal form. 1/1287 useless extension candidates. Maximal degree in co-relation 7864. Up to 798 conditions per place. [2025-03-04 02:20:20,384 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 139 selfloop transitions, 62 changer transitions 10/214 dead transitions. [2025-03-04 02:20:20,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 214 transitions, 3249 flow [2025-03-04 02:20:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:20:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:20:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 148 transitions. [2025-03-04 02:20:20,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.334841628959276 [2025-03-04 02:20:20,385 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 2000 flow. Second operand 13 states and 148 transitions. [2025-03-04 02:20:20,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 214 transitions, 3249 flow [2025-03-04 02:20:20,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 214 transitions, 2910 flow, removed 148 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:20,411 INFO L231 Difference]: Finished difference. Result has 153 places, 161 transitions, 2293 flow [2025-03-04 02:20:20,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2293, PETRI_PLACES=153, PETRI_TRANSITIONS=161} [2025-03-04 02:20:20,412 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2025-03-04 02:20:20,412 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 161 transitions, 2293 flow [2025-03-04 02:20:20,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:20,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:20,412 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-03-04 02:20:20,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 02:20:20,413 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:20,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1938360036, now seen corresponding path program 9 times [2025-03-04 02:20:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:20,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892154983] [2025-03-04 02:20:20,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:20,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:20,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 02:20:20,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:20,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:20,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892154983] [2025-03-04 02:20:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892154983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:20,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:20,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:20:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319313332] [2025-03-04 02:20:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:20,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:20,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:20,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:20,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:20,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 161 transitions, 2293 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:20,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:20,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:20,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:21,142 INFO L124 PetriNetUnfolderBase]: 775/1343 cut-off events. [2025-03-04 02:20:21,142 INFO L125 PetriNetUnfolderBase]: For 10238/10275 co-relation queries the response was YES. [2025-03-04 02:20:21,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8250 conditions, 1343 events. 775/1343 cut-off events. For 10238/10275 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6561 event pairs, 258 based on Foata normal form. 1/1344 useless extension candidates. Maximal degree in co-relation 8193. Up to 816 conditions per place. [2025-03-04 02:20:21,149 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 116 selfloop transitions, 70 changer transitions 20/209 dead transitions. [2025-03-04 02:20:21,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 209 transitions, 3137 flow [2025-03-04 02:20:21,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:20:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:20:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2025-03-04 02:20:21,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2025-03-04 02:20:21,150 INFO L175 Difference]: Start difference. First operand has 153 places, 161 transitions, 2293 flow. Second operand 13 states and 143 transitions. [2025-03-04 02:20:21,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 209 transitions, 3137 flow [2025-03-04 02:20:21,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 209 transitions, 3066 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:21,178 INFO L231 Difference]: Finished difference. Result has 162 places, 167 transitions, 2511 flow [2025-03-04 02:20:21,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2511, PETRI_PLACES=162, PETRI_TRANSITIONS=167} [2025-03-04 02:20:21,179 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2025-03-04 02:20:21,179 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 167 transitions, 2511 flow [2025-03-04 02:20:21,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:21,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:21,179 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-03-04 02:20:21,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 02:20:21,179 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:21,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1907702880, now seen corresponding path program 10 times [2025-03-04 02:20:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:21,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158353472] [2025-03-04 02:20:21,179 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:21,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:21,190 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:21,190 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:21,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158353472] [2025-03-04 02:20:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158353472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293416496] [2025-03-04 02:20:21,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:21,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:21,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:21,514 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:21,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:20:21,558 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:21,576 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:21,576 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:20:21,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:21,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:20:21,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:21,876 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:20:21,876 INFO L378 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 83 treesize of output 52 [2025-03-04 02:20:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:21,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:22,231 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:20:22,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 82 [2025-03-04 02:20:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293416496] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:22,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 13] total 32 [2025-03-04 02:20:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720070508] [2025-03-04 02:20:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:22,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:22,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-03-04 02:20:22,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:22,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 167 transitions, 2511 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:22,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:22,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:22,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:23,260 INFO L124 PetriNetUnfolderBase]: 829/1463 cut-off events. [2025-03-04 02:20:23,260 INFO L125 PetriNetUnfolderBase]: For 12170/12215 co-relation queries the response was YES. [2025-03-04 02:20:23,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8767 conditions, 1463 events. 829/1463 cut-off events. For 12170/12215 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7417 event pairs, 112 based on Foata normal form. 5/1468 useless extension candidates. Maximal degree in co-relation 8708. Up to 514 conditions per place. [2025-03-04 02:20:23,269 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 135 selfloop transitions, 90 changer transitions 9/237 dead transitions. [2025-03-04 02:20:23,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 237 transitions, 3507 flow [2025-03-04 02:20:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:20:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:20:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 191 transitions. [2025-03-04 02:20:23,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35110294117647056 [2025-03-04 02:20:23,270 INFO L175 Difference]: Start difference. First operand has 162 places, 167 transitions, 2511 flow. Second operand 16 states and 191 transitions. [2025-03-04 02:20:23,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 237 transitions, 3507 flow [2025-03-04 02:20:23,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 237 transitions, 3391 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:23,301 INFO L231 Difference]: Finished difference. Result has 175 places, 175 transitions, 2800 flow [2025-03-04 02:20:23,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2800, PETRI_PLACES=175, PETRI_TRANSITIONS=175} [2025-03-04 02:20:23,302 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2025-03-04 02:20:23,302 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 175 transitions, 2800 flow [2025-03-04 02:20:23,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:23,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:23,302 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-03-04 02:20:23,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:23,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:23,502 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:23,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1710487594, now seen corresponding path program 11 times [2025-03-04 02:20:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481624697] [2025-03-04 02:20:23,503 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:23,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:23,507 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:23,519 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:23,520 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:23,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481624697] [2025-03-04 02:20:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481624697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778215948] [2025-03-04 02:20:24,029 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:24,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:24,031 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:24,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:20:24,111 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:24,126 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:24,126 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:24,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 02:20:24,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:24,394 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:20:24,394 INFO L378 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 83 treesize of output 52 [2025-03-04 02:20:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:24,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:24,742 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:24,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 71 [2025-03-04 02:20:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778215948] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:24,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 13] total 33 [2025-03-04 02:20:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399125881] [2025-03-04 02:20:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:24,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:24,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:24,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 02:20:24,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:24,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 175 transitions, 2800 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:24,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:24,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:24,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:25,542 INFO L124 PetriNetUnfolderBase]: 816/1433 cut-off events. [2025-03-04 02:20:25,543 INFO L125 PetriNetUnfolderBase]: For 13208/13253 co-relation queries the response was YES. [2025-03-04 02:20:25,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8904 conditions, 1433 events. 816/1433 cut-off events. For 13208/13253 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7164 event pairs, 129 based on Foata normal form. 5/1437 useless extension candidates. Maximal degree in co-relation 8838. Up to 799 conditions per place. [2025-03-04 02:20:25,552 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 107 selfloop transitions, 100 changer transitions 8/218 dead transitions. [2025-03-04 02:20:25,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 218 transitions, 3439 flow [2025-03-04 02:20:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:20:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:20:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 178 transitions. [2025-03-04 02:20:25,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3739495798319328 [2025-03-04 02:20:25,553 INFO L175 Difference]: Start difference. First operand has 175 places, 175 transitions, 2800 flow. Second operand 14 states and 178 transitions. [2025-03-04 02:20:25,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 218 transitions, 3439 flow [2025-03-04 02:20:25,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 218 transitions, 3369 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:25,591 INFO L231 Difference]: Finished difference. Result has 183 places, 173 transitions, 2914 flow [2025-03-04 02:20:25,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2730, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2914, PETRI_PLACES=183, PETRI_TRANSITIONS=173} [2025-03-04 02:20:25,592 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2025-03-04 02:20:25,592 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 173 transitions, 2914 flow [2025-03-04 02:20:25,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:25,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:25,592 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-03-04 02:20:25,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:20:25,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 02:20:25,793 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:25,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash -433302274, now seen corresponding path program 12 times [2025-03-04 02:20:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:25,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215049153] [2025-03-04 02:20:25,794 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:25,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:25,799 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:25,806 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 02:20:25,807 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:25,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215049153] [2025-03-04 02:20:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215049153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:26,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:20:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131319578] [2025-03-04 02:20:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:26,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:26,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:26,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:26,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:26,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 173 transitions, 2914 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:26,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:26,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:26,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:26,465 INFO L124 PetriNetUnfolderBase]: 822/1450 cut-off events. [2025-03-04 02:20:26,465 INFO L125 PetriNetUnfolderBase]: For 13490/13531 co-relation queries the response was YES. [2025-03-04 02:20:26,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9174 conditions, 1450 events. 822/1450 cut-off events. For 13490/13531 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7364 event pairs, 227 based on Foata normal form. 1/1450 useless extension candidates. Maximal degree in co-relation 9108. Up to 669 conditions per place. [2025-03-04 02:20:26,474 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 153 selfloop transitions, 67 changer transitions 17/240 dead transitions. [2025-03-04 02:20:26,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 240 transitions, 3946 flow [2025-03-04 02:20:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:20:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:20:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 165 transitions. [2025-03-04 02:20:26,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34663865546218486 [2025-03-04 02:20:26,475 INFO L175 Difference]: Start difference. First operand has 183 places, 173 transitions, 2914 flow. Second operand 14 states and 165 transitions. [2025-03-04 02:20:26,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 240 transitions, 3946 flow [2025-03-04 02:20:26,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 240 transitions, 3741 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-03-04 02:20:26,515 INFO L231 Difference]: Finished difference. Result has 185 places, 170 transitions, 2824 flow [2025-03-04 02:20:26,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2725, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2824, PETRI_PLACES=185, PETRI_TRANSITIONS=170} [2025-03-04 02:20:26,516 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2025-03-04 02:20:26,516 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 170 transitions, 2824 flow [2025-03-04 02:20:26,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:26,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:26,516 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-03-04 02:20:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 02:20:26,516 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -76690588, now seen corresponding path program 13 times [2025-03-04 02:20:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322812954] [2025-03-04 02:20:26,516 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:26,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:20:26,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:26,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:26,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322812954] [2025-03-04 02:20:26,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322812954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:26,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084168772] [2025-03-04 02:20:26,966 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:26,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:26,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:26,968 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:26,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:20:27,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:20:27,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:20:27,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:27,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:27,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 02:20:27,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:27,213 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:20:27,214 INFO L378 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 83 treesize of output 52 [2025-03-04 02:20:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:20:27,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:27,699 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:27,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 71 [2025-03-04 02:20:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:27,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084168772] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:27,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:27,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 13] total 33 [2025-03-04 02:20:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498373517] [2025-03-04 02:20:27,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:27,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:20:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:27,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:20:27,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 02:20:27,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 170 transitions, 2824 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:27,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:27,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:27,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:28,470 INFO L124 PetriNetUnfolderBase]: 799/1399 cut-off events. [2025-03-04 02:20:28,470 INFO L125 PetriNetUnfolderBase]: For 13337/13382 co-relation queries the response was YES. [2025-03-04 02:20:28,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8910 conditions, 1399 events. 799/1399 cut-off events. For 13337/13382 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6951 event pairs, 119 based on Foata normal form. 5/1404 useless extension candidates. Maximal degree in co-relation 8842. Up to 783 conditions per place. [2025-03-04 02:20:28,485 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 105 selfloop transitions, 90 changer transitions 14/212 dead transitions. [2025-03-04 02:20:28,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 212 transitions, 3460 flow [2025-03-04 02:20:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:20:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:20:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 175 transitions. [2025-03-04 02:20:28,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-03-04 02:20:28,486 INFO L175 Difference]: Start difference. First operand has 185 places, 170 transitions, 2824 flow. Second operand 14 states and 175 transitions. [2025-03-04 02:20:28,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 212 transitions, 3460 flow [2025-03-04 02:20:28,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 212 transitions, 3345 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:28,536 INFO L231 Difference]: Finished difference. Result has 183 places, 164 transitions, 2791 flow [2025-03-04 02:20:28,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2715, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2791, PETRI_PLACES=183, PETRI_TRANSITIONS=164} [2025-03-04 02:20:28,536 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2025-03-04 02:20:28,536 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 164 transitions, 2791 flow [2025-03-04 02:20:28,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:28,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:28,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:28,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:28,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:28,737 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:28,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash 281615282, now seen corresponding path program 14 times [2025-03-04 02:20:28,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:28,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753817774] [2025-03-04 02:20:28,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:28,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:28,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 02:20:28,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:28,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:28,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753817774] [2025-03-04 02:20:28,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753817774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:28,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:28,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:20:28,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528139014] [2025-03-04 02:20:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:28,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:28,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:28,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:29,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:29,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 164 transitions, 2791 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:29,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:29,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:29,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:29,384 INFO L124 PetriNetUnfolderBase]: 785/1377 cut-off events. [2025-03-04 02:20:29,384 INFO L125 PetriNetUnfolderBase]: For 12724/12765 co-relation queries the response was YES. [2025-03-04 02:20:29,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8781 conditions, 1377 events. 785/1377 cut-off events. For 12724/12765 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6865 event pairs, 284 based on Foata normal form. 1/1377 useless extension candidates. Maximal degree in co-relation 8715. Up to 911 conditions per place. [2025-03-04 02:20:29,395 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 137 selfloop transitions, 57 changer transitions 12/209 dead transitions. [2025-03-04 02:20:29,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 209 transitions, 3562 flow [2025-03-04 02:20:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2025-03-04 02:20:29,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33578431372549017 [2025-03-04 02:20:29,396 INFO L175 Difference]: Start difference. First operand has 183 places, 164 transitions, 2791 flow. Second operand 12 states and 137 transitions. [2025-03-04 02:20:29,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 209 transitions, 3562 flow [2025-03-04 02:20:29,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 209 transitions, 3398 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:29,439 INFO L231 Difference]: Finished difference. Result has 179 places, 161 transitions, 2706 flow [2025-03-04 02:20:29,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2643, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2706, PETRI_PLACES=179, PETRI_TRANSITIONS=161} [2025-03-04 02:20:29,439 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2025-03-04 02:20:29,439 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 161 transitions, 2706 flow [2025-03-04 02:20:29,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:29,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:29,439 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-03-04 02:20:29,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 02:20:29,440 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:29,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash -258183734, now seen corresponding path program 15 times [2025-03-04 02:20:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:29,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580077885] [2025-03-04 02:20:29,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:29,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:29,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:20:29,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 02:20:29,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:29,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580077885] [2025-03-04 02:20:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580077885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:20:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662883562] [2025-03-04 02:20:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:29,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:20:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:29,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:20:29,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:20:29,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:29,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 161 transitions, 2706 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:29,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:29,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:29,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:30,165 INFO L124 PetriNetUnfolderBase]: 772/1344 cut-off events. [2025-03-04 02:20:30,165 INFO L125 PetriNetUnfolderBase]: For 12702/12743 co-relation queries the response was YES. [2025-03-04 02:20:30,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8647 conditions, 1344 events. 772/1344 cut-off events. For 12702/12743 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6566 event pairs, 286 based on Foata normal form. 1/1345 useless extension candidates. Maximal degree in co-relation 8581. Up to 875 conditions per place. [2025-03-04 02:20:30,174 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 123 selfloop transitions, 59 changer transitions 17/202 dead transitions. [2025-03-04 02:20:30,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 202 transitions, 3435 flow [2025-03-04 02:20:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:20:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:20:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2025-03-04 02:20:30,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33031674208144796 [2025-03-04 02:20:30,175 INFO L175 Difference]: Start difference. First operand has 179 places, 161 transitions, 2706 flow. Second operand 13 states and 146 transitions. [2025-03-04 02:20:30,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 202 transitions, 3435 flow [2025-03-04 02:20:30,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 202 transitions, 3330 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:30,210 INFO L231 Difference]: Finished difference. Result has 182 places, 162 transitions, 2787 flow [2025-03-04 02:20:30,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2787, PETRI_PLACES=182, PETRI_TRANSITIONS=162} [2025-03-04 02:20:30,211 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2025-03-04 02:20:30,211 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 162 transitions, 2787 flow [2025-03-04 02:20:30,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:30,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:30,211 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] [2025-03-04 02:20:30,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 02:20:30,211 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:30,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1630700602, now seen corresponding path program 1 times [2025-03-04 02:20:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:30,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199440594] [2025-03-04 02:20:30,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:30,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:30,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:30,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:30,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:30,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:30,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:30,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199440594] [2025-03-04 02:20:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199440594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:30,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:30,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254656482] [2025-03-04 02:20:30,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:30,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:30,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:30,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:30,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 162 transitions, 2787 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:30,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:30,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:30,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:30,747 INFO L124 PetriNetUnfolderBase]: 737/1280 cut-off events. [2025-03-04 02:20:30,747 INFO L125 PetriNetUnfolderBase]: For 12846/12892 co-relation queries the response was YES. [2025-03-04 02:20:30,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8290 conditions, 1280 events. 737/1280 cut-off events. For 12846/12892 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6233 event pairs, 233 based on Foata normal form. 16/1294 useless extension candidates. Maximal degree in co-relation 8222. Up to 704 conditions per place. [2025-03-04 02:20:30,754 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 133 selfloop transitions, 56 changer transitions 20/212 dead transitions. [2025-03-04 02:20:30,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 212 transitions, 3474 flow [2025-03-04 02:20:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2025-03-04 02:20:30,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2025-03-04 02:20:30,755 INFO L175 Difference]: Start difference. First operand has 182 places, 162 transitions, 2787 flow. Second operand 12 states and 148 transitions. [2025-03-04 02:20:30,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 212 transitions, 3474 flow [2025-03-04 02:20:30,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 212 transitions, 3331 flow, removed 25 selfloop flow, removed 9 redundant places. [2025-03-04 02:20:30,790 INFO L231 Difference]: Finished difference. Result has 182 places, 155 transitions, 2632 flow [2025-03-04 02:20:30,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2591, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2632, PETRI_PLACES=182, PETRI_TRANSITIONS=155} [2025-03-04 02:20:30,791 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2025-03-04 02:20:30,791 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 155 transitions, 2632 flow [2025-03-04 02:20:30,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:30,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:30,791 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] [2025-03-04 02:20:30,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 02:20:30,791 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1946684206, now seen corresponding path program 2 times [2025-03-04 02:20:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:30,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948854360] [2025-03-04 02:20:30,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:30,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:30,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:30,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:30,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948854360] [2025-03-04 02:20:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948854360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752563252] [2025-03-04 02:20:30,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:30,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:30,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:30,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:20:30,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:30,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:30,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:30,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:30,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:20:30,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:31,037 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:20:31,037 INFO L378 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 26 treesize of output 10 [2025-03-04 02:20:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:31,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:31,094 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:31,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:20:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:31,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752563252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:31,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:31,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-03-04 02:20:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002168145] [2025-03-04 02:20:31,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:31,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:20:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:31,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:20:31,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:20:31,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:31,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 155 transitions, 2632 flow. Second operand has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:31,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:31,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:31,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:31,432 INFO L124 PetriNetUnfolderBase]: 794/1355 cut-off events. [2025-03-04 02:20:31,432 INFO L125 PetriNetUnfolderBase]: For 13712/13762 co-relation queries the response was YES. [2025-03-04 02:20:31,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9030 conditions, 1355 events. 794/1355 cut-off events. For 13712/13762 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6519 event pairs, 289 based on Foata normal form. 10/1363 useless extension candidates. Maximal degree in co-relation 8965. Up to 896 conditions per place. [2025-03-04 02:20:31,441 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 127 selfloop transitions, 66 changer transitions 0/196 dead transitions. [2025-03-04 02:20:31,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 196 transitions, 3491 flow [2025-03-04 02:20:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-03-04 02:20:31,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36176470588235293 [2025-03-04 02:20:31,442 INFO L175 Difference]: Start difference. First operand has 182 places, 155 transitions, 2632 flow. Second operand 10 states and 123 transitions. [2025-03-04 02:20:31,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 196 transitions, 3491 flow [2025-03-04 02:20:31,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 196 transitions, 3340 flow, removed 13 selfloop flow, removed 12 redundant places. [2025-03-04 02:20:31,477 INFO L231 Difference]: Finished difference. Result has 174 places, 162 transitions, 2789 flow [2025-03-04 02:20:31,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2789, PETRI_PLACES=174, PETRI_TRANSITIONS=162} [2025-03-04 02:20:31,478 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2025-03-04 02:20:31,478 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 162 transitions, 2789 flow [2025-03-04 02:20:31,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:31,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:31,478 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] [2025-03-04 02:20:31,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:31,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 02:20:31,679 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:31,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1810321070, now seen corresponding path program 1 times [2025-03-04 02:20:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:31,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629713057] [2025-03-04 02:20:31,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:31,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:31,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:31,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:31,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:31,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629713057] [2025-03-04 02:20:31,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629713057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631634391] [2025-03-04 02:20:31,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:31,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:31,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:31,833 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:31,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 02:20:31,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:31,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:31,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:31,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:31,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:20:31,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:31,944 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 02:20:31,944 INFO L378 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 26 treesize of output 10 [2025-03-04 02:20:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:31,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:32,005 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:20:32,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 02:20:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631634391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:32,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-04 02:20:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276833305] [2025-03-04 02:20:32,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:32,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:20:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:32,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:20:32,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:20:32,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:32,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 162 transitions, 2789 flow. Second operand has 17 states, 17 states have (on average 7.823529411764706) internal successors, (133), 17 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:32,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:32,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:32,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:32,322 INFO L124 PetriNetUnfolderBase]: 840/1440 cut-off events. [2025-03-04 02:20:32,323 INFO L125 PetriNetUnfolderBase]: For 14399/14450 co-relation queries the response was YES. [2025-03-04 02:20:32,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9517 conditions, 1440 events. 840/1440 cut-off events. For 14399/14450 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7104 event pairs, 146 based on Foata normal form. 20/1460 useless extension candidates. Maximal degree in co-relation 9456. Up to 616 conditions per place. [2025-03-04 02:20:32,331 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 150 selfloop transitions, 69 changer transitions 0/222 dead transitions. [2025-03-04 02:20:32,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 222 transitions, 3747 flow [2025-03-04 02:20:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2025-03-04 02:20:32,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2025-03-04 02:20:32,332 INFO L175 Difference]: Start difference. First operand has 174 places, 162 transitions, 2789 flow. Second operand 10 states and 132 transitions. [2025-03-04 02:20:32,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 222 transitions, 3747 flow [2025-03-04 02:20:32,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 222 transitions, 3639 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:32,366 INFO L231 Difference]: Finished difference. Result has 179 places, 165 transitions, 2886 flow [2025-03-04 02:20:32,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2685, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2886, PETRI_PLACES=179, PETRI_TRANSITIONS=165} [2025-03-04 02:20:32,367 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2025-03-04 02:20:32,367 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 165 transitions, 2886 flow [2025-03-04 02:20:32,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.823529411764706) internal successors, (133), 17 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:32,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:32,367 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] [2025-03-04 02:20:32,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 02:20:32,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 02:20:32,568 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:32,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2124887056, now seen corresponding path program 3 times [2025-03-04 02:20:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:32,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226925014] [2025-03-04 02:20:32,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:32,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:32,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:32,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:32,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:32,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:32,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226925014] [2025-03-04 02:20:32,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226925014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:32,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329501344] [2025-03-04 02:20:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:32,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:32,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:32,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:32,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:32,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:32,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 165 transitions, 2886 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:32,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:32,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:32,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:33,068 INFO L124 PetriNetUnfolderBase]: 864/1473 cut-off events. [2025-03-04 02:20:33,068 INFO L125 PetriNetUnfolderBase]: For 16741/16793 co-relation queries the response was YES. [2025-03-04 02:20:33,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10089 conditions, 1473 events. 864/1473 cut-off events. For 16741/16793 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7310 event pairs, 319 based on Foata normal form. 10/1479 useless extension candidates. Maximal degree in co-relation 10026. Up to 986 conditions per place. [2025-03-04 02:20:33,078 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 119 selfloop transitions, 70 changer transitions 0/192 dead transitions. [2025-03-04 02:20:33,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 192 transitions, 3566 flow [2025-03-04 02:20:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2025-03-04 02:20:33,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3660130718954248 [2025-03-04 02:20:33,079 INFO L175 Difference]: Start difference. First operand has 179 places, 165 transitions, 2886 flow. Second operand 9 states and 112 transitions. [2025-03-04 02:20:33,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 192 transitions, 3566 flow [2025-03-04 02:20:33,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 192 transitions, 3354 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-03-04 02:20:33,121 INFO L231 Difference]: Finished difference. Result has 181 places, 172 transitions, 3012 flow [2025-03-04 02:20:33,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3012, PETRI_PLACES=181, PETRI_TRANSITIONS=172} [2025-03-04 02:20:33,122 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 151 predicate places. [2025-03-04 02:20:33,122 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 172 transitions, 3012 flow [2025-03-04 02:20:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:33,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:33,122 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] [2025-03-04 02:20:33,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 02:20:33,122 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:33,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2024383638, now seen corresponding path program 4 times [2025-03-04 02:20:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5043095] [2025-03-04 02:20:33,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:33,127 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:33,128 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-03-04 02:20:33,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:33,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:33,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5043095] [2025-03-04 02:20:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5043095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394673935] [2025-03-04 02:20:33,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:33,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:33,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:33,189 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:33,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 02:20:33,242 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:33,251 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-03-04 02:20:33,251 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:33,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:33,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:20:33,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:33,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:33,279 INFO L378 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 29 treesize of output 25 [2025-03-04 02:20:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:33,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:33,347 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:20:33,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 02:20:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:33,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394673935] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:33,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:33,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2025-03-04 02:20:33,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089521884] [2025-03-04 02:20:33,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:33,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:33,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:33,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:20:33,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:33,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 172 transitions, 3012 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:33,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:33,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:33,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:33,675 INFO L124 PetriNetUnfolderBase]: 943/1624 cut-off events. [2025-03-04 02:20:33,676 INFO L125 PetriNetUnfolderBase]: For 16688/16740 co-relation queries the response was YES. [2025-03-04 02:20:33,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10778 conditions, 1624 events. 943/1624 cut-off events. For 16688/16740 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8375 event pairs, 264 based on Foata normal form. 10/1630 useless extension candidates. Maximal degree in co-relation 10715. Up to 831 conditions per place. [2025-03-04 02:20:33,690 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 166 selfloop transitions, 72 changer transitions 3/244 dead transitions. [2025-03-04 02:20:33,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 244 transitions, 4073 flow [2025-03-04 02:20:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2025-03-04 02:20:33,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4197860962566845 [2025-03-04 02:20:33,691 INFO L175 Difference]: Start difference. First operand has 181 places, 172 transitions, 3012 flow. Second operand 11 states and 157 transitions. [2025-03-04 02:20:33,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 244 transitions, 4073 flow [2025-03-04 02:20:33,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 244 transitions, 3955 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:33,736 INFO L231 Difference]: Finished difference. Result has 190 places, 180 transitions, 3229 flow [2025-03-04 02:20:33,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2905, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3229, PETRI_PLACES=190, PETRI_TRANSITIONS=180} [2025-03-04 02:20:33,737 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 160 predicate places. [2025-03-04 02:20:33,737 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 180 transitions, 3229 flow [2025-03-04 02:20:33,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:33,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:33,737 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] [2025-03-04 02:20:33,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 02:20:33,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:33,938 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:33,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -204370854, now seen corresponding path program 5 times [2025-03-04 02:20:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:33,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183893082] [2025-03-04 02:20:33,938 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:33,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:33,942 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:33,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:33,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:33,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:34,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183893082] [2025-03-04 02:20:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183893082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353929408] [2025-03-04 02:20:34,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:34,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:34,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:34,099 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:34,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 02:20:34,149 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:34,166 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:34,166 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:34,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:34,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 02:20:34,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:34,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:34,186 INFO L378 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 29 treesize of output 25 [2025-03-04 02:20:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:34,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:34,253 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:34,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:20:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353929408] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:34,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2025-03-04 02:20:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131216684] [2025-03-04 02:20:34,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:34,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:34,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:34,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:20:34,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:34,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 180 transitions, 3229 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:34,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:34,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:34,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:34,541 INFO L124 PetriNetUnfolderBase]: 988/1725 cut-off events. [2025-03-04 02:20:34,541 INFO L125 PetriNetUnfolderBase]: For 18835/18879 co-relation queries the response was YES. [2025-03-04 02:20:34,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11330 conditions, 1725 events. 988/1725 cut-off events. For 18835/18879 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9138 event pairs, 343 based on Foata normal form. 10/1728 useless extension candidates. Maximal degree in co-relation 11263. Up to 1069 conditions per place. [2025-03-04 02:20:34,552 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 146 selfloop transitions, 78 changer transitions 0/227 dead transitions. [2025-03-04 02:20:34,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 227 transitions, 4087 flow [2025-03-04 02:20:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-03-04 02:20:34,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4147058823529412 [2025-03-04 02:20:34,553 INFO L175 Difference]: Start difference. First operand has 190 places, 180 transitions, 3229 flow. Second operand 10 states and 141 transitions. [2025-03-04 02:20:34,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 227 transitions, 4087 flow [2025-03-04 02:20:34,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 227 transitions, 4009 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:34,596 INFO L231 Difference]: Finished difference. Result has 200 places, 189 transitions, 3541 flow [2025-03-04 02:20:34,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3153, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3541, PETRI_PLACES=200, PETRI_TRANSITIONS=189} [2025-03-04 02:20:34,597 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 170 predicate places. [2025-03-04 02:20:34,597 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 189 transitions, 3541 flow [2025-03-04 02:20:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:34,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:34,597 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] [2025-03-04 02:20:34,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 02:20:34,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:34,797 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:34,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:34,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1820098410, now seen corresponding path program 2 times [2025-03-04 02:20:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:34,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877172522] [2025-03-04 02:20:34,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:34,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:34,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:34,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:34,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877172522] [2025-03-04 02:20:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877172522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:34,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401090758] [2025-03-04 02:20:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:34,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:34,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:34,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:34,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:34,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 189 transitions, 3541 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:34,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:34,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:34,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:35,256 INFO L124 PetriNetUnfolderBase]: 1096/1894 cut-off events. [2025-03-04 02:20:35,256 INFO L125 PetriNetUnfolderBase]: For 22803/22860 co-relation queries the response was YES. [2025-03-04 02:20:35,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12843 conditions, 1894 events. 1096/1894 cut-off events. For 22803/22860 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10233 event pairs, 357 based on Foata normal form. 16/1905 useless extension candidates. Maximal degree in co-relation 12773. Up to 1214 conditions per place. [2025-03-04 02:20:35,272 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 149 selfloop transitions, 84 changer transitions 0/236 dead transitions. [2025-03-04 02:20:35,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 236 transitions, 4449 flow [2025-03-04 02:20:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2025-03-04 02:20:35,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39869281045751637 [2025-03-04 02:20:35,273 INFO L175 Difference]: Start difference. First operand has 200 places, 189 transitions, 3541 flow. Second operand 9 states and 122 transitions. [2025-03-04 02:20:35,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 236 transitions, 4449 flow [2025-03-04 02:20:35,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 236 transitions, 4343 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:35,337 INFO L231 Difference]: Finished difference. Result has 205 places, 195 transitions, 3737 flow [2025-03-04 02:20:35,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3435, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3737, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2025-03-04 02:20:35,338 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2025-03-04 02:20:35,338 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 3737 flow [2025-03-04 02:20:35,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:35,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:35,338 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] [2025-03-04 02:20:35,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 02:20:35,339 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:35,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:35,339 INFO L85 PathProgramCache]: Analyzing trace with hash 953050982, now seen corresponding path program 3 times [2025-03-04 02:20:35,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:35,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750007272] [2025-03-04 02:20:35,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:35,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:35,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:35,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:35,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:35,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750007272] [2025-03-04 02:20:35,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750007272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:35,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:35,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300309744] [2025-03-04 02:20:35,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:35,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:35,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:35,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:35,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:35,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 195 transitions, 3737 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:35,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:35,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:35,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:35,811 INFO L124 PetriNetUnfolderBase]: 1080/1885 cut-off events. [2025-03-04 02:20:35,811 INFO L125 PetriNetUnfolderBase]: For 24726/24776 co-relation queries the response was YES. [2025-03-04 02:20:35,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12919 conditions, 1885 events. 1080/1885 cut-off events. For 24726/24776 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10297 event pairs, 413 based on Foata normal form. 16/1897 useless extension candidates. Maximal degree in co-relation 12850. Up to 1303 conditions per place. [2025-03-04 02:20:35,825 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 137 selfloop transitions, 82 changer transitions 0/222 dead transitions. [2025-03-04 02:20:35,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 222 transitions, 4338 flow [2025-03-04 02:20:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2025-03-04 02:20:35,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2025-03-04 02:20:35,826 INFO L175 Difference]: Start difference. First operand has 205 places, 195 transitions, 3737 flow. Second operand 9 states and 114 transitions. [2025-03-04 02:20:35,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 222 transitions, 4338 flow [2025-03-04 02:20:35,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 222 transitions, 4255 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:35,878 INFO L231 Difference]: Finished difference. Result has 210 places, 195 transitions, 3827 flow [2025-03-04 02:20:35,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3654, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3827, PETRI_PLACES=210, PETRI_TRANSITIONS=195} [2025-03-04 02:20:35,879 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2025-03-04 02:20:35,879 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 195 transitions, 3827 flow [2025-03-04 02:20:35,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:35,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:35,879 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] [2025-03-04 02:20:35,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 02:20:35,879 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:35,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash 556091580, now seen corresponding path program 4 times [2025-03-04 02:20:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:35,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965812577] [2025-03-04 02:20:35,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:35,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:35,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:35,886 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-03-04 02:20:35,886 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:35,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965812577] [2025-03-04 02:20:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965812577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:35,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:35,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059662182] [2025-03-04 02:20:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:35,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:35,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:35,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:35,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:35,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:35,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 195 transitions, 3827 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:35,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:35,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:35,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:36,275 INFO L124 PetriNetUnfolderBase]: 1051/1838 cut-off events. [2025-03-04 02:20:36,276 INFO L125 PetriNetUnfolderBase]: For 23356/23406 co-relation queries the response was YES. [2025-03-04 02:20:36,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12685 conditions, 1838 events. 1051/1838 cut-off events. For 23356/23406 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9974 event pairs, 405 based on Foata normal form. 6/1840 useless extension candidates. Maximal degree in co-relation 12615. Up to 1290 conditions per place. [2025-03-04 02:20:36,287 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 132 selfloop transitions, 74 changer transitions 5/214 dead transitions. [2025-03-04 02:20:36,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 214 transitions, 4275 flow [2025-03-04 02:20:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:20:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:20:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-03-04 02:20:36,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3860294117647059 [2025-03-04 02:20:36,288 INFO L175 Difference]: Start difference. First operand has 210 places, 195 transitions, 3827 flow. Second operand 8 states and 105 transitions. [2025-03-04 02:20:36,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 214 transitions, 4275 flow [2025-03-04 02:20:36,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 214 transitions, 4125 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:36,337 INFO L231 Difference]: Finished difference. Result has 212 places, 190 transitions, 3687 flow [2025-03-04 02:20:36,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3606, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3687, PETRI_PLACES=212, PETRI_TRANSITIONS=190} [2025-03-04 02:20:36,338 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2025-03-04 02:20:36,338 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 190 transitions, 3687 flow [2025-03-04 02:20:36,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:36,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:36,338 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] [2025-03-04 02:20:36,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 02:20:36,338 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:36,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1095093014, now seen corresponding path program 6 times [2025-03-04 02:20:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:36,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975908620] [2025-03-04 02:20:36,338 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:36,342 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:36,350 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:36,351 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:36,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975908620] [2025-03-04 02:20:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975908620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:36,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:36,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558273080] [2025-03-04 02:20:36,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:36,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:36,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:36,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:36,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:36,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 190 transitions, 3687 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:36,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:36,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:36,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:36,870 INFO L124 PetriNetUnfolderBase]: 1041/1827 cut-off events. [2025-03-04 02:20:36,870 INFO L125 PetriNetUnfolderBase]: For 22654/22699 co-relation queries the response was YES. [2025-03-04 02:20:36,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12462 conditions, 1827 events. 1041/1827 cut-off events. For 22654/22699 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9932 event pairs, 409 based on Foata normal form. 7/1829 useless extension candidates. Maximal degree in co-relation 12392. Up to 1271 conditions per place. [2025-03-04 02:20:36,884 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 128 selfloop transitions, 74 changer transitions 6/211 dead transitions. [2025-03-04 02:20:36,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 211 transitions, 4148 flow [2025-03-04 02:20:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2025-03-04 02:20:36,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3382352941176471 [2025-03-04 02:20:36,884 INFO L175 Difference]: Start difference. First operand has 212 places, 190 transitions, 3687 flow. Second operand 10 states and 115 transitions. [2025-03-04 02:20:36,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 211 transitions, 4148 flow [2025-03-04 02:20:36,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 211 transitions, 3946 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:36,938 INFO L231 Difference]: Finished difference. Result has 210 places, 186 transitions, 3526 flow [2025-03-04 02:20:36,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3430, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3526, PETRI_PLACES=210, PETRI_TRANSITIONS=186} [2025-03-04 02:20:36,939 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2025-03-04 02:20:36,939 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 186 transitions, 3526 flow [2025-03-04 02:20:36,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:36,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:36,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:36,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 02:20:36,939 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:36,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:36,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1866197128, now seen corresponding path program 7 times [2025-03-04 02:20:36,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:36,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639581922] [2025-03-04 02:20:36,940 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:36,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:36,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:36,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:36,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639581922] [2025-03-04 02:20:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639581922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:37,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:37,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:37,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747014565] [2025-03-04 02:20:37,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:37,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:37,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:37,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:37,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:37,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 186 transitions, 3526 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:37,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:37,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:37,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:37,452 INFO L124 PetriNetUnfolderBase]: 984/1713 cut-off events. [2025-03-04 02:20:37,453 INFO L125 PetriNetUnfolderBase]: For 20642/20692 co-relation queries the response was YES. [2025-03-04 02:20:37,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11752 conditions, 1713 events. 984/1713 cut-off events. For 20642/20692 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9117 event pairs, 371 based on Foata normal form. 7/1716 useless extension candidates. Maximal degree in co-relation 11683. Up to 1180 conditions per place. [2025-03-04 02:20:37,467 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 124 selfloop transitions, 69 changer transitions 13/209 dead transitions. [2025-03-04 02:20:37,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 3963 flow [2025-03-04 02:20:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2025-03-04 02:20:37,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3315508021390374 [2025-03-04 02:20:37,468 INFO L175 Difference]: Start difference. First operand has 210 places, 186 transitions, 3526 flow. Second operand 11 states and 124 transitions. [2025-03-04 02:20:37,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 3963 flow [2025-03-04 02:20:37,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 3814 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:37,521 INFO L231 Difference]: Finished difference. Result has 209 places, 178 transitions, 3336 flow [2025-03-04 02:20:37,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3295, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3336, PETRI_PLACES=209, PETRI_TRANSITIONS=178} [2025-03-04 02:20:37,521 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2025-03-04 02:20:37,521 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 178 transitions, 3336 flow [2025-03-04 02:20:37,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:37,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:37,521 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] [2025-03-04 02:20:37,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 02:20:37,522 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:37,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1450958848, now seen corresponding path program 5 times [2025-03-04 02:20:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:37,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925567024] [2025-03-04 02:20:37,522 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:37,526 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:37,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:37,532 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:37,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:37,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:37,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925567024] [2025-03-04 02:20:37,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925567024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:37,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855650962] [2025-03-04 02:20:37,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:37,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:37,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:37,671 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:37,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 02:20:37,722 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:37,740 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:37,740 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:37,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:37,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:20:37,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:37,781 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 02:20:37,781 INFO L378 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 26 treesize of output 10 [2025-03-04 02:20:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:37,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:37,844 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:20:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855650962] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:37,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-04 02:20:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182543894] [2025-03-04 02:20:37,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:37,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:20:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:37,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:20:37,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:20:37,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:37,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 178 transitions, 3336 flow. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:37,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:37,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:37,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:38,215 INFO L124 PetriNetUnfolderBase]: 1081/1868 cut-off events. [2025-03-04 02:20:38,215 INFO L125 PetriNetUnfolderBase]: For 24930/24980 co-relation queries the response was YES. [2025-03-04 02:20:38,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13005 conditions, 1868 events. 1081/1868 cut-off events. For 24930/24980 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10019 event pairs, 376 based on Foata normal form. 16/1880 useless extension candidates. Maximal degree in co-relation 12936. Up to 1225 conditions per place. [2025-03-04 02:20:38,228 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 139 selfloop transitions, 75 changer transitions 0/217 dead transitions. [2025-03-04 02:20:38,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 217 transitions, 4179 flow [2025-03-04 02:20:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2025-03-04 02:20:38,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39869281045751637 [2025-03-04 02:20:38,229 INFO L175 Difference]: Start difference. First operand has 209 places, 178 transitions, 3336 flow. Second operand 9 states and 122 transitions. [2025-03-04 02:20:38,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 217 transitions, 4179 flow [2025-03-04 02:20:38,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 217 transitions, 3990 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 02:20:38,286 INFO L231 Difference]: Finished difference. Result has 203 places, 184 transitions, 3442 flow [2025-03-04 02:20:38,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3147, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3442, PETRI_PLACES=203, PETRI_TRANSITIONS=184} [2025-03-04 02:20:38,286 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2025-03-04 02:20:38,286 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 184 transitions, 3442 flow [2025-03-04 02:20:38,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:38,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:38,286 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] [2025-03-04 02:20:38,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 02:20:38,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:38,487 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:38,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1916512354, now seen corresponding path program 6 times [2025-03-04 02:20:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:38,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668535742] [2025-03-04 02:20:38,488 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:38,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:38,492 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:38,494 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:38,494 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:38,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:38,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:38,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668535742] [2025-03-04 02:20:38,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668535742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:38,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:38,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:38,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39864601] [2025-03-04 02:20:38,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:38,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:38,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:38,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:38,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:38,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 184 transitions, 3442 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:38,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:38,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:38,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:38,910 INFO L124 PetriNetUnfolderBase]: 1082/1871 cut-off events. [2025-03-04 02:20:38,910 INFO L125 PetriNetUnfolderBase]: For 25213/25267 co-relation queries the response was YES. [2025-03-04 02:20:38,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13110 conditions, 1871 events. 1082/1871 cut-off events. For 25213/25267 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10069 event pairs, 427 based on Foata normal form. 6/1872 useless extension candidates. Maximal degree in co-relation 13039. Up to 1352 conditions per place. [2025-03-04 02:20:38,923 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 123 selfloop transitions, 68 changer transitions 5/199 dead transitions. [2025-03-04 02:20:38,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 199 transitions, 3910 flow [2025-03-04 02:20:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2025-03-04 02:20:38,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3411764705882353 [2025-03-04 02:20:38,924 INFO L175 Difference]: Start difference. First operand has 203 places, 184 transitions, 3442 flow. Second operand 10 states and 116 transitions. [2025-03-04 02:20:38,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 199 transitions, 3910 flow [2025-03-04 02:20:38,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 199 transitions, 3782 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:38,979 INFO L231 Difference]: Finished difference. Result has 207 places, 183 transitions, 3423 flow [2025-03-04 02:20:38,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3316, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3423, PETRI_PLACES=207, PETRI_TRANSITIONS=183} [2025-03-04 02:20:38,980 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2025-03-04 02:20:38,980 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 183 transitions, 3423 flow [2025-03-04 02:20:38,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:38,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:38,980 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] [2025-03-04 02:20:38,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 02:20:38,980 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 737979448, now seen corresponding path program 7 times [2025-03-04 02:20:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532117561] [2025-03-04 02:20:38,980 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:38,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:38,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:38,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:38,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532117561] [2025-03-04 02:20:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532117561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601450715] [2025-03-04 02:20:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:39,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:39,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:39,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:39,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:39,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:39,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 183 transitions, 3423 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:39,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:39,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:39,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:39,418 INFO L124 PetriNetUnfolderBase]: 1102/1898 cut-off events. [2025-03-04 02:20:39,418 INFO L125 PetriNetUnfolderBase]: For 25453/25512 co-relation queries the response was YES. [2025-03-04 02:20:39,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13303 conditions, 1898 events. 1102/1898 cut-off events. For 25453/25512 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10231 event pairs, 421 based on Foata normal form. 16/1910 useless extension candidates. Maximal degree in co-relation 13231. Up to 1366 conditions per place. [2025-03-04 02:20:39,433 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 131 selfloop transitions, 70 changer transitions 0/204 dead transitions. [2025-03-04 02:20:39,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 204 transitions, 3978 flow [2025-03-04 02:20:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2025-03-04 02:20:39,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.369281045751634 [2025-03-04 02:20:39,434 INFO L175 Difference]: Start difference. First operand has 207 places, 183 transitions, 3423 flow. Second operand 9 states and 113 transitions. [2025-03-04 02:20:39,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 204 transitions, 3978 flow [2025-03-04 02:20:39,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 204 transitions, 3835 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:39,496 INFO L231 Difference]: Finished difference. Result has 207 places, 185 transitions, 3472 flow [2025-03-04 02:20:39,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3280, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3472, PETRI_PLACES=207, PETRI_TRANSITIONS=185} [2025-03-04 02:20:39,497 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2025-03-04 02:20:39,497 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 185 transitions, 3472 flow [2025-03-04 02:20:39,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:39,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:39,497 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] [2025-03-04 02:20:39,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 02:20:39,497 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1653060936, now seen corresponding path program 8 times [2025-03-04 02:20:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302922439] [2025-03-04 02:20:39,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:39,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:39,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:39,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:39,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:39,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302922439] [2025-03-04 02:20:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302922439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490199992] [2025-03-04 02:20:39,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:39,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:39,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:39,664 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:39,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 02:20:39,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:39,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:39,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:39,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:39,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:20:39,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:39,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:39,787 INFO L378 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 29 treesize of output 21 [2025-03-04 02:20:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:39,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:39,862 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:39,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:20:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490199992] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 17 [2025-03-04 02:20:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398696889] [2025-03-04 02:20:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:39,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:39,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:39,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:20:39,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:39,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 185 transitions, 3472 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:39,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:39,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:39,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:40,211 INFO L124 PetriNetUnfolderBase]: 1116/1956 cut-off events. [2025-03-04 02:20:40,211 INFO L125 PetriNetUnfolderBase]: For 25220/25277 co-relation queries the response was YES. [2025-03-04 02:20:40,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13321 conditions, 1956 events. 1116/1956 cut-off events. For 25220/25277 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10775 event pairs, 406 based on Foata normal form. 16/1968 useless extension candidates. Maximal degree in co-relation 13249. Up to 1312 conditions per place. [2025-03-04 02:20:40,226 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 144 selfloop transitions, 69 changer transitions 0/216 dead transitions. [2025-03-04 02:20:40,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 216 transitions, 4074 flow [2025-03-04 02:20:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2025-03-04 02:20:40,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40522875816993464 [2025-03-04 02:20:40,227 INFO L175 Difference]: Start difference. First operand has 207 places, 185 transitions, 3472 flow. Second operand 9 states and 124 transitions. [2025-03-04 02:20:40,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 216 transitions, 4074 flow [2025-03-04 02:20:40,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 216 transitions, 3925 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:40,281 INFO L231 Difference]: Finished difference. Result has 210 places, 186 transitions, 3490 flow [2025-03-04 02:20:40,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3323, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3490, PETRI_PLACES=210, PETRI_TRANSITIONS=186} [2025-03-04 02:20:40,281 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2025-03-04 02:20:40,281 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 186 transitions, 3490 flow [2025-03-04 02:20:40,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:40,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:40,282 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] [2025-03-04 02:20:40,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 02:20:40,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-03-04 02:20:40,482 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2015739648, now seen corresponding path program 9 times [2025-03-04 02:20:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514036533] [2025-03-04 02:20:40,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:40,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:40,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:40,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:40,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:40,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514036533] [2025-03-04 02:20:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514036533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927264500] [2025-03-04 02:20:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:40,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:40,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:40,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:40,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:40,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 186 transitions, 3490 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:40,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:40,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:40,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:40,926 INFO L124 PetriNetUnfolderBase]: 1117/1966 cut-off events. [2025-03-04 02:20:40,926 INFO L125 PetriNetUnfolderBase]: For 24117/24171 co-relation queries the response was YES. [2025-03-04 02:20:40,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13373 conditions, 1966 events. 1117/1966 cut-off events. For 24117/24171 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10911 event pairs, 454 based on Foata normal form. 6/1967 useless extension candidates. Maximal degree in co-relation 13299. Up to 1441 conditions per place. [2025-03-04 02:20:40,944 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 125 selfloop transitions, 68 changer transitions 5/201 dead transitions. [2025-03-04 02:20:40,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 201 transitions, 3962 flow [2025-03-04 02:20:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2025-03-04 02:20:40,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3382352941176471 [2025-03-04 02:20:40,945 INFO L175 Difference]: Start difference. First operand has 210 places, 186 transitions, 3490 flow. Second operand 10 states and 115 transitions. [2025-03-04 02:20:40,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 201 transitions, 3962 flow [2025-03-04 02:20:41,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 201 transitions, 3844 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:41,003 INFO L231 Difference]: Finished difference. Result has 215 places, 185 transitions, 3484 flow [2025-03-04 02:20:41,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3373, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3484, PETRI_PLACES=215, PETRI_TRANSITIONS=185} [2025-03-04 02:20:41,004 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2025-03-04 02:20:41,004 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 185 transitions, 3484 flow [2025-03-04 02:20:41,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:41,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:41,004 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] [2025-03-04 02:20:41,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-04 02:20:41,004 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:41,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:41,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1289892488, now seen corresponding path program 10 times [2025-03-04 02:20:41,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:41,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861055371] [2025-03-04 02:20:41,005 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:41,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:41,011 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:41,012 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-03-04 02:20:41,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:41,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:41,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:41,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861055371] [2025-03-04 02:20:41,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861055371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:41,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:41,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787390931] [2025-03-04 02:20:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:41,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:41,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:41,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:41,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:41,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 185 transitions, 3484 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:41,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:41,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:41,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:41,306 INFO L124 PetriNetUnfolderBase]: 1055/1840 cut-off events. [2025-03-04 02:20:41,306 INFO L125 PetriNetUnfolderBase]: For 22893/22945 co-relation queries the response was YES. [2025-03-04 02:20:41,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12695 conditions, 1840 events. 1055/1840 cut-off events. For 22893/22945 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9967 event pairs, 419 based on Foata normal form. 6/1842 useless extension candidates. Maximal degree in co-relation 12621. Up to 1337 conditions per place. [2025-03-04 02:20:41,319 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 125 selfloop transitions, 59 changer transitions 11/198 dead transitions. [2025-03-04 02:20:41,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 198 transitions, 3853 flow [2025-03-04 02:20:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2025-03-04 02:20:41,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35947712418300654 [2025-03-04 02:20:41,320 INFO L175 Difference]: Start difference. First operand has 215 places, 185 transitions, 3484 flow. Second operand 9 states and 110 transitions. [2025-03-04 02:20:41,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 198 transitions, 3853 flow [2025-03-04 02:20:41,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 198 transitions, 3719 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:41,372 INFO L231 Difference]: Finished difference. Result has 214 places, 177 transitions, 3296 flow [2025-03-04 02:20:41,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3277, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3296, PETRI_PLACES=214, PETRI_TRANSITIONS=177} [2025-03-04 02:20:41,372 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2025-03-04 02:20:41,372 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 177 transitions, 3296 flow [2025-03-04 02:20:41,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:41,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:41,373 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] [2025-03-04 02:20:41,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-04 02:20:41,373 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -523278382, now seen corresponding path program 8 times [2025-03-04 02:20:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:41,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945173561] [2025-03-04 02:20:41,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:41,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:41,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:41,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:41,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:41,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:41,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945173561] [2025-03-04 02:20:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945173561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831703753] [2025-03-04 02:20:41,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:41,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:41,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:41,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:41,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:41,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 177 transitions, 3296 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:41,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:41,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:41,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:41,831 INFO L124 PetriNetUnfolderBase]: 1038/1811 cut-off events. [2025-03-04 02:20:41,831 INFO L125 PetriNetUnfolderBase]: For 22231/22283 co-relation queries the response was YES. [2025-03-04 02:20:41,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12410 conditions, 1811 events. 1038/1811 cut-off events. For 22231/22283 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9741 event pairs, 420 based on Foata normal form. 7/1813 useless extension candidates. Maximal degree in co-relation 12336. Up to 1318 conditions per place. [2025-03-04 02:20:41,843 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 121 selfloop transitions, 60 changer transitions 6/190 dead transitions. [2025-03-04 02:20:41,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 190 transitions, 3668 flow [2025-03-04 02:20:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-04 02:20:41,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32941176470588235 [2025-03-04 02:20:41,844 INFO L175 Difference]: Start difference. First operand has 214 places, 177 transitions, 3296 flow. Second operand 10 states and 112 transitions. [2025-03-04 02:20:41,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 190 transitions, 3668 flow [2025-03-04 02:20:41,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 190 transitions, 3475 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:41,890 INFO L231 Difference]: Finished difference. Result has 206 places, 173 transitions, 3121 flow [2025-03-04 02:20:41,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3050, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3121, PETRI_PLACES=206, PETRI_TRANSITIONS=173} [2025-03-04 02:20:41,890 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2025-03-04 02:20:41,890 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 173 transitions, 3121 flow [2025-03-04 02:20:41,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:41,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:41,890 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] [2025-03-04 02:20:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-04 02:20:41,890 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash -948867880, now seen corresponding path program 9 times [2025-03-04 02:20:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181008203] [2025-03-04 02:20:41,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:41,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:41,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:41,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:41,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181008203] [2025-03-04 02:20:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181008203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:42,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:42,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:42,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825937355] [2025-03-04 02:20:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:42,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:42,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:42,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:42,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:42,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 173 transitions, 3121 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:42,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:42,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:42,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:42,370 INFO L124 PetriNetUnfolderBase]: 981/1702 cut-off events. [2025-03-04 02:20:42,370 INFO L125 PetriNetUnfolderBase]: For 19462/19514 co-relation queries the response was YES. [2025-03-04 02:20:42,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11664 conditions, 1702 events. 981/1702 cut-off events. For 19462/19514 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8996 event pairs, 386 based on Foata normal form. 7/1705 useless extension candidates. Maximal degree in co-relation 11592. Up to 1220 conditions per place. [2025-03-04 02:20:42,382 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 121 selfloop transitions, 55 changer transitions 9/188 dead transitions. [2025-03-04 02:20:42,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 188 transitions, 3472 flow [2025-03-04 02:20:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2025-03-04 02:20:42,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2025-03-04 02:20:42,382 INFO L175 Difference]: Start difference. First operand has 206 places, 173 transitions, 3121 flow. Second operand 11 states and 121 transitions. [2025-03-04 02:20:42,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 188 transitions, 3472 flow [2025-03-04 02:20:42,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 188 transitions, 3333 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-04 02:20:42,424 INFO L231 Difference]: Finished difference. Result has 203 places, 165 transitions, 2926 flow [2025-03-04 02:20:42,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2905, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2926, PETRI_PLACES=203, PETRI_TRANSITIONS=165} [2025-03-04 02:20:42,425 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2025-03-04 02:20:42,425 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 165 transitions, 2926 flow [2025-03-04 02:20:42,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:42,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:42,425 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] [2025-03-04 02:20:42,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-04 02:20:42,425 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:42,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash 949396412, now seen corresponding path program 10 times [2025-03-04 02:20:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350563376] [2025-03-04 02:20:42,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:42,430 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:42,431 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-03-04 02:20:42,431 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:42,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350563376] [2025-03-04 02:20:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350563376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:42,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778926763] [2025-03-04 02:20:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:42,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:42,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:42,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:42,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:42,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 165 transitions, 2926 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:42,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:42,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:42,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:42,719 INFO L124 PetriNetUnfolderBase]: 946/1641 cut-off events. [2025-03-04 02:20:42,719 INFO L125 PetriNetUnfolderBase]: For 18538/18590 co-relation queries the response was YES. [2025-03-04 02:20:42,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11159 conditions, 1641 events. 946/1641 cut-off events. For 18538/18590 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8573 event pairs, 385 based on Foata normal form. 7/1644 useless extension candidates. Maximal degree in co-relation 11088. Up to 1212 conditions per place. [2025-03-04 02:20:42,731 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 118 selfloop transitions, 50 changer transitions 6/177 dead transitions. [2025-03-04 02:20:42,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 177 transitions, 3248 flow [2025-03-04 02:20:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:20:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:20:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-03-04 02:20:42,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2025-03-04 02:20:42,732 INFO L175 Difference]: Start difference. First operand has 203 places, 165 transitions, 2926 flow. Second operand 8 states and 99 transitions. [2025-03-04 02:20:42,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 177 transitions, 3248 flow [2025-03-04 02:20:42,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 177 transitions, 3041 flow, removed 7 selfloop flow, removed 14 redundant places. [2025-03-04 02:20:42,776 INFO L231 Difference]: Finished difference. Result has 192 places, 160 transitions, 2696 flow [2025-03-04 02:20:42,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2644, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2696, PETRI_PLACES=192, PETRI_TRANSITIONS=160} [2025-03-04 02:20:42,776 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2025-03-04 02:20:42,776 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 160 transitions, 2696 flow [2025-03-04 02:20:42,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:42,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:42,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:42,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-04 02:20:42,776 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:42,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:42,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1688556592, now seen corresponding path program 11 times [2025-03-04 02:20:42,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:42,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058471179] [2025-03-04 02:20:42,777 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:42,781 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:42,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:42,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:42,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058471179] [2025-03-04 02:20:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058471179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835871035] [2025-03-04 02:20:42,913 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:42,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:42,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:42,915 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:42,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 02:20:42,973 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:42,990 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:42,990 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:42,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:42,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:20:42,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:43,003 INFO L378 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-03-04 02:20:43,021 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 02:20:43,022 INFO L378 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 26 treesize of output 10 [2025-03-04 02:20:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:43,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835871035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:43,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:43,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2025-03-04 02:20:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415542799] [2025-03-04 02:20:43,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:43,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 02:20:43,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:43,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 02:20:43,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:20:43,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:43,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 160 transitions, 2696 flow. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:43,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:43,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:43,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:43,560 INFO L124 PetriNetUnfolderBase]: 977/1707 cut-off events. [2025-03-04 02:20:43,560 INFO L125 PetriNetUnfolderBase]: For 16136/16170 co-relation queries the response was YES. [2025-03-04 02:20:43,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11383 conditions, 1707 events. 977/1707 cut-off events. For 16136/16170 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9052 event pairs, 142 based on Foata normal form. 10/1716 useless extension candidates. Maximal degree in co-relation 11316. Up to 693 conditions per place. [2025-03-04 02:20:43,570 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 153 selfloop transitions, 65 changer transitions 2/223 dead transitions. [2025-03-04 02:20:43,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 223 transitions, 3755 flow [2025-03-04 02:20:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2025-03-04 02:20:43,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39869281045751637 [2025-03-04 02:20:43,571 INFO L175 Difference]: Start difference. First operand has 192 places, 160 transitions, 2696 flow. Second operand 9 states and 122 transitions. [2025-03-04 02:20:43,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 223 transitions, 3755 flow [2025-03-04 02:20:43,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 223 transitions, 3629 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:43,609 INFO L231 Difference]: Finished difference. Result has 188 places, 164 transitions, 2802 flow [2025-03-04 02:20:43,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2578, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2802, PETRI_PLACES=188, PETRI_TRANSITIONS=164} [2025-03-04 02:20:43,610 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 158 predicate places. [2025-03-04 02:20:43,610 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 164 transitions, 2802 flow [2025-03-04 02:20:43,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:43,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:43,610 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] [2025-03-04 02:20:43,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 02:20:43,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-04 02:20:43,811 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:43,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1214435918, now seen corresponding path program 11 times [2025-03-04 02:20:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:43,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916306886] [2025-03-04 02:20:43,812 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:43,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:43,821 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:43,821 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:43,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916306886] [2025-03-04 02:20:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916306886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033129316] [2025-03-04 02:20:43,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:43,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:43,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:43,943 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:43,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 02:20:43,995 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:44,010 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:44,011 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:44,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:44,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:20:44,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:44,087 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 02:20:44,088 INFO L378 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 26 treesize of output 10 [2025-03-04 02:20:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:44,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:44,141 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:44,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:20:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:44,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033129316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:44,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:44,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-03-04 02:20:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35532100] [2025-03-04 02:20:44,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:44,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:20:44,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:44,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:20:44,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:20:44,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:44,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 164 transitions, 2802 flow. Second operand has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:44,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:44,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:44,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:44,577 INFO L124 PetriNetUnfolderBase]: 1000/1737 cut-off events. [2025-03-04 02:20:44,577 INFO L125 PetriNetUnfolderBase]: For 18547/18598 co-relation queries the response was YES. [2025-03-04 02:20:44,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11877 conditions, 1737 events. 1000/1737 cut-off events. For 18547/18598 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9156 event pairs, 354 based on Foata normal form. 16/1752 useless extension candidates. Maximal degree in co-relation 11810. Up to 1140 conditions per place. [2025-03-04 02:20:44,599 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 131 selfloop transitions, 67 changer transitions 0/201 dead transitions. [2025-03-04 02:20:44,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 201 transitions, 3574 flow [2025-03-04 02:20:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-03-04 02:20:44,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34759358288770054 [2025-03-04 02:20:44,600 INFO L175 Difference]: Start difference. First operand has 188 places, 164 transitions, 2802 flow. Second operand 11 states and 130 transitions. [2025-03-04 02:20:44,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 201 transitions, 3574 flow [2025-03-04 02:20:44,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 201 transitions, 3363 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-03-04 02:20:44,657 INFO L231 Difference]: Finished difference. Result has 191 places, 169 transitions, 2869 flow [2025-03-04 02:20:44,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2617, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2869, PETRI_PLACES=191, PETRI_TRANSITIONS=169} [2025-03-04 02:20:44,658 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2025-03-04 02:20:44,658 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 169 transitions, 2869 flow [2025-03-04 02:20:44,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:44,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:44,658 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] [2025-03-04 02:20:44,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 02:20:44,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:44,859 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:44,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1335677802, now seen corresponding path program 12 times [2025-03-04 02:20:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:44,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741740189] [2025-03-04 02:20:44,859 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:44,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:44,863 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:44,868 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:44,868 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:44,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:45,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:45,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741740189] [2025-03-04 02:20:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741740189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:45,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702380246] [2025-03-04 02:20:45,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:45,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:45,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:45,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:45,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:45,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 169 transitions, 2869 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:45,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:45,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:45,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:45,368 INFO L124 PetriNetUnfolderBase]: 1078/1855 cut-off events. [2025-03-04 02:20:45,369 INFO L125 PetriNetUnfolderBase]: For 19055/19114 co-relation queries the response was YES. [2025-03-04 02:20:45,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12826 conditions, 1855 events. 1078/1855 cut-off events. For 19055/19114 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9954 event pairs, 313 based on Foata normal form. 10/1865 useless extension candidates. Maximal degree in co-relation 12760. Up to 1164 conditions per place. [2025-03-04 02:20:45,378 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 148 selfloop transitions, 72 changer transitions 0/223 dead transitions. [2025-03-04 02:20:45,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 223 transitions, 3949 flow [2025-03-04 02:20:45,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-03-04 02:20:45,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38562091503267976 [2025-03-04 02:20:45,379 INFO L175 Difference]: Start difference. First operand has 191 places, 169 transitions, 2869 flow. Second operand 9 states and 118 transitions. [2025-03-04 02:20:45,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 223 transitions, 3949 flow [2025-03-04 02:20:45,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 223 transitions, 3820 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:45,418 INFO L231 Difference]: Finished difference. Result has 195 places, 176 transitions, 3073 flow [2025-03-04 02:20:45,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2748, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3073, PETRI_PLACES=195, PETRI_TRANSITIONS=176} [2025-03-04 02:20:45,419 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2025-03-04 02:20:45,419 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 176 transitions, 3073 flow [2025-03-04 02:20:45,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:45,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:45,419 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] [2025-03-04 02:20:45,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-04 02:20:45,419 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:45,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash -625577696, now seen corresponding path program 13 times [2025-03-04 02:20:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:45,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203711909] [2025-03-04 02:20:45,420 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:45,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:45,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:45,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:45,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:45,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203711909] [2025-03-04 02:20:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203711909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607716001] [2025-03-04 02:20:45,553 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:45,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:45,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:45,555 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:45,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 02:20:45,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:45,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:45,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:45,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:45,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:20:45,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:45,657 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 02:20:45,658 INFO L378 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 26 treesize of output 10 [2025-03-04 02:20:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:45,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:45,724 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:45,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:20:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:45,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607716001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:45,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-03-04 02:20:45,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105593245] [2025-03-04 02:20:45,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:45,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 02:20:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:45,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 02:20:45,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:20:45,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:45,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 176 transitions, 3073 flow. Second operand has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:45,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:45,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:45,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:46,205 INFO L124 PetriNetUnfolderBase]: 1095/1884 cut-off events. [2025-03-04 02:20:46,205 INFO L125 PetriNetUnfolderBase]: For 21607/21666 co-relation queries the response was YES. [2025-03-04 02:20:46,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13206 conditions, 1884 events. 1095/1884 cut-off events. For 21607/21666 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10067 event pairs, 365 based on Foata normal form. 10/1894 useless extension candidates. Maximal degree in co-relation 13138. Up to 1191 conditions per place. [2025-03-04 02:20:46,216 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 145 selfloop transitions, 70 changer transitions 1/219 dead transitions. [2025-03-04 02:20:46,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 219 transitions, 4022 flow [2025-03-04 02:20:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2025-03-04 02:20:46,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2025-03-04 02:20:46,217 INFO L175 Difference]: Start difference. First operand has 195 places, 176 transitions, 3073 flow. Second operand 10 states and 124 transitions. [2025-03-04 02:20:46,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 219 transitions, 4022 flow [2025-03-04 02:20:46,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 219 transitions, 3865 flow, removed 21 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:46,261 INFO L231 Difference]: Finished difference. Result has 199 places, 181 transitions, 3194 flow [2025-03-04 02:20:46,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3194, PETRI_PLACES=199, PETRI_TRANSITIONS=181} [2025-03-04 02:20:46,261 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places. [2025-03-04 02:20:46,261 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 181 transitions, 3194 flow [2025-03-04 02:20:46,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:46,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:46,261 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] [2025-03-04 02:20:46,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 02:20:46,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:46,462 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash -301894654, now seen corresponding path program 14 times [2025-03-04 02:20:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516278769] [2025-03-04 02:20:46,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:46,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:46,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:46,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:46,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516278769] [2025-03-04 02:20:46,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516278769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:46,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:46,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567062891] [2025-03-04 02:20:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:46,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:46,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:46,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:46,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:46,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 181 transitions, 3194 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:46,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:46,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:46,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:46,860 INFO L124 PetriNetUnfolderBase]: 1072/1847 cut-off events. [2025-03-04 02:20:46,860 INFO L125 PetriNetUnfolderBase]: For 20133/20192 co-relation queries the response was YES. [2025-03-04 02:20:46,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12998 conditions, 1847 events. 1072/1847 cut-off events. For 20133/20192 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9918 event pairs, 326 based on Foata normal form. 10/1857 useless extension candidates. Maximal degree in co-relation 12929. Up to 1229 conditions per place. [2025-03-04 02:20:46,873 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 143 selfloop transitions, 69 changer transitions 0/215 dead transitions. [2025-03-04 02:20:46,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 215 transitions, 3905 flow [2025-03-04 02:20:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2025-03-04 02:20:46,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2025-03-04 02:20:46,874 INFO L175 Difference]: Start difference. First operand has 199 places, 181 transitions, 3194 flow. Second operand 9 states and 111 transitions. [2025-03-04 02:20:46,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 215 transitions, 3905 flow [2025-03-04 02:20:46,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 215 transitions, 3763 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:46,945 INFO L231 Difference]: Finished difference. Result has 204 places, 183 transitions, 3243 flow [2025-03-04 02:20:46,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3052, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3243, PETRI_PLACES=204, PETRI_TRANSITIONS=183} [2025-03-04 02:20:46,945 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2025-03-04 02:20:46,945 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 183 transitions, 3243 flow [2025-03-04 02:20:46,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:46,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:46,946 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] [2025-03-04 02:20:46,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-04 02:20:46,946 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:46,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1116735656, now seen corresponding path program 15 times [2025-03-04 02:20:46,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:46,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925844689] [2025-03-04 02:20:46,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:46,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:46,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:46,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:46,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:46,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:47,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925844689] [2025-03-04 02:20:47,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925844689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702179429] [2025-03-04 02:20:47,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:47,088 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:47,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 02:20:47,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:47,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:47,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:20:47,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:47,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:20:47,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:47,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:47,204 INFO L378 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 29 treesize of output 21 [2025-03-04 02:20:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:47,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:47,262 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:47,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:20:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:47,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702179429] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:47,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:47,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 17 [2025-03-04 02:20:47,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317441961] [2025-03-04 02:20:47,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:47,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:47,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:47,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:47,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:20:47,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:47,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 183 transitions, 3243 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:47,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:47,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:47,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:47,627 INFO L124 PetriNetUnfolderBase]: 1151/1987 cut-off events. [2025-03-04 02:20:47,627 INFO L125 PetriNetUnfolderBase]: For 21943/22007 co-relation queries the response was YES. [2025-03-04 02:20:47,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14140 conditions, 1987 events. 1151/1987 cut-off events. For 21943/22007 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10819 event pairs, 393 based on Foata normal form. 10/1997 useless extension candidates. Maximal degree in co-relation 14068. Up to 1265 conditions per place. [2025-03-04 02:20:47,638 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 158 selfloop transitions, 71 changer transitions 0/232 dead transitions. [2025-03-04 02:20:47,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 232 transitions, 4199 flow [2025-03-04 02:20:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2025-03-04 02:20:47,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-03-04 02:20:47,639 INFO L175 Difference]: Start difference. First operand has 204 places, 183 transitions, 3243 flow. Second operand 9 states and 126 transitions. [2025-03-04 02:20:47,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 232 transitions, 4199 flow [2025-03-04 02:20:47,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 232 transitions, 4056 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:47,682 INFO L231 Difference]: Finished difference. Result has 210 places, 193 transitions, 3518 flow [2025-03-04 02:20:47,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3112, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3518, PETRI_PLACES=210, PETRI_TRANSITIONS=193} [2025-03-04 02:20:47,683 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2025-03-04 02:20:47,683 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 193 transitions, 3518 flow [2025-03-04 02:20:47,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:47,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:47,683 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] [2025-03-04 02:20:47,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 02:20:47,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:47,883 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:47,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2031817144, now seen corresponding path program 16 times [2025-03-04 02:20:47,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:47,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388062288] [2025-03-04 02:20:47,884 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:47,888 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:47,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-03-04 02:20:47,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:47,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:47,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388062288] [2025-03-04 02:20:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388062288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:47,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:47,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:20:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925930898] [2025-03-04 02:20:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:47,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:47,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:47,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:47,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:47,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 193 transitions, 3518 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:47,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:47,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:47,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:48,189 INFO L124 PetriNetUnfolderBase]: 1141/1979 cut-off events. [2025-03-04 02:20:48,190 INFO L125 PetriNetUnfolderBase]: For 21564/21624 co-relation queries the response was YES. [2025-03-04 02:20:48,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13978 conditions, 1979 events. 1141/1979 cut-off events. For 21564/21624 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10845 event pairs, 404 based on Foata normal form. 10/1989 useless extension candidates. Maximal degree in co-relation 13902. Up to 1346 conditions per place. [2025-03-04 02:20:48,204 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 142 selfloop transitions, 71 changer transitions 1/217 dead transitions. [2025-03-04 02:20:48,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 217 transitions, 4125 flow [2025-03-04 02:20:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-03-04 02:20:48,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4327731092436975 [2025-03-04 02:20:48,204 INFO L175 Difference]: Start difference. First operand has 210 places, 193 transitions, 3518 flow. Second operand 7 states and 103 transitions. [2025-03-04 02:20:48,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 217 transitions, 4125 flow [2025-03-04 02:20:48,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 217 transitions, 3951 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:48,254 INFO L231 Difference]: Finished difference. Result has 210 places, 193 transitions, 3473 flow [2025-03-04 02:20:48,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3309, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3473, PETRI_PLACES=210, PETRI_TRANSITIONS=193} [2025-03-04 02:20:48,255 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2025-03-04 02:20:48,255 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 193 transitions, 3473 flow [2025-03-04 02:20:48,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:48,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:48,255 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] [2025-03-04 02:20:48,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-04 02:20:48,255 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:48,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1592830430, now seen corresponding path program 12 times [2025-03-04 02:20:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870896073] [2025-03-04 02:20:48,255 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:48,260 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:48,267 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:48,268 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:20:48,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870896073] [2025-03-04 02:20:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870896073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179610840] [2025-03-04 02:20:48,459 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:48,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:48,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:48,461 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:48,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 02:20:48,526 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:48,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:48,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:20:48,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:48,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:20:48,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:48,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:48,621 INFO L378 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 29 treesize of output 21 [2025-03-04 02:20:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:48,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:48,713 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 02:20:48,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 02:20:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179610840] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:48,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 18 [2025-03-04 02:20:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143447875] [2025-03-04 02:20:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:48,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:48,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:48,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 02:20:48,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:48,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 193 transitions, 3473 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:48,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:48,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:48,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:49,153 INFO L124 PetriNetUnfolderBase]: 1211/2121 cut-off events. [2025-03-04 02:20:49,153 INFO L125 PetriNetUnfolderBase]: For 20957/21017 co-relation queries the response was YES. [2025-03-04 02:20:49,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14578 conditions, 2121 events. 1211/2121 cut-off events. For 20957/21017 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11926 event pairs, 313 based on Foata normal form. 16/2137 useless extension candidates. Maximal degree in co-relation 14504. Up to 1171 conditions per place. [2025-03-04 02:20:49,169 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 180 selfloop transitions, 78 changer transitions 0/261 dead transitions. [2025-03-04 02:20:49,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 261 transitions, 4497 flow [2025-03-04 02:20:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2025-03-04 02:20:49,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 02:20:49,169 INFO L175 Difference]: Start difference. First operand has 210 places, 193 transitions, 3473 flow. Second operand 11 states and 153 transitions. [2025-03-04 02:20:49,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 261 transitions, 4497 flow [2025-03-04 02:20:49,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 261 transitions, 4311 flow, removed 5 selfloop flow, removed 13 redundant places. [2025-03-04 02:20:49,219 INFO L231 Difference]: Finished difference. Result has 210 places, 198 transitions, 3574 flow [2025-03-04 02:20:49,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3293, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3574, PETRI_PLACES=210, PETRI_TRANSITIONS=198} [2025-03-04 02:20:49,221 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2025-03-04 02:20:49,221 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 198 transitions, 3574 flow [2025-03-04 02:20:49,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:49,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:49,221 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] [2025-03-04 02:20:49,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 02:20:49,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2025-03-04 02:20:49,421 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:49,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1026026496, now seen corresponding path program 13 times [2025-03-04 02:20:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:49,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623034902] [2025-03-04 02:20:49,422 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:49,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:49,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:49,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:49,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:49,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:49,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623034902] [2025-03-04 02:20:49,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623034902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:49,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:49,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875241416] [2025-03-04 02:20:49,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:49,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:49,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:49,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:49,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:49,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:49,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 198 transitions, 3574 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:49,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:49,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:49,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:49,870 INFO L124 PetriNetUnfolderBase]: 1201/2113 cut-off events. [2025-03-04 02:20:49,870 INFO L125 PetriNetUnfolderBase]: For 19838/19896 co-relation queries the response was YES. [2025-03-04 02:20:49,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14489 conditions, 2113 events. 1201/2113 cut-off events. For 19838/19896 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11954 event pairs, 321 based on Foata normal form. 10/2123 useless extension candidates. Maximal degree in co-relation 14421. Up to 1164 conditions per place. [2025-03-04 02:20:49,885 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 153 selfloop transitions, 67 changer transitions 17/240 dead transitions. [2025-03-04 02:20:49,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 240 transitions, 4256 flow [2025-03-04 02:20:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:20:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:20:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2025-03-04 02:20:49,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2025-03-04 02:20:49,886 INFO L175 Difference]: Start difference. First operand has 210 places, 198 transitions, 3574 flow. Second operand 12 states and 141 transitions. [2025-03-04 02:20:49,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 240 transitions, 4256 flow [2025-03-04 02:20:49,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 240 transitions, 4110 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-04 02:20:49,941 INFO L231 Difference]: Finished difference. Result has 217 places, 187 transitions, 3335 flow [2025-03-04 02:20:49,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3356, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3335, PETRI_PLACES=217, PETRI_TRANSITIONS=187} [2025-03-04 02:20:49,942 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2025-03-04 02:20:49,942 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 187 transitions, 3335 flow [2025-03-04 02:20:49,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:49,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:49,942 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] [2025-03-04 02:20:49,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-04 02:20:49,942 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:49,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:49,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1107637894, now seen corresponding path program 14 times [2025-03-04 02:20:49,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:49,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500207192] [2025-03-04 02:20:49,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:49,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:49,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:49,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:49,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:50,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:50,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500207192] [2025-03-04 02:20:50,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500207192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:50,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:50,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:50,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304807001] [2025-03-04 02:20:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:50,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:50,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:50,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:50,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:50,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 187 transitions, 3335 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:50,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:50,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:50,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:50,439 INFO L124 PetriNetUnfolderBase]: 1166/2044 cut-off events. [2025-03-04 02:20:50,439 INFO L125 PetriNetUnfolderBase]: For 19049/19111 co-relation queries the response was YES. [2025-03-04 02:20:50,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13999 conditions, 2044 events. 1166/2044 cut-off events. For 19049/19111 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11446 event pairs, 355 based on Foata normal form. 6/2050 useless extension candidates. Maximal degree in co-relation 13931. Up to 1362 conditions per place. [2025-03-04 02:20:50,451 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 133 selfloop transitions, 69 changer transitions 8/213 dead transitions. [2025-03-04 02:20:50,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 213 transitions, 3880 flow [2025-03-04 02:20:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2025-03-04 02:20:50,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3315508021390374 [2025-03-04 02:20:50,452 INFO L175 Difference]: Start difference. First operand has 217 places, 187 transitions, 3335 flow. Second operand 11 states and 124 transitions. [2025-03-04 02:20:50,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 213 transitions, 3880 flow [2025-03-04 02:20:50,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 213 transitions, 3723 flow, removed 3 selfloop flow, removed 11 redundant places. [2025-03-04 02:20:50,490 INFO L231 Difference]: Finished difference. Result has 207 places, 180 transitions, 3173 flow [2025-03-04 02:20:50,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3173, PETRI_PLACES=207, PETRI_TRANSITIONS=180} [2025-03-04 02:20:50,491 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2025-03-04 02:20:50,491 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 180 transitions, 3173 flow [2025-03-04 02:20:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:50,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:50,491 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] [2025-03-04 02:20:50,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-04 02:20:50,491 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:50,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1511431374, now seen corresponding path program 15 times [2025-03-04 02:20:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715231806] [2025-03-04 02:20:50,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:50,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:50,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:50,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:50,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:50,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715231806] [2025-03-04 02:20:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715231806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:50,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:50,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047434779] [2025-03-04 02:20:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:50,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:50,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:50,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:50,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:50,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 180 transitions, 3173 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:50,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:50,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:50,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:50,980 INFO L124 PetriNetUnfolderBase]: 1097/1907 cut-off events. [2025-03-04 02:20:50,980 INFO L125 PetriNetUnfolderBase]: For 17257/17315 co-relation queries the response was YES. [2025-03-04 02:20:50,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13184 conditions, 1907 events. 1097/1907 cut-off events. For 17257/17315 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10434 event pairs, 333 based on Foata normal form. 6/1913 useless extension candidates. Maximal degree in co-relation 13119. Up to 1276 conditions per place. [2025-03-04 02:20:50,993 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 129 selfloop transitions, 66 changer transitions 5/203 dead transitions. [2025-03-04 02:20:50,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 203 transitions, 3667 flow [2025-03-04 02:20:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-03-04 02:20:50,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3323529411764706 [2025-03-04 02:20:50,993 INFO L175 Difference]: Start difference. First operand has 207 places, 180 transitions, 3173 flow. Second operand 10 states and 113 transitions. [2025-03-04 02:20:50,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 203 transitions, 3667 flow [2025-03-04 02:20:51,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 203 transitions, 3539 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-03-04 02:20:51,033 INFO L231 Difference]: Finished difference. Result has 201 places, 175 transitions, 3048 flow [2025-03-04 02:20:51,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2964, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3048, PETRI_PLACES=201, PETRI_TRANSITIONS=175} [2025-03-04 02:20:51,033 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2025-03-04 02:20:51,033 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 175 transitions, 3048 flow [2025-03-04 02:20:51,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:51,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:51,033 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] [2025-03-04 02:20:51,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-04 02:20:51,033 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:51,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 421489776, now seen corresponding path program 17 times [2025-03-04 02:20:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788156716] [2025-03-04 02:20:51,034 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:51,038 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:51,042 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:51,042 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:51,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:51,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:51,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788156716] [2025-03-04 02:20:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788156716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568792314] [2025-03-04 02:20:51,169 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:51,170 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 02:20:51,225 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:51,240 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:51,240 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:51,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:20:51,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:51,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:51,309 INFO L378 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 29 treesize of output 21 [2025-03-04 02:20:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:51,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:20:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568792314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:20:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-04 02:20:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437559940] [2025-03-04 02:20:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:51,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:51,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:51,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:20:51,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:51,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 175 transitions, 3048 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:51,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:51,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:51,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:51,645 INFO L124 PetriNetUnfolderBase]: 1075/1874 cut-off events. [2025-03-04 02:20:51,645 INFO L125 PetriNetUnfolderBase]: For 16959/17015 co-relation queries the response was YES. [2025-03-04 02:20:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12894 conditions, 1874 events. 1075/1874 cut-off events. For 16959/17015 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10236 event pairs, 320 based on Foata normal form. 7/1881 useless extension candidates. Maximal degree in co-relation 12831. Up to 1247 conditions per place. [2025-03-04 02:20:51,657 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 128 selfloop transitions, 63 changer transitions 6/200 dead transitions. [2025-03-04 02:20:51,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 200 transitions, 3570 flow [2025-03-04 02:20:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-04 02:20:51,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32941176470588235 [2025-03-04 02:20:51,658 INFO L175 Difference]: Start difference. First operand has 201 places, 175 transitions, 3048 flow. Second operand 10 states and 112 transitions. [2025-03-04 02:20:51,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 200 transitions, 3570 flow [2025-03-04 02:20:51,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 200 transitions, 3406 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 02:20:51,697 INFO L231 Difference]: Finished difference. Result has 196 places, 171 transitions, 2906 flow [2025-03-04 02:20:51,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2834, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2906, PETRI_PLACES=196, PETRI_TRANSITIONS=171} [2025-03-04 02:20:51,697 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2025-03-04 02:20:51,697 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 171 transitions, 2906 flow [2025-03-04 02:20:51,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:51,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:51,698 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] [2025-03-04 02:20:51,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 02:20:51,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-03-04 02:20:51,898 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:51,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash 740881368, now seen corresponding path program 16 times [2025-03-04 02:20:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:51,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400381694] [2025-03-04 02:20:51,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:51,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:51,903 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-03-04 02:20:51,904 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:51,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:51,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400381694] [2025-03-04 02:20:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400381694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:51,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515875019] [2025-03-04 02:20:51,948 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:51,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:51,949 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:51,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 02:20:52,004 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:52,012 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-03-04 02:20:52,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:52,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:52,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 02:20:52,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:52,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:52,033 INFO L378 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 29 treesize of output 25 [2025-03-04 02:20:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:52,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:52,086 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:20:52,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:20:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:52,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515875019] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:52,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:20:52,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-03-04 02:20:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536527603] [2025-03-04 02:20:52,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:52,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:52,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:52,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:20:52,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:52,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 171 transitions, 2906 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:52,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:52,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:52,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:52,454 INFO L124 PetriNetUnfolderBase]: 1155/2031 cut-off events. [2025-03-04 02:20:52,454 INFO L125 PetriNetUnfolderBase]: For 19762/19818 co-relation queries the response was YES. [2025-03-04 02:20:52,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13732 conditions, 2031 events. 1155/2031 cut-off events. For 19762/19818 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11300 event pairs, 354 based on Foata normal form. 16/2047 useless extension candidates. Maximal degree in co-relation 13669. Up to 1244 conditions per place. [2025-03-04 02:20:52,466 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 150 selfloop transitions, 66 changer transitions 0/219 dead transitions. [2025-03-04 02:20:52,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 219 transitions, 3737 flow [2025-03-04 02:20:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2025-03-04 02:20:52,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2025-03-04 02:20:52,467 INFO L175 Difference]: Start difference. First operand has 196 places, 171 transitions, 2906 flow. Second operand 10 states and 137 transitions. [2025-03-04 02:20:52,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 219 transitions, 3737 flow [2025-03-04 02:20:52,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 219 transitions, 3595 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 02:20:52,503 INFO L231 Difference]: Finished difference. Result has 197 places, 177 transitions, 3040 flow [2025-03-04 02:20:52,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2774, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3040, PETRI_PLACES=197, PETRI_TRANSITIONS=177} [2025-03-04 02:20:52,503 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2025-03-04 02:20:52,503 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 177 transitions, 3040 flow [2025-03-04 02:20:52,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:52,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:52,504 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] [2025-03-04 02:20:52,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 02:20:52,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-03-04 02:20:52,704 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash -174200120, now seen corresponding path program 17 times [2025-03-04 02:20:52,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:52,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281015718] [2025-03-04 02:20:52,705 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:52,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:52,709 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:52,713 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:52,713 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:52,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:52,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281015718] [2025-03-04 02:20:52,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281015718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:52,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910811681] [2025-03-04 02:20:52,827 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:52,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:52,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:52,829 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:52,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 02:20:52,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:52,898 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:52,899 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:52,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:52,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:20:52,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:52,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:20:52,966 INFO L378 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 29 treesize of output 21 [2025-03-04 02:20:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:52,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:20:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910811681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:52,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:20:52,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-04 02:20:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374178670] [2025-03-04 02:20:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:52,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:52,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:52,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:52,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:20:52,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:52,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 177 transitions, 3040 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:52,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:52,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:52,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:53,270 INFO L124 PetriNetUnfolderBase]: 1139/2017 cut-off events. [2025-03-04 02:20:53,270 INFO L125 PetriNetUnfolderBase]: For 18266/18320 co-relation queries the response was YES. [2025-03-04 02:20:53,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13432 conditions, 2017 events. 1139/2017 cut-off events. For 18266/18320 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11296 event pairs, 395 based on Foata normal form. 16/2033 useless extension candidates. Maximal degree in co-relation 13368. Up to 1355 conditions per place. [2025-03-04 02:20:53,283 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 127 selfloop transitions, 68 changer transitions 1/199 dead transitions. [2025-03-04 02:20:53,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 199 transitions, 3547 flow [2025-03-04 02:20:53,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:20:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:20:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2025-03-04 02:20:53,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3660130718954248 [2025-03-04 02:20:53,284 INFO L175 Difference]: Start difference. First operand has 197 places, 177 transitions, 3040 flow. Second operand 9 states and 112 transitions. [2025-03-04 02:20:53,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 199 transitions, 3547 flow [2025-03-04 02:20:53,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 199 transitions, 3455 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-04 02:20:53,319 INFO L231 Difference]: Finished difference. Result has 200 places, 176 transitions, 3043 flow [2025-03-04 02:20:53,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2883, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3043, PETRI_PLACES=200, PETRI_TRANSITIONS=176} [2025-03-04 02:20:53,320 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 170 predicate places. [2025-03-04 02:20:53,320 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 176 transitions, 3043 flow [2025-03-04 02:20:53,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:53,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:53,320 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] [2025-03-04 02:20:53,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 02:20:53,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:53,520 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:53,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash 940753936, now seen corresponding path program 18 times [2025-03-04 02:20:53,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:53,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715860075] [2025-03-04 02:20:53,521 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:53,525 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:53,528 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:53,528 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:53,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:53,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:53,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715860075] [2025-03-04 02:20:53,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715860075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:53,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:53,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:53,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706823728] [2025-03-04 02:20:53,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:53,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:53,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:53,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:53,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:53,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:53,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 176 transitions, 3043 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:53,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:53,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:53,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:53,944 INFO L124 PetriNetUnfolderBase]: 1132/2010 cut-off events. [2025-03-04 02:20:53,945 INFO L125 PetriNetUnfolderBase]: For 17615/17667 co-relation queries the response was YES. [2025-03-04 02:20:53,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13340 conditions, 2010 events. 1132/2010 cut-off events. For 17615/17667 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11272 event pairs, 408 based on Foata normal form. 6/2016 useless extension candidates. Maximal degree in co-relation 13278. Up to 1345 conditions per place. [2025-03-04 02:20:53,957 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 119 selfloop transitions, 64 changer transitions 5/191 dead transitions. [2025-03-04 02:20:53,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 191 transitions, 3452 flow [2025-03-04 02:20:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-03-04 02:20:53,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3352941176470588 [2025-03-04 02:20:53,958 INFO L175 Difference]: Start difference. First operand has 200 places, 176 transitions, 3043 flow. Second operand 10 states and 114 transitions. [2025-03-04 02:20:53,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 191 transitions, 3452 flow [2025-03-04 02:20:53,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 191 transitions, 3356 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-03-04 02:20:53,991 INFO L231 Difference]: Finished difference. Result has 197 places, 172 transitions, 2977 flow [2025-03-04 02:20:53,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2896, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2977, PETRI_PLACES=197, PETRI_TRANSITIONS=172} [2025-03-04 02:20:53,992 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2025-03-04 02:20:53,992 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 172 transitions, 2977 flow [2025-03-04 02:20:53,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:53,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:53,992 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] [2025-03-04 02:20:53,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-04 02:20:53,992 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:53,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -853617604, now seen corresponding path program 19 times [2025-03-04 02:20:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:53,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252252096] [2025-03-04 02:20:53,992 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:53,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:54,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:54,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:54,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:54,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252252096] [2025-03-04 02:20:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252252096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413138737] [2025-03-04 02:20:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:54,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:54,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:54,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:54,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 172 transitions, 2977 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:54,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:54,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:54,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:54,401 INFO L124 PetriNetUnfolderBase]: 1070/1880 cut-off events. [2025-03-04 02:20:54,401 INFO L125 PetriNetUnfolderBase]: For 18172/18226 co-relation queries the response was YES. [2025-03-04 02:20:54,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12522 conditions, 1880 events. 1070/1880 cut-off events. For 18172/18226 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10317 event pairs, 368 based on Foata normal form. 6/1886 useless extension candidates. Maximal degree in co-relation 12468. Up to 1237 conditions per place. [2025-03-04 02:20:54,412 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 119 selfloop transitions, 58 changer transitions 8/188 dead transitions. [2025-03-04 02:20:54,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 188 transitions, 3358 flow [2025-03-04 02:20:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2025-03-04 02:20:54,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2025-03-04 02:20:54,413 INFO L175 Difference]: Start difference. First operand has 197 places, 172 transitions, 2977 flow. Second operand 11 states and 121 transitions. [2025-03-04 02:20:54,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 188 transitions, 3358 flow [2025-03-04 02:20:54,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 188 transitions, 3216 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:54,443 INFO L231 Difference]: Finished difference. Result has 196 places, 164 transitions, 2797 flow [2025-03-04 02:20:54,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2758, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2797, PETRI_PLACES=196, PETRI_TRANSITIONS=164} [2025-03-04 02:20:54,444 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2025-03-04 02:20:54,444 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 164 transitions, 2797 flow [2025-03-04 02:20:54,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:54,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:54,444 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] [2025-03-04 02:20:54,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-04 02:20:54,444 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:54,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1303469230, now seen corresponding path program 20 times [2025-03-04 02:20:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544642216] [2025-03-04 02:20:54,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:54,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:54,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:54,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:54,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:54,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:54,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:54,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544642216] [2025-03-04 02:20:54,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544642216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:54,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:54,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:54,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992440775] [2025-03-04 02:20:54,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:54,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:54,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:54,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:54,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:54,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:54,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 164 transitions, 2797 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:54,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:54,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:54,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:54,834 INFO L124 PetriNetUnfolderBase]: 1001/1741 cut-off events. [2025-03-04 02:20:54,834 INFO L125 PetriNetUnfolderBase]: For 17011/17063 co-relation queries the response was YES. [2025-03-04 02:20:54,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11765 conditions, 1741 events. 1001/1741 cut-off events. For 17011/17063 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9304 event pairs, 340 based on Foata normal form. 6/1747 useless extension candidates. Maximal degree in co-relation 11712. Up to 1151 conditions per place. [2025-03-04 02:20:54,845 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 109 selfloop transitions, 57 changer transitions 5/174 dead transitions. [2025-03-04 02:20:54,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 174 transitions, 3115 flow [2025-03-04 02:20:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2025-03-04 02:20:54,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3176470588235294 [2025-03-04 02:20:54,846 INFO L175 Difference]: Start difference. First operand has 196 places, 164 transitions, 2797 flow. Second operand 10 states and 108 transitions. [2025-03-04 02:20:54,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 174 transitions, 3115 flow [2025-03-04 02:20:54,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 174 transitions, 2889 flow, removed 0 selfloop flow, removed 14 redundant places. [2025-03-04 02:20:54,875 INFO L231 Difference]: Finished difference. Result has 187 places, 159 transitions, 2563 flow [2025-03-04 02:20:54,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2496, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2563, PETRI_PLACES=187, PETRI_TRANSITIONS=159} [2025-03-04 02:20:54,876 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2025-03-04 02:20:54,876 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 159 transitions, 2563 flow [2025-03-04 02:20:54,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:54,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:54,876 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] [2025-03-04 02:20:54,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-03-04 02:20:54,876 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -862225128, now seen corresponding path program 18 times [2025-03-04 02:20:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:54,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606968657] [2025-03-04 02:20:54,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:54,881 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:54,883 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:54,883 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:54,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606968657] [2025-03-04 02:20:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606968657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069863118] [2025-03-04 02:20:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:55,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:55,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:55,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:55,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:55,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:55,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 159 transitions, 2563 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:55,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:55,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:55,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:55,290 INFO L124 PetriNetUnfolderBase]: 999/1740 cut-off events. [2025-03-04 02:20:55,291 INFO L125 PetriNetUnfolderBase]: For 13505/13557 co-relation queries the response was YES. [2025-03-04 02:20:55,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11577 conditions, 1740 events. 999/1740 cut-off events. For 13505/13557 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9320 event pairs, 343 based on Foata normal form. 7/1747 useless extension candidates. Maximal degree in co-relation 11524. Up to 1151 conditions per place. [2025-03-04 02:20:55,301 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 109 selfloop transitions, 56 changer transitions 6/174 dead transitions. [2025-03-04 02:20:55,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 174 transitions, 2981 flow [2025-03-04 02:20:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2025-03-04 02:20:55,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3176470588235294 [2025-03-04 02:20:55,302 INFO L175 Difference]: Start difference. First operand has 187 places, 159 transitions, 2563 flow. Second operand 10 states and 108 transitions. [2025-03-04 02:20:55,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 174 transitions, 2981 flow [2025-03-04 02:20:55,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 2789 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 02:20:55,329 INFO L231 Difference]: Finished difference. Result has 179 places, 158 transitions, 2468 flow [2025-03-04 02:20:55,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2373, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2468, PETRI_PLACES=179, PETRI_TRANSITIONS=158} [2025-03-04 02:20:55,330 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2025-03-04 02:20:55,330 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 158 transitions, 2468 flow [2025-03-04 02:20:55,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:55,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:55,330 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] [2025-03-04 02:20:55,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-04 02:20:55,330 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1215364618, now seen corresponding path program 19 times [2025-03-04 02:20:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800937275] [2025-03-04 02:20:55,331 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:20:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:55,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:55,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:55,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:55,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800937275] [2025-03-04 02:20:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800937275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:55,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:55,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675716127] [2025-03-04 02:20:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:55,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:55,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:55,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:55,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:55,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 158 transitions, 2468 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:55,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:55,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:55,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:55,740 INFO L124 PetriNetUnfolderBase]: 942/1636 cut-off events. [2025-03-04 02:20:55,740 INFO L125 PetriNetUnfolderBase]: For 11676/11723 co-relation queries the response was YES. [2025-03-04 02:20:55,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10677 conditions, 1636 events. 942/1636 cut-off events. For 11676/11723 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8613 event pairs, 305 based on Foata normal form. 7/1643 useless extension candidates. Maximal degree in co-relation 10625. Up to 1060 conditions per place. [2025-03-04 02:20:55,750 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 111 selfloop transitions, 50 changer transitions 9/173 dead transitions. [2025-03-04 02:20:55,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 173 transitions, 2832 flow [2025-03-04 02:20:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:20:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:20:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2025-03-04 02:20:55,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31283422459893045 [2025-03-04 02:20:55,750 INFO L175 Difference]: Start difference. First operand has 179 places, 158 transitions, 2468 flow. Second operand 11 states and 117 transitions. [2025-03-04 02:20:55,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 173 transitions, 2832 flow [2025-03-04 02:20:55,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 173 transitions, 2713 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:55,774 INFO L231 Difference]: Finished difference. Result has 179 places, 151 transitions, 2326 flow [2025-03-04 02:20:55,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2312, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2326, PETRI_PLACES=179, PETRI_TRANSITIONS=151} [2025-03-04 02:20:55,774 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2025-03-04 02:20:55,774 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 151 transitions, 2326 flow [2025-03-04 02:20:55,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:55,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:55,774 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] [2025-03-04 02:20:55,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-03-04 02:20:55,774 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash 52856360, now seen corresponding path program 20 times [2025-03-04 02:20:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670247839] [2025-03-04 02:20:55,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:55,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:55,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 26 statements. [2025-03-04 02:20:55,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:55,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:55,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:55,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670247839] [2025-03-04 02:20:55,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670247839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:55,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:55,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:20:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644860207] [2025-03-04 02:20:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:55,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:20:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:55,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:20:55,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:20:55,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:55,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 151 transitions, 2326 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:55,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:55,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:55,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:56,129 INFO L124 PetriNetUnfolderBase]: 877/1515 cut-off events. [2025-03-04 02:20:56,129 INFO L125 PetriNetUnfolderBase]: For 10847/10891 co-relation queries the response was YES. [2025-03-04 02:20:56,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9992 conditions, 1515 events. 877/1515 cut-off events. For 10847/10891 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7785 event pairs, 278 based on Foata normal form. 7/1522 useless extension candidates. Maximal degree in co-relation 9940. Up to 969 conditions per place. [2025-03-04 02:20:56,139 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 106 selfloop transitions, 46 changer transitions 6/161 dead transitions. [2025-03-04 02:20:56,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 161 transitions, 2625 flow [2025-03-04 02:20:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2025-03-04 02:20:56,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31470588235294117 [2025-03-04 02:20:56,140 INFO L175 Difference]: Start difference. First operand has 179 places, 151 transitions, 2326 flow. Second operand 10 states and 107 transitions. [2025-03-04 02:20:56,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 161 transitions, 2625 flow [2025-03-04 02:20:56,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 161 transitions, 2491 flow, removed 3 selfloop flow, removed 14 redundant places. [2025-03-04 02:20:56,163 INFO L231 Difference]: Finished difference. Result has 171 places, 145 transitions, 2173 flow [2025-03-04 02:20:56,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2173, PETRI_PLACES=171, PETRI_TRANSITIONS=145} [2025-03-04 02:20:56,163 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 141 predicate places. [2025-03-04 02:20:56,163 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 145 transitions, 2173 flow [2025-03-04 02:20:56,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:56,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:56,164 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-03-04 02:20:56,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-03-04 02:20:56,164 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:56,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1021382022, now seen corresponding path program 1 times [2025-03-04 02:20:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698878997] [2025-03-04 02:20:56,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:56,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:20:56,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:56,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:56,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:20:56,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698878997] [2025-03-04 02:20:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698878997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410972800] [2025-03-04 02:20:56,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:56,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:56,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:56,351 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:56,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 02:20:56,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:20:56,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:56,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:56,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:56,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:20:56,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:56,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410972800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:56,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:56,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2025-03-04 02:20:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921292729] [2025-03-04 02:20:56,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:56,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 02:20:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:56,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 02:20:56,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:20:56,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-03-04 02:20:56,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 145 transitions, 2173 flow. Second operand has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 29 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:56,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:56,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-03-04 02:20:56,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:57,821 INFO L124 PetriNetUnfolderBase]: 2919/4984 cut-off events. [2025-03-04 02:20:57,821 INFO L125 PetriNetUnfolderBase]: For 35055/35120 co-relation queries the response was YES. [2025-03-04 02:20:57,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32010 conditions, 4984 events. 2919/4984 cut-off events. For 35055/35120 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 31827 event pairs, 493 based on Foata normal form. 9/4993 useless extension candidates. Maximal degree in co-relation 31962. Up to 996 conditions per place. [2025-03-04 02:20:57,851 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 439 selfloop transitions, 94 changer transitions 3/538 dead transitions. [2025-03-04 02:20:57,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 538 transitions, 8509 flow [2025-03-04 02:20:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 02:20:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 02:20:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 266 transitions. [2025-03-04 02:20:57,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2025-03-04 02:20:57,852 INFO L175 Difference]: Start difference. First operand has 171 places, 145 transitions, 2173 flow. Second operand 20 states and 266 transitions. [2025-03-04 02:20:57,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 538 transitions, 8509 flow [2025-03-04 02:20:57,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 538 transitions, 8200 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:20:57,942 INFO L231 Difference]: Finished difference. Result has 186 places, 230 transitions, 3866 flow [2025-03-04 02:20:57,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3866, PETRI_PLACES=186, PETRI_TRANSITIONS=230} [2025-03-04 02:20:57,942 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2025-03-04 02:20:57,943 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 230 transitions, 3866 flow [2025-03-04 02:20:57,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 29 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:57,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:57,943 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-03-04 02:20:57,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-04 02:20:58,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:58,143 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:58,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2099364810, now seen corresponding path program 2 times [2025-03-04 02:20:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:58,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104236351] [2025-03-04 02:20:58,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:58,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:20:58,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 28 statements. [2025-03-04 02:20:58,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:58,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:20:58,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:58,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104236351] [2025-03-04 02:20:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104236351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:58,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:20:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682505428] [2025-03-04 02:20:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:58,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:20:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:58,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:20:58,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:20:58,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:58,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 230 transitions, 3866 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:58,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:58,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:58,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:58,996 INFO L124 PetriNetUnfolderBase]: 4274/7260 cut-off events. [2025-03-04 02:20:58,996 INFO L125 PetriNetUnfolderBase]: For 59862/60095 co-relation queries the response was YES. [2025-03-04 02:20:59,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50117 conditions, 7260 events. 4274/7260 cut-off events. For 59862/60095 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 49901 event pairs, 172 based on Foata normal form. 14/7274 useless extension candidates. Maximal degree in co-relation 50057. Up to 1670 conditions per place. [2025-03-04 02:20:59,065 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 343 selfloop transitions, 99 changer transitions 6/451 dead transitions. [2025-03-04 02:20:59,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 451 transitions, 8151 flow [2025-03-04 02:20:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:20:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:20:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-03-04 02:20:59,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43823529411764706 [2025-03-04 02:20:59,066 INFO L175 Difference]: Start difference. First operand has 186 places, 230 transitions, 3866 flow. Second operand 10 states and 149 transitions. [2025-03-04 02:20:59,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 451 transitions, 8151 flow [2025-03-04 02:20:59,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 451 transitions, 8082 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:59,279 INFO L231 Difference]: Finished difference. Result has 196 places, 276 transitions, 4833 flow [2025-03-04 02:20:59,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3811, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4833, PETRI_PLACES=196, PETRI_TRANSITIONS=276} [2025-03-04 02:20:59,279 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2025-03-04 02:20:59,279 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 276 transitions, 4833 flow [2025-03-04 02:20:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:59,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:59,280 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-03-04 02:20:59,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-03-04 02:20:59,280 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:20:59,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -374130679, now seen corresponding path program 1 times [2025-03-04 02:20:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:59,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357810215] [2025-03-04 02:20:59,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:59,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:20:59,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:20:59,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:59,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357810215] [2025-03-04 02:20:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357810215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:20:59,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157585799] [2025-03-04 02:20:59,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:59,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:20:59,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:20:59,324 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:20:59,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 02:20:59,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:20:59,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:20:59,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:59,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:59,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:20:59,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:20:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:59,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:20:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:20:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157585799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:20:59,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:20:59,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 02:20:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184519075] [2025-03-04 02:20:59,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:20:59,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:20:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:59,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:20:59,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:20:59,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:20:59,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 276 transitions, 4833 flow. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:20:59,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:59,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:20:59,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:00,610 INFO L124 PetriNetUnfolderBase]: 5159/9055 cut-off events. [2025-03-04 02:21:00,610 INFO L125 PetriNetUnfolderBase]: For 91648/91981 co-relation queries the response was YES. [2025-03-04 02:21:00,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66059 conditions, 9055 events. 5159/9055 cut-off events. For 91648/91981 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 67804 event pairs, 1310 based on Foata normal form. 316/9371 useless extension candidates. Maximal degree in co-relation 65996. Up to 2238 conditions per place. [2025-03-04 02:21:00,672 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 531 selfloop transitions, 137 changer transitions 23/694 dead transitions. [2025-03-04 02:21:00,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 694 transitions, 12294 flow [2025-03-04 02:21:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:21:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:21:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 245 transitions. [2025-03-04 02:21:00,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42387543252595156 [2025-03-04 02:21:00,673 INFO L175 Difference]: Start difference. First operand has 196 places, 276 transitions, 4833 flow. Second operand 17 states and 245 transitions. [2025-03-04 02:21:00,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 694 transitions, 12294 flow [2025-03-04 02:21:00,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 694 transitions, 11985 flow, removed 67 selfloop flow, removed 5 redundant places. [2025-03-04 02:21:00,991 INFO L231 Difference]: Finished difference. Result has 208 places, 331 transitions, 6419 flow [2025-03-04 02:21:00,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4300, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6419, PETRI_PLACES=208, PETRI_TRANSITIONS=331} [2025-03-04 02:21:00,991 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2025-03-04 02:21:00,991 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 331 transitions, 6419 flow [2025-03-04 02:21:00,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:00,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:00,992 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-03-04 02:21:00,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 02:21:01,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2025-03-04 02:21:01,192 INFO L396 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:21:01,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1583820439, now seen corresponding path program 3 times [2025-03-04 02:21:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174476982] [2025-03-04 02:21:01,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:21:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:01,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:01,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 28 statements. [2025-03-04 02:21:01,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:21:01,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:21:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174476982] [2025-03-04 02:21:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174476982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:21:01,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:21:01,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:21:01,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418523180] [2025-03-04 02:21:01,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:21:01,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:21:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:01,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:21:01,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:21:01,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:21:01,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 331 transitions, 6419 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:01,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:01,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:21:01,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:02,383 INFO L124 PetriNetUnfolderBase]: 5050/8923 cut-off events. [2025-03-04 02:21:02,383 INFO L125 PetriNetUnfolderBase]: For 104747/104982 co-relation queries the response was YES. [2025-03-04 02:21:02,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64825 conditions, 8923 events. 5050/8923 cut-off events. For 104747/104982 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 66695 event pairs, 179 based on Foata normal form. 40/8963 useless extension candidates. Maximal degree in co-relation 64760. Up to 2038 conditions per place. [2025-03-04 02:21:02,446 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 438 selfloop transitions, 89 changer transitions 6/536 dead transitions. [2025-03-04 02:21:02,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 536 transitions, 11483 flow [2025-03-04 02:21:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:21:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:21:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2025-03-04 02:21:02,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4150326797385621 [2025-03-04 02:21:02,446 INFO L175 Difference]: Start difference. First operand has 208 places, 331 transitions, 6419 flow. Second operand 9 states and 127 transitions. [2025-03-04 02:21:02,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 536 transitions, 11483 flow [2025-03-04 02:21:02,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 536 transitions, 10987 flow, removed 183 selfloop flow, removed 9 redundant places. [2025-03-04 02:21:02,834 INFO L231 Difference]: Finished difference. Result has 209 places, 338 transitions, 6446 flow [2025-03-04 02:21:02,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6082, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6446, PETRI_PLACES=209, PETRI_TRANSITIONS=338} [2025-03-04 02:21:02,835 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2025-03-04 02:21:02,835 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 338 transitions, 6446 flow [2025-03-04 02:21:02,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:02,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:02,835 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-03-04 02:21:02,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-03-04 02:21:02,835 INFO L396 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:21:02,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1831651735, now seen corresponding path program 4 times [2025-03-04 02:21:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:02,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322523703] [2025-03-04 02:21:02,836 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:21:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:02,840 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:02,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:21:02,843 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:21:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:03,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322523703] [2025-03-04 02:21:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322523703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:03,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393100419] [2025-03-04 02:21:03,028 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:21:03,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:03,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:03,030 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:03,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 02:21:03,091 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:03,105 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:21:03,106 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:21:03,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:03,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:21:03,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:03,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:21:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393100419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:04,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-04 02:21:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944032555] [2025-03-04 02:21:04,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:04,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 02:21:04,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:04,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 02:21:04,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2025-03-04 02:21:04,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-03-04 02:21:04,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 338 transitions, 6446 flow. Second operand has 32 states, 32 states have (on average 6.4375) internal successors, (206), 32 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:04,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:04,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-03-04 02:21:04,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:07,438 INFO L124 PetriNetUnfolderBase]: 7730/13207 cut-off events. [2025-03-04 02:21:07,438 INFO L125 PetriNetUnfolderBase]: For 152944/153046 co-relation queries the response was YES. [2025-03-04 02:21:07,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93737 conditions, 13207 events. 7730/13207 cut-off events. For 152944/153046 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 99015 event pairs, 765 based on Foata normal form. 7/13214 useless extension candidates. Maximal degree in co-relation 93673. Up to 2704 conditions per place. [2025-03-04 02:21:07,569 INFO L140 encePairwiseOnDemand]: 18/34 looper letters, 1123 selfloop transitions, 303 changer transitions 54/1482 dead transitions. [2025-03-04 02:21:07,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1482 transitions, 25769 flow [2025-03-04 02:21:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-04 02:21:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-03-04 02:21:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 688 transitions. [2025-03-04 02:21:07,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3747276688453159 [2025-03-04 02:21:07,571 INFO L175 Difference]: Start difference. First operand has 209 places, 338 transitions, 6446 flow. Second operand 54 states and 688 transitions. [2025-03-04 02:21:07,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1482 transitions, 25769 flow [2025-03-04 02:21:08,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1482 transitions, 25595 flow, removed 31 selfloop flow, removed 2 redundant places. [2025-03-04 02:21:08,327 INFO L231 Difference]: Finished difference. Result has 285 places, 553 transitions, 11112 flow [2025-03-04 02:21:08,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6381, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=11112, PETRI_PLACES=285, PETRI_TRANSITIONS=553} [2025-03-04 02:21:08,327 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 255 predicate places. [2025-03-04 02:21:08,327 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 553 transitions, 11112 flow [2025-03-04 02:21:08,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.4375) internal successors, (206), 32 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:08,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:21:08,327 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-03-04 02:21:08,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-04 02:21:08,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:08,528 INFO L396 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:21:08,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:21:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1336867386, now seen corresponding path program 5 times [2025-03-04 02:21:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:21:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114642267] [2025-03-04 02:21:08,528 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:21:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:21:08,533 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:08,536 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:21:08,536 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:21:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:08,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:21:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114642267] [2025-03-04 02:21:08,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114642267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:21:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808173188] [2025-03-04 02:21:08,661 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:21:08,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:21:08,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:21:08,663 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:21:08,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 02:21:08,730 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:21:08,746 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:21:08,746 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:21:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:21:08,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:21:08,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:21:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:08,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:21:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:21:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808173188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:21:09,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:21:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-04 02:21:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039622118] [2025-03-04 02:21:09,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:21:09,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 02:21:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:21:09,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 02:21:09,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:21:09,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2025-03-04 02:21:09,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 553 transitions, 11112 flow. Second operand has 29 states, 29 states have (on average 7.586206896551724) internal successors, (220), 29 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:21:09,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:21:09,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2025-03-04 02:21:09,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:21:13,194 INFO L124 PetriNetUnfolderBase]: 11051/19466 cut-off events. [2025-03-04 02:21:13,194 INFO L125 PetriNetUnfolderBase]: For 307526/308077 co-relation queries the response was YES. [2025-03-04 02:21:13,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154456 conditions, 19466 events. 11051/19466 cut-off events. For 307526/308077 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 161638 event pairs, 1346 based on Foata normal form. 31/19497 useless extension candidates. Maximal degree in co-relation 154367. Up to 4094 conditions per place. [2025-03-04 02:21:13,388 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 1274 selfloop transitions, 263 changer transitions 35/1579 dead transitions. [2025-03-04 02:21:13,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1579 transitions, 32128 flow [2025-03-04 02:21:13,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 02:21:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 02:21:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 508 transitions. [2025-03-04 02:21:13,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4150326797385621 [2025-03-04 02:21:13,390 INFO L175 Difference]: Start difference. First operand has 285 places, 553 transitions, 11112 flow. Second operand 36 states and 508 transitions. [2025-03-04 02:21:13,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 1579 transitions, 32128 flow