./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:00:41,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:00:41,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:00:41,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:00:41,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:00:41,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:00:41,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:00:41,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:00:41,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:00:41,206 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:00:41,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:00:41,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:00:41,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:00:41,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:00:41,208 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:00:41,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:00:41,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:00:41,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:00:41,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:00:41,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:00:41,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:00:41,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:00:41,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:00:41,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:00:41,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:00:41,211 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-03-14 01:00:41,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:00:41,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:00:41,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:00:41,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:00:41,429 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:00:41,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-14 01:00:42,537 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/005257c10/6dd3c52720e3456ba15b66968b526999/FLAGef6be1a18 [2025-03-14 01:00:42,761 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:00:42,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-14 01:00:42,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/005257c10/6dd3c52720e3456ba15b66968b526999/FLAGef6be1a18 [2025-03-14 01:00:43,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/005257c10/6dd3c52720e3456ba15b66968b526999 [2025-03-14 01:00:43,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:00:43,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:00:43,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:00:43,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:00:43,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:00:43,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117f757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43, skipping insertion in model container [2025-03-14 01:00:43,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:00:43,254 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-chromosome-subst.wvr.c[3136,3149] [2025-03-14 01:00:43,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:00:43,278 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:00:43,299 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-chromosome-subst.wvr.c[3136,3149] [2025-03-14 01:00:43,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:00:43,313 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:00:43,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43 WrapperNode [2025-03-14 01:00:43,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:00:43,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:00:43,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:00:43,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:00:43,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,344 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 253 [2025-03-14 01:00:43,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:00:43,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:00:43,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:00:43,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:00:43,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,370 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-14 01:00:43,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:00:43,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:00:43,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:00:43,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:00:43,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (1/1) ... [2025-03-14 01:00:43,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:00:43,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:43,410 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-14 01:00:43,412 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-14 01:00:43,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:00:43,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:00:43,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:00:43,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:00:43,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:00:43,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:00:43,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:00:43,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:00:43,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:00:43,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:00:43,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:00:43,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:00:43,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:00:43,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:00:43,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:00:43,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:00:43,432 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:00:43,518 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:00:43,519 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:00:43,910 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:00:43,911 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:00:43,911 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:00:44,214 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:00:44,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:00:44 BoogieIcfgContainer [2025-03-14 01:00:44,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:00:44,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:00:44,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:00:44,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:00:44,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:00:43" (1/3) ... [2025-03-14 01:00:44,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288fe130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:00:44, skipping insertion in model container [2025-03-14 01:00:44,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:00:43" (2/3) ... [2025-03-14 01:00:44,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288fe130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:00:44, skipping insertion in model container [2025-03-14 01:00:44,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:00:44" (3/3) ... [2025-03-14 01:00:44,222 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-03-14 01:00:44,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:00:44,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 01:00:44,234 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:00:44,281 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:00:44,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-03-14 01:00:44,336 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-03-14 01:00:44,338 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:00:44,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-03-14 01:00:44,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-03-14 01:00:44,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-03-14 01:00:44,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:00:44,365 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;@3fbed017, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:00:44,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:00:44,379 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:00:44,379 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-14 01:00:44,379 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:00:44,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:44,380 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-14 01:00:44,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:44,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2130209362, now seen corresponding path program 1 times [2025-03-14 01:00:44,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375794583] [2025-03-14 01:00:44,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:44,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 01:00:44,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 01:00:44,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:44,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:44,867 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-14 01:00:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:44,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375794583] [2025-03-14 01:00:44,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375794583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:44,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:44,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:00:44,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518108964] [2025-03-14 01:00:44,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:44,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:00:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:44,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:00:44,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:00:44,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:44,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 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-14 01:00:44,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:44,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:44,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:45,087 INFO L124 PetriNetUnfolderBase]: 341/503 cut-off events. [2025-03-14 01:00:45,087 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-14 01:00:45,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 503 events. 341/503 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1551 event pairs, 124 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 890. Up to 299 conditions per place. [2025-03-14 01:00:45,095 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 36 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2025-03-14 01:00:45,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 203 flow [2025-03-14 01:00:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:00:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:00:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-14 01:00:45,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2025-03-14 01:00:45,105 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 55 transitions. [2025-03-14 01:00:45,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 203 flow [2025-03-14 01:00:45,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:00:45,110 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2025-03-14 01:00:45,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2025-03-14 01:00:45,115 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-03-14 01:00:45,115 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2025-03-14 01:00:45,116 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-14 01:00:45,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:45,116 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-14 01:00:45,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:00:45,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1412122613, now seen corresponding path program 1 times [2025-03-14 01:00:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797180072] [2025-03-14 01:00:45,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:45,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:45,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:00:45,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:00:45,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:45,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:45,258 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-14 01:00:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:45,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797180072] [2025-03-14 01:00:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797180072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:45,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:45,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:00:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016218684] [2025-03-14 01:00:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:45,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:00:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:45,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:00:45,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:00:45,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:45,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:45,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:45,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:45,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:45,366 INFO L124 PetriNetUnfolderBase]: 341/506 cut-off events. [2025-03-14 01:00:45,366 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2025-03-14 01:00:45,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 506 events. 341/506 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1400 event pairs, 228 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 437. Up to 503 conditions per place. [2025-03-14 01:00:45,368 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 24 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2025-03-14 01:00:45,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 138 flow [2025-03-14 01:00:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:00:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:00:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-14 01:00:45,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-14 01:00:45,369 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 3 states and 44 transitions. [2025-03-14 01:00:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 138 flow [2025-03-14 01:00:45,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:00:45,371 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 102 flow [2025-03-14 01:00:45,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2025-03-14 01:00:45,371 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-03-14 01:00:45,371 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 102 flow [2025-03-14 01:00:45,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:45,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:45,372 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-14 01:00:45,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:00:45,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:45,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1644772774, now seen corresponding path program 1 times [2025-03-14 01:00:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:45,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863160512] [2025-03-14 01:00:45,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:45,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:00:45,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:00:45,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:45,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:00:45,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863160512] [2025-03-14 01:00:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863160512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038678883] [2025-03-14 01:00:45,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:45,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:45,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:45,473 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-14 01:00:45,475 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-14 01:00:45,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:00:45,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:00:45,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:45,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:45,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-14 01:00:45,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:00:45,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:00:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038678883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:45,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-14 01:00:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724398503] [2025-03-14 01:00:45,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:45,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:00:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:45,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:00:45,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:00:45,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:45,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 102 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-14 01:00:45,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:45,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:45,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:45,793 INFO L124 PetriNetUnfolderBase]: 341/515 cut-off events. [2025-03-14 01:00:45,793 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-14 01:00:45,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 515 events. 341/515 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1400 event pairs, 228 based on Foata normal form. 6/436 useless extension candidates. Maximal degree in co-relation 1106. Up to 503 conditions per place. [2025-03-14 01:00:45,797 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 24 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2025-03-14 01:00:45,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 216 flow [2025-03-14 01:00:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:00:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:00:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-03-14 01:00:45,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2025-03-14 01:00:45,801 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 102 flow. Second operand 6 states and 71 transitions. [2025-03-14 01:00:45,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 216 flow [2025-03-14 01:00:45,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:00:45,803 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 192 flow [2025-03-14 01:00:45,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-03-14 01:00:45,804 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-14 01:00:45,804 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 192 flow [2025-03-14 01:00:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-14 01:00:45,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:45,804 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:45,811 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-14 01:00:46,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:46,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:46,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -474163093, now seen corresponding path program 2 times [2025-03-14 01:00:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758806378] [2025-03-14 01:00:46,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:46,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-14 01:00:46,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 34 statements. [2025-03-14 01:00:46,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:00:46,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-14 01:00:46,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:46,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758806378] [2025-03-14 01:00:46,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758806378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:46,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:46,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:00:46,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365869070] [2025-03-14 01:00:46,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:46,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:00:46,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:46,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:00:46,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:00:46,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:46,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:46,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:46,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:46,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:46,657 INFO L124 PetriNetUnfolderBase]: 681/1011 cut-off events. [2025-03-14 01:00:46,657 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-14 01:00:46,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2260 conditions, 1011 events. 681/1011 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3584 event pairs, 228 based on Foata normal form. 1/804 useless extension candidates. Maximal degree in co-relation 2171. Up to 539 conditions per place. [2025-03-14 01:00:46,662 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 61 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2025-03-14 01:00:46,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 68 transitions, 403 flow [2025-03-14 01:00:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:00:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:00:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-14 01:00:46,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2025-03-14 01:00:46,663 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 192 flow. Second operand 4 states and 69 transitions. [2025-03-14 01:00:46,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 68 transitions, 403 flow [2025-03-14 01:00:46,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 379 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-14 01:00:46,666 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 201 flow [2025-03-14 01:00:46,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2025-03-14 01:00:46,666 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2025-03-14 01:00:46,666 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 201 flow [2025-03-14 01:00:46,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:46,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:46,667 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:46,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:00:46,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:46,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash 863113697, now seen corresponding path program 3 times [2025-03-14 01:00:46,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:46,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240817834] [2025-03-14 01:00:46,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:46,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:46,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-03-14 01:00:46,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 34 statements. [2025-03-14 01:00:46,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:00:46,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-14 01:00:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240817834] [2025-03-14 01:00:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240817834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:00:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685192730] [2025-03-14 01:00:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:00:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:47,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:00:47,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:00:47,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:47,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:47,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:47,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:47,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:47,323 INFO L124 PetriNetUnfolderBase]: 979/1443 cut-off events. [2025-03-14 01:00:47,325 INFO L125 PetriNetUnfolderBase]: For 694/694 co-relation queries the response was YES. [2025-03-14 01:00:47,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1443 events. 979/1443 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5435 event pairs, 380 based on Foata normal form. 1/1442 useless extension candidates. Maximal degree in co-relation 3696. Up to 862 conditions per place. [2025-03-14 01:00:47,331 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 61 selfloop transitions, 7 changer transitions 1/70 dead transitions. [2025-03-14 01:00:47,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 425 flow [2025-03-14 01:00:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:00:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:00:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-14 01:00:47,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2025-03-14 01:00:47,333 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 201 flow. Second operand 4 states and 67 transitions. [2025-03-14 01:00:47,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 425 flow [2025-03-14 01:00:47,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:00:47,337 INFO L231 Difference]: Finished difference. Result has 46 places, 48 transitions, 250 flow [2025-03-14 01:00:47,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=46, PETRI_TRANSITIONS=48} [2025-03-14 01:00:47,339 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2025-03-14 01:00:47,339 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 48 transitions, 250 flow [2025-03-14 01:00:47,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:47,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:47,340 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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-14 01:00:47,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:00:47,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:47,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -261290427, now seen corresponding path program 1 times [2025-03-14 01:00:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:47,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576207098] [2025-03-14 01:00:47,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:47,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:00:47,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:00:47,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:47,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:00:47,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:47,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576207098] [2025-03-14 01:00:47,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576207098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:47,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399681398] [2025-03-14 01:00:47,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:47,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:47,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:47,517 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-14 01:00:47,519 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-14 01:00:47,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:00:47,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:00:47,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:47,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:47,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:00:47,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:00:47,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:00:47,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399681398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:47,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:47,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-14 01:00:47,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077357750] [2025-03-14 01:00:47,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:47,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 01:00:47,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:47,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 01:00:47,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-03-14 01:00:47,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:47,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 48 transitions, 250 flow. Second operand has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-14 01:00:47,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:47,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:47,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:47,968 INFO L124 PetriNetUnfolderBase]: 979/1446 cut-off events. [2025-03-14 01:00:47,968 INFO L125 PetriNetUnfolderBase]: For 1559/1559 co-relation queries the response was YES. [2025-03-14 01:00:47,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1446 events. 979/1446 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5373 event pairs, 672 based on Foata normal form. 1/1445 useless extension candidates. Maximal degree in co-relation 4195. Up to 1429 conditions per place. [2025-03-14 01:00:47,974 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2025-03-14 01:00:47,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 368 flow [2025-03-14 01:00:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-03-14 01:00:47,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3317972350230415 [2025-03-14 01:00:47,975 INFO L175 Difference]: Start difference. First operand has 46 places, 48 transitions, 250 flow. Second operand 7 states and 72 transitions. [2025-03-14 01:00:47,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 368 flow [2025-03-14 01:00:47,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 366 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:00:47,978 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 316 flow [2025-03-14 01:00:47,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-14 01:00:47,979 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2025-03-14 01:00:47,979 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 316 flow [2025-03-14 01:00:47,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 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-14 01:00:47,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:47,979 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:47,986 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-14 01:00:48,180 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-14 01:00:48,180 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:48,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1854521258, now seen corresponding path program 2 times [2025-03-14 01:00:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:48,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968402854] [2025-03-14 01:00:48,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:48,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:48,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:00:48,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:48,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:48,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968402854] [2025-03-14 01:00:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968402854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625860447] [2025-03-14 01:00:48,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:48,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:48,437 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-14 01:00:48,438 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-14 01:00:48,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:00:48,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:48,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:48,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:48,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:00:48,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:48,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:48,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625860447] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:48,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:48,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-03-14 01:00:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553047008] [2025-03-14 01:00:48,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:48,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:48,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:48,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:48,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:48,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:48,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 316 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-14 01:00:48,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:48,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:48,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:48,933 INFO L124 PetriNetUnfolderBase]: 1039/1532 cut-off events. [2025-03-14 01:00:48,934 INFO L125 PetriNetUnfolderBase]: For 1322/1322 co-relation queries the response was YES. [2025-03-14 01:00:48,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 1532 events. 1039/1532 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6126 event pairs, 108 based on Foata normal form. 26/1558 useless extension candidates. Maximal degree in co-relation 4449. Up to 645 conditions per place. [2025-03-14 01:00:48,940 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 77 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2025-03-14 01:00:48,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 617 flow [2025-03-14 01:00:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-03-14 01:00:48,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5225806451612903 [2025-03-14 01:00:48,941 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 316 flow. Second operand 5 states and 81 transitions. [2025-03-14 01:00:48,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 617 flow [2025-03-14 01:00:48,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 581 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:48,947 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 327 flow [2025-03-14 01:00:48,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2025-03-14 01:00:48,948 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-03-14 01:00:48,949 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 327 flow [2025-03-14 01:00:48,949 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-14 01:00:48,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:48,949 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:48,956 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-14 01:00:49,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:49,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:49,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1967193479, now seen corresponding path program 1 times [2025-03-14 01:00:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427795489] [2025-03-14 01:00:49,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:49,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:00:49,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:49,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:49,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427795489] [2025-03-14 01:00:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427795489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944553437] [2025-03-14 01:00:49,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:49,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:49,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:49,381 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-14 01:00:49,382 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-14 01:00:49,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:00:49,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:49,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:49,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:49,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:00:49,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-14 01:00:49,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:49,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944553437] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:49,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:49,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 8] total 12 [2025-03-14 01:00:49,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200703956] [2025-03-14 01:00:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:49,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:00:49,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:49,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:00:49,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:00:49,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:49,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-14 01:00:49,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:49,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:49,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:49,961 INFO L124 PetriNetUnfolderBase]: 1595/2380 cut-off events. [2025-03-14 01:00:49,962 INFO L125 PetriNetUnfolderBase]: For 4277/4277 co-relation queries the response was YES. [2025-03-14 01:00:49,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7781 conditions, 2380 events. 1595/2380 cut-off events. For 4277/4277 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10824 event pairs, 318 based on Foata normal form. 1/2381 useless extension candidates. Maximal degree in co-relation 7679. Up to 1194 conditions per place. [2025-03-14 01:00:49,972 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 92 selfloop transitions, 25 changer transitions 3/121 dead transitions. [2025-03-14 01:00:49,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 121 transitions, 932 flow [2025-03-14 01:00:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:00:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:00:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2025-03-14 01:00:49,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2025-03-14 01:00:49,974 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 327 flow. Second operand 6 states and 103 transitions. [2025-03-14 01:00:49,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 121 transitions, 932 flow [2025-03-14 01:00:49,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 892 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:49,981 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 555 flow [2025-03-14 01:00:49,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2025-03-14 01:00:49,982 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2025-03-14 01:00:49,982 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 555 flow [2025-03-14 01:00:49,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-14 01:00:49,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:49,982 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:49,989 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-14 01:00:50,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:50,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:50,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash -465585541, now seen corresponding path program 2 times [2025-03-14 01:00:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:50,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443459246] [2025-03-14 01:00:50,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:50,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:50,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:00:50,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:50,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:50,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443459246] [2025-03-14 01:00:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443459246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730222833] [2025-03-14 01:00:50,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:50,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:50,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:50,394 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-14 01:00:50,396 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-14 01:00:50,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:00:50,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:50,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:50,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:50,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:00:50,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:50,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730222833] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-03-14 01:00:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279130421] [2025-03-14 01:00:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:50,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:50,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:00:50,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:50,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 555 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-14 01:00:50,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:50,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:50,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:50,961 INFO L124 PetriNetUnfolderBase]: 1595/2374 cut-off events. [2025-03-14 01:00:50,962 INFO L125 PetriNetUnfolderBase]: For 6355/6355 co-relation queries the response was YES. [2025-03-14 01:00:50,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9368 conditions, 2374 events. 1595/2374 cut-off events. For 6355/6355 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10374 event pairs, 340 based on Foata normal form. 40/2414 useless extension candidates. Maximal degree in co-relation 9260. Up to 994 conditions per place. [2025-03-14 01:00:50,976 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 79 selfloop transitions, 20 changer transitions 4/104 dead transitions. [2025-03-14 01:00:50,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 908 flow [2025-03-14 01:00:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-03-14 01:00:50,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2025-03-14 01:00:50,978 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 555 flow. Second operand 5 states and 77 transitions. [2025-03-14 01:00:50,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 908 flow [2025-03-14 01:00:50,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 104 transitions, 870 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:50,996 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 593 flow [2025-03-14 01:00:50,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=593, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2025-03-14 01:00:50,998 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2025-03-14 01:00:50,998 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 593 flow [2025-03-14 01:00:50,998 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-14 01:00:50,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:50,998 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:51,005 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-14 01:00:51,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:51,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:51,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash -569207445, now seen corresponding path program 3 times [2025-03-14 01:00:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939858205] [2025-03-14 01:00:51,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:51,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:51,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-03-14 01:00:51,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:51,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939858205] [2025-03-14 01:00:51,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939858205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449258375] [2025-03-14 01:00:51,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:51,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:51,365 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-14 01:00:51,367 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-14 01:00:51,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:51,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-03-14 01:00:51,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:51,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:51,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:00:51,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:51,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:00:51,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449258375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:51,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:00:51,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-14 01:00:51,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030971473] [2025-03-14 01:00:51,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:51,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:51,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:51,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:51,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:00:51,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:51,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 593 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-14 01:00:51,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:51,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:51,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:51,843 INFO L124 PetriNetUnfolderBase]: 1206/1790 cut-off events. [2025-03-14 01:00:51,843 INFO L125 PetriNetUnfolderBase]: For 6532/6532 co-relation queries the response was YES. [2025-03-14 01:00:51,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7361 conditions, 1790 events. 1206/1790 cut-off events. For 6532/6532 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7508 event pairs, 266 based on Foata normal form. 16/1806 useless extension candidates. Maximal degree in co-relation 7250. Up to 963 conditions per place. [2025-03-14 01:00:51,852 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 99 selfloop transitions, 10 changer transitions 16/126 dead transitions. [2025-03-14 01:00:51,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 126 transitions, 1152 flow [2025-03-14 01:00:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-14 01:00:51,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2025-03-14 01:00:51,854 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 593 flow. Second operand 5 states and 80 transitions. [2025-03-14 01:00:51,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 126 transitions, 1152 flow [2025-03-14 01:00:51,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 126 transitions, 1102 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:51,864 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 600 flow [2025-03-14 01:00:51,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=600, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2025-03-14 01:00:51,866 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2025-03-14 01:00:51,866 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 600 flow [2025-03-14 01:00:51,866 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-14 01:00:51,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:51,866 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:51,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 01:00:52,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:52,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:52,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 165115101, now seen corresponding path program 4 times [2025-03-14 01:00:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320872269] [2025-03-14 01:00:52,069 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:52,081 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:00:52,097 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:52,098 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:52,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:52,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320872269] [2025-03-14 01:00:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320872269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976800029] [2025-03-14 01:00:52,307 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:52,310 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-14 01:00:52,311 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-14 01:00:52,397 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:00:52,437 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:52,437 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:52,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:52,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:00:52,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:52,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976800029] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-14 01:00:52,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139289515] [2025-03-14 01:00:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:52,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:52,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:00:52,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:52,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 600 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-14 01:00:52,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:52,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:52,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:52,868 INFO L124 PetriNetUnfolderBase]: 1280/1896 cut-off events. [2025-03-14 01:00:52,869 INFO L125 PetriNetUnfolderBase]: For 6800/6800 co-relation queries the response was YES. [2025-03-14 01:00:52,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8153 conditions, 1896 events. 1280/1896 cut-off events. For 6800/6800 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7820 event pairs, 346 based on Foata normal form. 28/1920 useless extension candidates. Maximal degree in co-relation 8039. Up to 991 conditions per place. [2025-03-14 01:00:52,884 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 103 selfloop transitions, 14 changer transitions 1/119 dead transitions. [2025-03-14 01:00:52,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 1060 flow [2025-03-14 01:00:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-03-14 01:00:52,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5419354838709678 [2025-03-14 01:00:52,885 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 600 flow. Second operand 5 states and 84 transitions. [2025-03-14 01:00:52,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 1060 flow [2025-03-14 01:00:52,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 119 transitions, 1003 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:52,900 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 612 flow [2025-03-14 01:00:52,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=612, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2025-03-14 01:00:52,901 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2025-03-14 01:00:52,901 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 612 flow [2025-03-14 01:00:52,901 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-14 01:00:52,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:52,901 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:52,908 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-14 01:00:53,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:53,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:53,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1274790972, now seen corresponding path program 3 times [2025-03-14 01:00:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089898643] [2025-03-14 01:00:53,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:53,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:53,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-03-14 01:00:53,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:53,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:53,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:53,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089898643] [2025-03-14 01:00:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089898643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:53,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464618732] [2025-03-14 01:00:53,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:53,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:53,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:53,260 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-14 01:00:53,261 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-14 01:00:53,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:53,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-03-14 01:00:53,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:53,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:53,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:00:53,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:53,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:53,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464618732] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:53,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:53,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-14 01:00:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901526078] [2025-03-14 01:00:53,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:53,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:53,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:53,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:53,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:00:53,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:53,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 612 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-14 01:00:53,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:53,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:53,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:53,806 INFO L124 PetriNetUnfolderBase]: 1460/2172 cut-off events. [2025-03-14 01:00:53,807 INFO L125 PetriNetUnfolderBase]: For 6976/6976 co-relation queries the response was YES. [2025-03-14 01:00:53,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9009 conditions, 2172 events. 1460/2172 cut-off events. For 6976/6976 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9400 event pairs, 164 based on Foata normal form. 30/2028 useless extension candidates. Maximal degree in co-relation 8896. Up to 1486 conditions per place. [2025-03-14 01:00:53,820 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 102 selfloop transitions, 20 changer transitions 1/124 dead transitions. [2025-03-14 01:00:53,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 124 transitions, 1122 flow [2025-03-14 01:00:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-03-14 01:00:53,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2025-03-14 01:00:53,821 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 612 flow. Second operand 5 states and 79 transitions. [2025-03-14 01:00:53,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 124 transitions, 1122 flow [2025-03-14 01:00:53,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 1092 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:53,836 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 702 flow [2025-03-14 01:00:53,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=702, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2025-03-14 01:00:53,838 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2025-03-14 01:00:53,838 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 702 flow [2025-03-14 01:00:53,839 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-14 01:00:53,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:53,839 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:53,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-14 01:00:54,039 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,SelfDestructingSolverStorable11 [2025-03-14 01:00:54,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:54,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 941467387, now seen corresponding path program 5 times [2025-03-14 01:00:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:54,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940376473] [2025-03-14 01:00:54,040 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:54,053 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:54,075 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:54,076 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 01:00:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940376473] [2025-03-14 01:00:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940376473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943576339] [2025-03-14 01:00:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:54,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:54,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:54,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:54,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:54,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 702 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-14 01:00:54,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:54,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:54,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:54,607 INFO L124 PetriNetUnfolderBase]: 1400/2074 cut-off events. [2025-03-14 01:00:54,607 INFO L125 PetriNetUnfolderBase]: For 8207/8207 co-relation queries the response was YES. [2025-03-14 01:00:54,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9092 conditions, 2074 events. 1400/2074 cut-off events. For 8207/8207 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8789 event pairs, 401 based on Foata normal form. 16/1924 useless extension candidates. Maximal degree in co-relation 8976. Up to 1265 conditions per place. [2025-03-14 01:00:54,619 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 99 selfloop transitions, 12 changer transitions 12/124 dead transitions. [2025-03-14 01:00:54,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 1149 flow [2025-03-14 01:00:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-03-14 01:00:54,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2025-03-14 01:00:54,620 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 702 flow. Second operand 5 states and 79 transitions. [2025-03-14 01:00:54,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 1149 flow [2025-03-14 01:00:54,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 124 transitions, 1141 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:00:54,635 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 728 flow [2025-03-14 01:00:54,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=728, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2025-03-14 01:00:54,636 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 50 predicate places. [2025-03-14 01:00:54,636 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 728 flow [2025-03-14 01:00:54,636 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-14 01:00:54,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:54,636 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:54,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:00:54,636 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:54,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash 114713496, now seen corresponding path program 4 times [2025-03-14 01:00:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:54,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485144510] [2025-03-14 01:00:54,637 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:54,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:54,648 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-14 01:00:54,661 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:54,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:54,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:54,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:54,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485144510] [2025-03-14 01:00:54,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485144510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:54,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:54,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:54,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509871647] [2025-03-14 01:00:54,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:54,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:54,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:54,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:54,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:54,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 728 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-14 01:00:54,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:54,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:54,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:55,113 INFO L124 PetriNetUnfolderBase]: 1290/1894 cut-off events. [2025-03-14 01:00:55,114 INFO L125 PetriNetUnfolderBase]: For 8054/8054 co-relation queries the response was YES. [2025-03-14 01:00:55,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8737 conditions, 1894 events. 1290/1894 cut-off events. For 8054/8054 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7729 event pairs, 375 based on Foata normal form. 14/1758 useless extension candidates. Maximal degree in co-relation 8619. Up to 1177 conditions per place. [2025-03-14 01:00:55,124 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 92 selfloop transitions, 14 changer transitions 9/116 dead transitions. [2025-03-14 01:00:55,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 116 transitions, 1114 flow [2025-03-14 01:00:55,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-03-14 01:00:55,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2025-03-14 01:00:55,126 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 728 flow. Second operand 5 states and 75 transitions. [2025-03-14 01:00:55,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 116 transitions, 1114 flow [2025-03-14 01:00:55,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 116 transitions, 1069 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:55,141 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 720 flow [2025-03-14 01:00:55,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=720, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2025-03-14 01:00:55,142 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2025-03-14 01:00:55,142 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 720 flow [2025-03-14 01:00:55,142 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-14 01:00:55,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:55,143 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:55,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:00:55,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:55,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1659873769, now seen corresponding path program 6 times [2025-03-14 01:00:55,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:55,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409682174] [2025-03-14 01:00:55,143 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:00:55,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:55,155 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:55,183 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-03-14 01:00:55,183 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 01:00:55,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:55,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:55,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409682174] [2025-03-14 01:00:55,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409682174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:55,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:55,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:55,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145380537] [2025-03-14 01:00:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:55,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:55,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:55,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:55,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:55,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:55,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 720 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-14 01:00:55,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:55,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:55,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:55,636 INFO L124 PetriNetUnfolderBase]: 1238/1828 cut-off events. [2025-03-14 01:00:55,636 INFO L125 PetriNetUnfolderBase]: For 8435/8435 co-relation queries the response was YES. [2025-03-14 01:00:55,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8493 conditions, 1828 events. 1238/1828 cut-off events. For 8435/8435 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7391 event pairs, 338 based on Foata normal form. 32/1714 useless extension candidates. Maximal degree in co-relation 8376. Up to 940 conditions per place. [2025-03-14 01:00:55,643 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 100 selfloop transitions, 22 changer transitions 13/136 dead transitions. [2025-03-14 01:00:55,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 136 transitions, 1253 flow [2025-03-14 01:00:55,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-03-14 01:00:55,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4792626728110599 [2025-03-14 01:00:55,645 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 720 flow. Second operand 7 states and 104 transitions. [2025-03-14 01:00:55,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 136 transitions, 1253 flow [2025-03-14 01:00:55,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 136 transitions, 1215 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:55,658 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 750 flow [2025-03-14 01:00:55,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=750, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2025-03-14 01:00:55,659 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2025-03-14 01:00:55,659 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 750 flow [2025-03-14 01:00:55,659 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-14 01:00:55,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:55,660 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:55,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:00:55,660 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:55,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash -263288448, now seen corresponding path program 5 times [2025-03-14 01:00:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:55,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373356790] [2025-03-14 01:00:55,660 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:55,672 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:55,693 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:55,693 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 01:00:55,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:55,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:55,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373356790] [2025-03-14 01:00:55,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373356790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:55,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521753509] [2025-03-14 01:00:55,840 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:55,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:55,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:55,842 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-14 01:00:55,844 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-14 01:00:55,934 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:56,116 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:56,116 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 01:00:56,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:56,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:00:56,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:56,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521753509] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:56,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-14 01:00:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259465677] [2025-03-14 01:00:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:56,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:56,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:56,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:00:56,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:56,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 750 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-14 01:00:56,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:56,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:56,485 INFO L124 PetriNetUnfolderBase]: 1123/1661 cut-off events. [2025-03-14 01:00:56,485 INFO L125 PetriNetUnfolderBase]: For 8465/8465 co-relation queries the response was YES. [2025-03-14 01:00:56,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7922 conditions, 1661 events. 1123/1661 cut-off events. For 8465/8465 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6561 event pairs, 319 based on Foata normal form. 30/1557 useless extension candidates. Maximal degree in co-relation 7803. Up to 1067 conditions per place. [2025-03-14 01:00:56,492 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 91 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2025-03-14 01:00:56,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 114 transitions, 1143 flow [2025-03-14 01:00:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-03-14 01:00:56,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2025-03-14 01:00:56,493 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 750 flow. Second operand 5 states and 77 transitions. [2025-03-14 01:00:56,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 114 transitions, 1143 flow [2025-03-14 01:00:56,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 114 transitions, 1079 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:56,506 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 773 flow [2025-03-14 01:00:56,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=773, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2025-03-14 01:00:56,507 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2025-03-14 01:00:56,507 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 773 flow [2025-03-14 01:00:56,507 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-14 01:00:56,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:56,507 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:56,515 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-14 01:00:56,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-14 01:00:56,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:56,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:56,710 INFO L85 PathProgramCache]: Analyzing trace with hash 580719932, now seen corresponding path program 6 times [2025-03-14 01:00:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494006171] [2025-03-14 01:00:56,710 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:00:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:56,722 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-14 01:00:56,757 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-03-14 01:00:56,758 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 01:00:56,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:56,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:56,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494006171] [2025-03-14 01:00:56,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494006171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:56,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:56,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754747550] [2025-03-14 01:00:56,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:56,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:56,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:56,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:56,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:56,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:56,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 773 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-14 01:00:56,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:56,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:56,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:57,129 INFO L124 PetriNetUnfolderBase]: 1129/1681 cut-off events. [2025-03-14 01:00:57,130 INFO L125 PetriNetUnfolderBase]: For 8365/8365 co-relation queries the response was YES. [2025-03-14 01:00:57,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7954 conditions, 1681 events. 1129/1681 cut-off events. For 8365/8365 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6761 event pairs, 329 based on Foata normal form. 14/1557 useless extension candidates. Maximal degree in co-relation 7836. Up to 1067 conditions per place. [2025-03-14 01:00:57,139 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 84 selfloop transitions, 21 changer transitions 9/115 dead transitions. [2025-03-14 01:00:57,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 1152 flow [2025-03-14 01:00:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-14 01:00:57,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4774193548387097 [2025-03-14 01:00:57,140 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 773 flow. Second operand 5 states and 74 transitions. [2025-03-14 01:00:57,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 1152 flow [2025-03-14 01:00:57,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 115 transitions, 1092 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:57,155 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 797 flow [2025-03-14 01:00:57,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=797, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-03-14 01:00:57,155 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2025-03-14 01:00:57,155 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 797 flow [2025-03-14 01:00:57,155 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-14 01:00:57,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:57,156 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:57,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:00:57,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:57,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1454460612, now seen corresponding path program 7 times [2025-03-14 01:00:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:57,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626438499] [2025-03-14 01:00:57,156 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:57,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:57,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:00:57,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:57,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:57,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:57,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626438499] [2025-03-14 01:00:57,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626438499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993068756] [2025-03-14 01:00:57,307 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:57,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:57,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:57,309 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-14 01:00:57,311 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-14 01:00:57,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:00:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:57,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:57,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:57,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:00:57,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:57,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:00:57,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993068756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:57,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:00:57,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-14 01:00:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111105204] [2025-03-14 01:00:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:57,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:57,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:57,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:00:57,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:57,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 797 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-14 01:00:57,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:57,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:57,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:57,736 INFO L124 PetriNetUnfolderBase]: 1055/1557 cut-off events. [2025-03-14 01:00:57,736 INFO L125 PetriNetUnfolderBase]: For 8212/8212 co-relation queries the response was YES. [2025-03-14 01:00:57,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7683 conditions, 1557 events. 1055/1557 cut-off events. For 8212/8212 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6019 event pairs, 329 based on Foata normal form. 14/1445 useless extension candidates. Maximal degree in co-relation 7562. Up to 1067 conditions per place. [2025-03-14 01:00:57,745 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 76 selfloop transitions, 22 changer transitions 10/109 dead transitions. [2025-03-14 01:00:57,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 1122 flow [2025-03-14 01:00:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-03-14 01:00:57,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45806451612903226 [2025-03-14 01:00:57,746 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 797 flow. Second operand 5 states and 71 transitions. [2025-03-14 01:00:57,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 1122 flow [2025-03-14 01:00:57,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 109 transitions, 1080 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:57,764 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 785 flow [2025-03-14 01:00:57,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=785, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2025-03-14 01:00:57,764 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2025-03-14 01:00:57,765 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 785 flow [2025-03-14 01:00:57,765 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-14 01:00:57,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:57,765 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:57,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-14 01:00:57,965 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,SelfDestructingSolverStorable17 [2025-03-14 01:00:57,966 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:57,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash 556031669, now seen corresponding path program 7 times [2025-03-14 01:00:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722099315] [2025-03-14 01:00:57,966 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:57,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:57,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:00:57,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:57,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:57,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722099315] [2025-03-14 01:00:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722099315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509415220] [2025-03-14 01:00:58,113 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:58,115 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-14 01:00:58,116 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-14 01:00:58,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:00:58,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:00:58,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:58,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:58,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-14 01:00:58,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:58,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-14 01:00:58,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509415220] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:58,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:58,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-14 01:00:58,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501871173] [2025-03-14 01:00:58,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:58,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:58,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:58,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:58,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:00:58,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-14 01:00:58,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 785 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-14 01:00:58,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:58,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-14 01:00:58,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:58,687 INFO L124 PetriNetUnfolderBase]: 1027/1491 cut-off events. [2025-03-14 01:00:58,688 INFO L125 PetriNetUnfolderBase]: For 7294/7294 co-relation queries the response was YES. [2025-03-14 01:00:58,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7033 conditions, 1491 events. 1027/1491 cut-off events. For 7294/7294 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5538 event pairs, 151 based on Foata normal form. 28/1401 useless extension candidates. Maximal degree in co-relation 6913. Up to 1006 conditions per place. [2025-03-14 01:00:58,695 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 94 selfloop transitions, 20 changer transitions 0/115 dead transitions. [2025-03-14 01:00:58,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 115 transitions, 1164 flow [2025-03-14 01:00:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-14 01:00:58,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2025-03-14 01:00:58,697 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 785 flow. Second operand 5 states and 72 transitions. [2025-03-14 01:00:58,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 115 transitions, 1164 flow [2025-03-14 01:00:58,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 1071 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-03-14 01:00:58,708 INFO L231 Difference]: Finished difference. Result has 80 places, 85 transitions, 770 flow [2025-03-14 01:00:58,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=770, PETRI_PLACES=80, PETRI_TRANSITIONS=85} [2025-03-14 01:00:58,709 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2025-03-14 01:00:58,709 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 770 flow [2025-03-14 01:00:58,709 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-14 01:00:58,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:58,709 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-14 01:00:58,715 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-14 01:00:58,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:58,910 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:58,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1730938163, now seen corresponding path program 1 times [2025-03-14 01:00:58,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:58,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762199341] [2025-03-14 01:00:58,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:58,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:58,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:00:58,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:00:58,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:58,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-14 01:00:59,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:59,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762199341] [2025-03-14 01:00:59,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762199341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:59,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807783196] [2025-03-14 01:00:59,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:59,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:59,053 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-14 01:00:59,054 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-14 01:00:59,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:00:59,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:00:59,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:59,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:59,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:00:59,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:59,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:00:59,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 52 [2025-03-14 01:00:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-14 01:00:59,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:09,079 INFO L349 Elim1Store]: treesize reduction 28, result has 94.9 percent of original size [2025-03-14 01:01:09,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 210 treesize of output 583