./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-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-array-int-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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:59:48,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:59:48,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:59:48,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:59:48,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:59:48,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:59:48,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:59:48,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:59:48,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:59:48,371 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:59:48,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:59:48,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:59:48,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:59:48,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:59:48,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:59:48,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:59:48,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:59:48,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:59:48,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:59:48,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:59:48,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:59:48,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:59:48,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:59:48,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:59:48,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:59:48,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:59:48,375 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-03-14 00:59:48,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:59:48,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:59:48,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:59:48,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:59:48,637 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:59:48,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-14 00:59:49,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d15fbda/aeef9f39d09c41dfa3d3d4018cc0979f/FLAGb2fe1a493 [2025-03-14 00:59:50,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:59:50,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-14 00:59:50,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d15fbda/aeef9f39d09c41dfa3d3d4018cc0979f/FLAGb2fe1a493 [2025-03-14 00:59:50,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d15fbda/aeef9f39d09c41dfa3d3d4018cc0979f [2025-03-14 00:59:50,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:59:50,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:59:50,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:59:50,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:59:50,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:59:50,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2140d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50, skipping insertion in model container [2025-03-14 00:59:50,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:59:50,240 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-array-int-subst.wvr.c[2820,2833] [2025-03-14 00:59:50,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:59:50,261 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:59:50,279 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-array-int-subst.wvr.c[2820,2833] [2025-03-14 00:59:50,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:59:50,292 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:59:50,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50 WrapperNode [2025-03-14 00:59:50,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:59:50,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:59:50,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:59:50,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:59:50,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,324 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 256 [2025-03-14 00:59:50,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:59:50,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:59:50,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:59:50,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:59:50,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,342 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 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 00:59:50,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:59:50,360 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:59:50,360 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:59:50,360 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:59:50,360 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (1/1) ... [2025-03-14 00:59:50,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:59:50,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:59:50,382 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 00:59:50,386 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 00:59:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:59:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 00:59:50,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 00:59:50,399 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 00:59:50,399 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 00:59:50,400 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:59:50,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:59:50,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:59:50,402 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 00:59:50,482 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:59:50,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:59:50,793 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:59:50,794 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:59:50,794 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:59:51,029 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:59:51,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:59:51 BoogieIcfgContainer [2025-03-14 00:59:51,030 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:59:51,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:59:51,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:59:51,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:59:51,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:59:50" (1/3) ... [2025-03-14 00:59:51,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f37d676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:59:51, skipping insertion in model container [2025-03-14 00:59:51,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:59:50" (2/3) ... [2025-03-14 00:59:51,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f37d676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:59:51, skipping insertion in model container [2025-03-14 00:59:51,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:59:51" (3/3) ... [2025-03-14 00:59:51,036 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-03-14 00:59:51,046 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:59:51,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 00:59:51,048 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:59:51,096 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 00:59:51,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-03-14 00:59:51,151 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-03-14 00:59:51,156 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 00:59:51,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-14 00:59:51,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-03-14 00:59:51,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-03-14 00:59:51,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:59:51,179 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;@4dffdc14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:59:51,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 00:59:51,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:59:51,189 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-03-14 00:59:51,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 00:59:51,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:51,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:59:51,190 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 00:59:51,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1479501132, now seen corresponding path program 1 times [2025-03-14 00:59:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:51,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056990191] [2025-03-14 00:59:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:51,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 00:59:51,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 00:59:51,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:51,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:52,102 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 00:59:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056990191] [2025-03-14 00:59:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056990191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:59:52,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:59:52,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:59:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018324244] [2025-03-14 00:59:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:52,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:59:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:52,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:59:52,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:59:52,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:52,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 00:59:52,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:52,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:52,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:52,748 INFO L124 PetriNetUnfolderBase]: 1973/2810 cut-off events. [2025-03-14 00:59:52,748 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2025-03-14 00:59:52,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5726 conditions, 2810 events. 1973/2810 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12692 event pairs, 495 based on Foata normal form. 1/2381 useless extension candidates. Maximal degree in co-relation 3096. Up to 1010 conditions per place. [2025-03-14 00:59:52,763 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 94 selfloop transitions, 12 changer transitions 1/111 dead transitions. [2025-03-14 00:59:52,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 111 transitions, 499 flow [2025-03-14 00:59:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:59:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:59:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2025-03-14 00:59:52,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-14 00:59:52,773 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 9 states and 171 transitions. [2025-03-14 00:59:52,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 111 transitions, 499 flow [2025-03-14 00:59:52,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 111 transitions, 457 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 00:59:52,790 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 163 flow [2025-03-14 00:59:52,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=163, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2025-03-14 00:59:52,794 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2025-03-14 00:59:52,795 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 163 flow [2025-03-14 00:59:52,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 00:59:52,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:52,796 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 00:59:52,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:59:52,796 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 00:59:52,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash -387340493, now seen corresponding path program 1 times [2025-03-14 00:59:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:52,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876434120] [2025-03-14 00:59:52,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:52,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:59:52,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:59:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:52,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876434120] [2025-03-14 00:59:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876434120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:59:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565197473] [2025-03-14 00:59:52,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:59:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:59:52,960 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 00:59:52,962 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 00:59:53,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:59:53,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:59:53,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:53,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:53,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 00:59:53,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:59:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:53,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:59:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565197473] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 00:59:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 00:59:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-14 00:59:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001726638] [2025-03-14 00:59:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:59:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:53,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:59:53,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-14 00:59:53,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:53,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:53,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:53,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:53,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:53,833 INFO L124 PetriNetUnfolderBase]: 3912/5571 cut-off events. [2025-03-14 00:59:53,833 INFO L125 PetriNetUnfolderBase]: For 757/757 co-relation queries the response was YES. [2025-03-14 00:59:53,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12342 conditions, 5571 events. 3912/5571 cut-off events. For 757/757 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 28071 event pairs, 2029 based on Foata normal form. 1/5270 useless extension candidates. Maximal degree in co-relation 6778. Up to 2810 conditions per place. [2025-03-14 00:59:53,861 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 114 selfloop transitions, 8 changer transitions 4/130 dead transitions. [2025-03-14 00:59:53,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 130 transitions, 660 flow [2025-03-14 00:59:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:59:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:59:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-03-14 00:59:53,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-14 00:59:53,864 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 163 flow. Second operand 7 states and 161 transitions. [2025-03-14 00:59:53,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 130 transitions, 660 flow [2025-03-14 00:59:53,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 130 transitions, 654 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 00:59:53,868 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 203 flow [2025-03-14 00:59:53,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-14 00:59:53,868 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2025-03-14 00:59:53,868 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 203 flow [2025-03-14 00:59:53,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:53,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:53,868 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 00:59:53,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 00:59:54,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:59:54,069 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 00:59:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1586656370, now seen corresponding path program 1 times [2025-03-14 00:59:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-14 00:59:54,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:54,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:59:54,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:59:54,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:54,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:54,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-14 00:59:54,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806204517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:59:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182090157] [2025-03-14 00:59:54,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:54,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:59:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:59:54,209 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 00:59:54,211 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 00:59:54,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:59:54,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:59:54,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:54,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:54,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 00:59:54,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:59:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:54,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:59:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:54,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182090157] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 00:59:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 00:59:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-14 00:59:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88372729] [2025-03-14 00:59:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:54,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:59:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:54,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:59:54,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:59:54,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:54,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 00:59:54,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:54,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:54,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:55,082 INFO L124 PetriNetUnfolderBase]: 4808/6923 cut-off events. [2025-03-14 00:59:55,082 INFO L125 PetriNetUnfolderBase]: For 1684/1684 co-relation queries the response was YES. [2025-03-14 00:59:55,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15984 conditions, 6923 events. 4808/6923 cut-off events. For 1684/1684 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 36807 event pairs, 2574 based on Foata normal form. 1/6882 useless extension candidates. Maximal degree in co-relation 10029. Up to 3511 conditions per place. [2025-03-14 00:59:55,107 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 111 selfloop transitions, 8 changer transitions 4/127 dead transitions. [2025-03-14 00:59:55,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 680 flow [2025-03-14 00:59:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:59:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:59:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-03-14 00:59:55,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2025-03-14 00:59:55,108 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 203 flow. Second operand 6 states and 154 transitions. [2025-03-14 00:59:55,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 680 flow [2025-03-14 00:59:55,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 127 transitions, 669 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-14 00:59:55,114 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 227 flow [2025-03-14 00:59:55,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-14 00:59:55,115 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2025-03-14 00:59:55,115 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 227 flow [2025-03-14 00:59:55,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 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 00:59:55,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:55,115 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 00:59:55,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 00:59:55,315 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,SelfDestructingSolverStorable2 [2025-03-14 00:59:55,315 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 00:59:55,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1106150318, now seen corresponding path program 1 times [2025-03-14 00:59:55,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533173264] [2025-03-14 00:59:55,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:55,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:59:55,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:59:55,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:55,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533173264] [2025-03-14 00:59:55,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533173264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:59:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751439277] [2025-03-14 00:59:55,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:55,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:59:55,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:59:55,608 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 00:59:55,609 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 00:59:55,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:59:55,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:59:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:55,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 00:59:55,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:59:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:55,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:59:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751439277] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 00:59:56,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 00:59:56,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-03-14 00:59:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237908408] [2025-03-14 00:59:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:56,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:59:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:56,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:59:56,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-14 00:59:56,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:56,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 227 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 00:59:56,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:56,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:56,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:56,729 INFO L124 PetriNetUnfolderBase]: 5194/7583 cut-off events. [2025-03-14 00:59:56,730 INFO L125 PetriNetUnfolderBase]: For 3093/3093 co-relation queries the response was YES. [2025-03-14 00:59:56,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17912 conditions, 7583 events. 5194/7583 cut-off events. For 3093/3093 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 42178 event pairs, 677 based on Foata normal form. 1/7536 useless extension candidates. Maximal degree in co-relation 12219. Up to 3454 conditions per place. [2025-03-14 00:59:56,763 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 151 selfloop transitions, 18 changer transitions 1/174 dead transitions. [2025-03-14 00:59:56,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 174 transitions, 964 flow [2025-03-14 00:59:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 00:59:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 00:59:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 236 transitions. [2025-03-14 00:59:56,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2025-03-14 00:59:56,764 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 227 flow. Second operand 11 states and 236 transitions. [2025-03-14 00:59:56,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 174 transitions, 964 flow [2025-03-14 00:59:56,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 174 transitions, 945 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-14 00:59:56,771 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 320 flow [2025-03-14 00:59:56,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=320, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-14 00:59:56,771 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2025-03-14 00:59:56,772 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 320 flow [2025-03-14 00:59:56,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 00:59:56,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:56,772 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 00:59:56,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 00:59:56,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:59:56,973 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 00:59:56,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1777468174, now seen corresponding path program 2 times [2025-03-14 00:59:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842631598] [2025-03-14 00:59:56,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:59:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:56,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-14 00:59:57,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-14 00:59:57,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:59:57,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:57,298 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 00:59:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:57,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842631598] [2025-03-14 00:59:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842631598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:59:57,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:59:57,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:59:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383422502] [2025-03-14 00:59:57,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:57,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:59:57,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:57,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:59:57,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:59:57,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:57,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:57,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:57,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:57,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:57,989 INFO L124 PetriNetUnfolderBase]: 5710/8321 cut-off events. [2025-03-14 00:59:57,989 INFO L125 PetriNetUnfolderBase]: For 7075/7075 co-relation queries the response was YES. [2025-03-14 00:59:58,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21714 conditions, 8321 events. 5710/8321 cut-off events. For 7075/7075 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 46660 event pairs, 596 based on Foata normal form. 1/8274 useless extension candidates. Maximal degree in co-relation 16300. Up to 3454 conditions per place. [2025-03-14 00:59:58,028 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 117 selfloop transitions, 25 changer transitions 1/147 dead transitions. [2025-03-14 00:59:58,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 147 transitions, 921 flow [2025-03-14 00:59:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:59:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:59:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2025-03-14 00:59:58,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4775 [2025-03-14 00:59:58,029 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 320 flow. Second operand 10 states and 191 transitions. [2025-03-14 00:59:58,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 147 transitions, 921 flow [2025-03-14 00:59:58,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 147 transitions, 895 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 00:59:58,045 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 440 flow [2025-03-14 00:59:58,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=440, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-03-14 00:59:58,045 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 40 predicate places. [2025-03-14 00:59:58,045 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 440 flow [2025-03-14 00:59:58,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:58,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:58,046 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 00:59:58,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:59:58,046 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 00:59:58,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:58,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1859386117, now seen corresponding path program 1 times [2025-03-14 00:59:58,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:58,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035962910] [2025-03-14 00:59:58,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:58,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:58,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:59:58,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:59:58,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:58,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:58,110 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 00:59:58,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:58,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035962910] [2025-03-14 00:59:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035962910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:59:58,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:59:58,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:59:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161369276] [2025-03-14 00:59:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:58,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:59:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:58,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:59:58,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:59:58,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:58,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:58,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:58,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:58,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:58,455 INFO L124 PetriNetUnfolderBase]: 3938/6000 cut-off events. [2025-03-14 00:59:58,455 INFO L125 PetriNetUnfolderBase]: For 8533/8533 co-relation queries the response was YES. [2025-03-14 00:59:58,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16707 conditions, 6000 events. 3938/6000 cut-off events. For 8533/8533 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 34695 event pairs, 1626 based on Foata normal form. 276/6233 useless extension candidates. Maximal degree in co-relation 13323. Up to 2451 conditions per place. [2025-03-14 00:59:58,483 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 86 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2025-03-14 00:59:58,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 106 transitions, 757 flow [2025-03-14 00:59:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:59:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:59:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-03-14 00:59:58,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-14 00:59:58,485 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 440 flow. Second operand 6 states and 116 transitions. [2025-03-14 00:59:58,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 106 transitions, 757 flow [2025-03-14 00:59:58,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 712 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-14 00:59:58,507 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 421 flow [2025-03-14 00:59:58,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2025-03-14 00:59:58,508 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2025-03-14 00:59:58,508 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 421 flow [2025-03-14 00:59:58,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:58,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:58,508 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 00:59:58,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:59:58,509 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 00:59:58,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1051349903, now seen corresponding path program 1 times [2025-03-14 00:59:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6726930] [2025-03-14 00:59:58,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:58,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:58,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:59:58,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:59:58,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:58,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:58,577 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 00:59:58,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6726930] [2025-03-14 00:59:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6726930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:59:58,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:59:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:59:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13398646] [2025-03-14 00:59:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:59:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:58,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:59:58,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:59:58,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:58,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 421 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:58,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:58,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:58,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:58,860 INFO L124 PetriNetUnfolderBase]: 2578/4117 cut-off events. [2025-03-14 00:59:58,860 INFO L125 PetriNetUnfolderBase]: For 6488/6488 co-relation queries the response was YES. [2025-03-14 00:59:58,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11354 conditions, 4117 events. 2578/4117 cut-off events. For 6488/6488 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 24033 event pairs, 1150 based on Foata normal form. 198/4306 useless extension candidates. Maximal degree in co-relation 10477. Up to 1993 conditions per place. [2025-03-14 00:59:58,877 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 81 selfloop transitions, 5 changer transitions 15/105 dead transitions. [2025-03-14 00:59:58,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 105 transitions, 759 flow [2025-03-14 00:59:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:59:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:59:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-14 00:59:58,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-14 00:59:58,878 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 421 flow. Second operand 5 states and 110 transitions. [2025-03-14 00:59:58,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 105 transitions, 759 flow [2025-03-14 00:59:58,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 105 transitions, 729 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-14 00:59:58,894 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 274 flow [2025-03-14 00:59:58,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=81, PETRI_TRANSITIONS=53} [2025-03-14 00:59:58,896 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2025-03-14 00:59:58,896 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 274 flow [2025-03-14 00:59:58,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:58,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:58,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:59:58,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:59:58,896 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 00:59:58,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash -50908269, now seen corresponding path program 1 times [2025-03-14 00:59:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:58,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658374046] [2025-03-14 00:59:58,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:58,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:58,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:59:58,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:59:58,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:58,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:58,960 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 00:59:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:58,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658374046] [2025-03-14 00:59:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658374046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:59:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:59:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:59:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432615407] [2025-03-14 00:59:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:58,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:59:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:58,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:59:58,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:59:58,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:58,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 53 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:58,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:58,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:58,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:59,196 INFO L124 PetriNetUnfolderBase]: 1657/2531 cut-off events. [2025-03-14 00:59:59,197 INFO L125 PetriNetUnfolderBase]: For 3912/3912 co-relation queries the response was YES. [2025-03-14 00:59:59,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7129 conditions, 2531 events. 1657/2531 cut-off events. For 3912/3912 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12571 event pairs, 910 based on Foata normal form. 38/2546 useless extension candidates. Maximal degree in co-relation 7104. Up to 1993 conditions per place. [2025-03-14 00:59:59,204 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 41 selfloop transitions, 2 changer transitions 40/87 dead transitions. [2025-03-14 00:59:59,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 572 flow [2025-03-14 00:59:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:59:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:59:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-03-14 00:59:59,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-14 00:59:59,206 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 274 flow. Second operand 5 states and 104 transitions. [2025-03-14 00:59:59,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 572 flow [2025-03-14 00:59:59,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 529 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-03-14 00:59:59,210 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 203 flow [2025-03-14 00:59:59,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2025-03-14 00:59:59,211 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-03-14 00:59:59,211 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 203 flow [2025-03-14 00:59:59,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:59,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:59,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:59:59,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:59:59,212 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 00:59:59,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash 910970168, now seen corresponding path program 1 times [2025-03-14 00:59:59,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:59,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570511439] [2025-03-14 00:59:59,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:59,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:59:59,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:59:59,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:59,266 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 00:59:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:59,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570511439] [2025-03-14 00:59:59,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570511439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:59:59,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:59:59,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:59:59,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918992352] [2025-03-14 00:59:59,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:59,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:59:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:59,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:59:59,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:59:59,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 00:59:59,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:59,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:59,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 00:59:59,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:59,425 INFO L124 PetriNetUnfolderBase]: 1088/1634 cut-off events. [2025-03-14 00:59:59,425 INFO L125 PetriNetUnfolderBase]: For 1446/1446 co-relation queries the response was YES. [2025-03-14 00:59:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 1634 events. 1088/1634 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7184 event pairs, 484 based on Foata normal form. 42/1671 useless extension candidates. Maximal degree in co-relation 4339. Up to 1108 conditions per place. [2025-03-14 00:59:59,431 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 34 selfloop transitions, 2 changer transitions 39/79 dead transitions. [2025-03-14 00:59:59,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 79 transitions, 467 flow [2025-03-14 00:59:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:59:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:59:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-03-14 00:59:59,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-03-14 00:59:59,432 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 203 flow. Second operand 6 states and 111 transitions. [2025-03-14 00:59:59,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 79 transitions, 467 flow [2025-03-14 00:59:59,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 433 flow, removed 15 selfloop flow, removed 8 redundant places. [2025-03-14 00:59:59,435 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 139 flow [2025-03-14 00:59:59,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2025-03-14 00:59:59,436 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2025-03-14 00:59:59,436 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 139 flow [2025-03-14 00:59:59,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:59:59,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:59,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:59:59,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:59:59,437 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 00:59:59,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:59:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1311103925, now seen corresponding path program 1 times [2025-03-14 00:59:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:59:59,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690612780] [2025-03-14 00:59:59,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:59:59,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:59:59,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:59:59,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:59,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 00:59:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:59:59,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690612780] [2025-03-14 00:59:59,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690612780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:59:59,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777499349] [2025-03-14 00:59:59,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:59:59,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:59:59,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:59:59,531 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 00:59:59,532 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 00:59:59,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 00:59:59,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 00:59:59,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:59:59,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:59:59,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 00:59:59,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:59:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:59,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:59:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:59:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777499349] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 00:59:59,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 00:59:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-14 00:59:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952762194] [2025-03-14 00:59:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:59:59,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:59:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:59:59,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:59:59,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-14 00:59:59,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 00:59:59,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 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 00:59:59,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:59:59,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 00:59:59,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:59:59,896 INFO L124 PetriNetUnfolderBase]: 1376/1944 cut-off events. [2025-03-14 00:59:59,896 INFO L125 PetriNetUnfolderBase]: For 1051/1051 co-relation queries the response was YES. [2025-03-14 00:59:59,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4829 conditions, 1944 events. 1376/1944 cut-off events. For 1051/1051 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8070 event pairs, 403 based on Foata normal form. 62/1936 useless extension candidates. Maximal degree in co-relation 4814. Up to 1062 conditions per place. [2025-03-14 00:59:59,901 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 53 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-14 00:59:59,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 336 flow [2025-03-14 00:59:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:59:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:59:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2025-03-14 00:59:59,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3535714285714286 [2025-03-14 00:59:59,902 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 139 flow. Second operand 7 states and 99 transitions. [2025-03-14 00:59:59,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 336 flow [2025-03-14 00:59:59,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 306 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-03-14 00:59:59,904 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 146 flow [2025-03-14 00:59:59,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-03-14 00:59:59,905 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2025-03-14 00:59:59,905 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 146 flow [2025-03-14 00:59:59,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 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 00:59:59,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:59:59,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:59:59,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:00:00,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:00,109 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:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 139253222, now seen corresponding path program 1 times [2025-03-14 01:00:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648032624] [2025-03-14 01:00:00,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:00,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:00:00,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:00:00,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:00,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648032624] [2025-03-14 01:00:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648032624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:00,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:00:00,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684944187] [2025-03-14 01:00:00,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:00,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:00:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:00,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:00:00,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:00:00,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:00,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:00,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:00,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:00,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:00,401 INFO L124 PetriNetUnfolderBase]: 1190/1697 cut-off events. [2025-03-14 01:00:00,401 INFO L125 PetriNetUnfolderBase]: For 944/989 co-relation queries the response was YES. [2025-03-14 01:00:00,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4270 conditions, 1697 events. 1190/1697 cut-off events. For 944/989 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7110 event pairs, 354 based on Foata normal form. 1/1690 useless extension candidates. Maximal degree in co-relation 4259. Up to 818 conditions per place. [2025-03-14 01:00:00,407 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 50 selfloop transitions, 3 changer transitions 22/79 dead transitions. [2025-03-14 01:00:00,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 411 flow [2025-03-14 01:00:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:00:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:00:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-14 01:00:00,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-14 01:00:00,408 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 146 flow. Second operand 4 states and 95 transitions. [2025-03-14 01:00:00,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 411 flow [2025-03-14 01:00:00,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 400 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:00,410 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 141 flow [2025-03-14 01:00:00,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-03-14 01:00:00,411 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2025-03-14 01:00:00,411 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 141 flow [2025-03-14 01:00:00,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:00,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:00,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:00,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:00:00,411 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:00,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1366793167, now seen corresponding path program 1 times [2025-03-14 01:00:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:00,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405936467] [2025-03-14 01:00:00,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:00,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:00:00,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:00:00,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:00,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:00,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405936467] [2025-03-14 01:00:00,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405936467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104880519] [2025-03-14 01:00:00,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:00,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:00,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:00,612 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:00,614 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:00,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:00:00,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:00:00,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:00,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:00,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:00:00,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:00,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:01,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104880519] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:01,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:01,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2025-03-14 01:00:01,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633230459] [2025-03-14 01:00:01,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:01,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:01,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:01,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-14 01:00:01,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:01,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 141 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:01,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:01,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:01,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:01,544 INFO L124 PetriNetUnfolderBase]: 2314/3374 cut-off events. [2025-03-14 01:00:01,545 INFO L125 PetriNetUnfolderBase]: For 3069/3185 co-relation queries the response was YES. [2025-03-14 01:00:01,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8819 conditions, 3374 events. 2314/3374 cut-off events. For 3069/3185 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16395 event pairs, 359 based on Foata normal form. 1/3370 useless extension candidates. Maximal degree in co-relation 8807. Up to 1049 conditions per place. [2025-03-14 01:00:01,558 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 18 changer transitions 1/134 dead transitions. [2025-03-14 01:00:01,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 134 transitions, 714 flow [2025-03-14 01:00:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:00:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:00:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-03-14 01:00:01,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2025-03-14 01:00:01,560 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 141 flow. Second operand 11 states and 199 transitions. [2025-03-14 01:00:01,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 134 transitions, 714 flow [2025-03-14 01:00:01,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 134 transitions, 684 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-14 01:00:01,564 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 285 flow [2025-03-14 01:00:01,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=285, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-03-14 01:00:01,564 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2025-03-14 01:00:01,564 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 285 flow [2025-03-14 01:00:01,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:01,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:01,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:01,574 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:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-14 01:00:01,766 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:01,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 15273967, now seen corresponding path program 2 times [2025-03-14 01:00:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:01,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038127040] [2025-03-14 01:00:01,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:01,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:00:01,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-14 01:00:01,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:00:01,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:00:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:01,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038127040] [2025-03-14 01:00:01,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038127040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:01,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:01,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:00:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172479056] [2025-03-14 01:00:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:01,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:01,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:01,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:00:02,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:02,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 285 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:02,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:02,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:02,492 INFO L124 PetriNetUnfolderBase]: 3018/4359 cut-off events. [2025-03-14 01:00:02,492 INFO L125 PetriNetUnfolderBase]: For 5584/5758 co-relation queries the response was YES. [2025-03-14 01:00:02,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11995 conditions, 4359 events. 3018/4359 cut-off events. For 5584/5758 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 21692 event pairs, 563 based on Foata normal form. 1/4353 useless extension candidates. Maximal degree in co-relation 11978. Up to 1730 conditions per place. [2025-03-14 01:00:02,508 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 20 changer transitions 1/136 dead transitions. [2025-03-14 01:00:02,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 136 transitions, 832 flow [2025-03-14 01:00:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:00:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:00:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2025-03-14 01:00:02,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2025-03-14 01:00:02,511 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 285 flow. Second operand 11 states and 196 transitions. [2025-03-14 01:00:02,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 136 transitions, 832 flow [2025-03-14 01:00:02,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 136 transitions, 813 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:02,519 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 384 flow [2025-03-14 01:00:02,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=384, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-03-14 01:00:02,520 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2025-03-14 01:00:02,520 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 384 flow [2025-03-14 01:00:02,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:02,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:02,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:02,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:00:02,520 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:02,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash 310095303, now seen corresponding path program 3 times [2025-03-14 01:00:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200675707] [2025-03-14 01:00:02,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:02,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:00:02,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-14 01:00:02,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:00:02,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:00:02,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200675707] [2025-03-14 01:00:02,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200675707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:02,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:02,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:00:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073809276] [2025-03-14 01:00:02,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:02,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:02,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:02,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:00:02,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:02,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 384 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:02,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:02,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:02,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:03,451 INFO L124 PetriNetUnfolderBase]: 3501/5102 cut-off events. [2025-03-14 01:00:03,451 INFO L125 PetriNetUnfolderBase]: For 10043/10207 co-relation queries the response was YES. [2025-03-14 01:00:03,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14898 conditions, 5102 events. 3501/5102 cut-off events. For 10043/10207 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 26524 event pairs, 508 based on Foata normal form. 1/5095 useless extension candidates. Maximal degree in co-relation 14878. Up to 1715 conditions per place. [2025-03-14 01:00:03,473 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 120 selfloop transitions, 30 changer transitions 1/155 dead transitions. [2025-03-14 01:00:03,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 155 transitions, 1066 flow [2025-03-14 01:00:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:00:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:00:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2025-03-14 01:00:03,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2025-03-14 01:00:03,474 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 384 flow. Second operand 11 states and 204 transitions. [2025-03-14 01:00:03,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 155 transitions, 1066 flow [2025-03-14 01:00:03,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 155 transitions, 1015 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-03-14 01:00:03,489 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 551 flow [2025-03-14 01:00:03,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=551, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-03-14 01:00:03,490 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2025-03-14 01:00:03,490 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 551 flow [2025-03-14 01:00:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:03,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:03,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:03,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:00:03,490 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:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1724118621, now seen corresponding path program 4 times [2025-03-14 01:00:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:03,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851035669] [2025-03-14 01:00:03,491 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:03,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:03,496 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:00:03,498 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-03-14 01:00:03,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:00:03,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:03,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851035669] [2025-03-14 01:00:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851035669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814568434] [2025-03-14 01:00:03,598 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:03,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:03,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:03,600 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:03,602 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:03,659 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:00:03,670 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-03-14 01:00:03,670 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:00:03,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:03,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:00:03,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:03,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814568434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:03,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-14 01:00:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334055403] [2025-03-14 01:00:03,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:03,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 01:00:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:03,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 01:00:03,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-14 01:00:03,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-03-14 01:00:03,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 551 flow. Second operand has 17 states, 17 states have (on average 8.176470588235293) internal successors, (139), 17 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:03,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:03,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-03-14 01:00:03,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:05,016 INFO L124 PetriNetUnfolderBase]: 10310/14354 cut-off events. [2025-03-14 01:00:05,016 INFO L125 PetriNetUnfolderBase]: For 39209/39209 co-relation queries the response was YES. [2025-03-14 01:00:05,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44277 conditions, 14354 events. 10310/14354 cut-off events. For 39209/39209 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 79439 event pairs, 952 based on Foata normal form. 2/13648 useless extension candidates. Maximal degree in co-relation 44254. Up to 6085 conditions per place. [2025-03-14 01:00:05,079 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 173 selfloop transitions, 39 changer transitions 2/216 dead transitions. [2025-03-14 01:00:05,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 216 transitions, 1962 flow [2025-03-14 01:00:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:00:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:00:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2025-03-14 01:00:05,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-14 01:00:05,080 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 551 flow. Second operand 9 states and 180 transitions. [2025-03-14 01:00:05,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 216 transitions, 1962 flow [2025-03-14 01:00:05,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 216 transitions, 1829 flow, removed 57 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:05,174 INFO L231 Difference]: Finished difference. Result has 87 places, 89 transitions, 827 flow [2025-03-14 01:00:05,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=827, PETRI_PLACES=87, PETRI_TRANSITIONS=89} [2025-03-14 01:00:05,175 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2025-03-14 01:00:05,175 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 827 flow [2025-03-14 01:00:05,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.176470588235293) internal successors, (139), 17 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:05,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:05,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:05,181 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:05,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 01:00:05,376 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:05,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1539915065, now seen corresponding path program 5 times [2025-03-14 01:00:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512029992] [2025-03-14 01:00:05,377 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:05,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:00:05,397 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:00:05,397 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:05,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:00:05,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512029992] [2025-03-14 01:00:05,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512029992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419300998] [2025-03-14 01:00:05,761 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:05,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:05,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:05,763 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:05,765 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:05,815 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:00:05,836 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:00:05,836 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:05,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:05,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 01:00:05,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:05,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:06,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419300998] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:06,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:06,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 23 [2025-03-14 01:00:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145842649] [2025-03-14 01:00:06,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:06,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:06,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:06,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:00:06,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:06,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 827 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:06,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:06,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:06,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:07,248 INFO L124 PetriNetUnfolderBase]: 7042/10359 cut-off events. [2025-03-14 01:00:07,248 INFO L125 PetriNetUnfolderBase]: For 38205/38529 co-relation queries the response was YES. [2025-03-14 01:00:07,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35756 conditions, 10359 events. 7042/10359 cut-off events. For 38205/38529 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 62316 event pairs, 1195 based on Foata normal form. 3/10351 useless extension candidates. Maximal degree in co-relation 35729. Up to 2788 conditions per place. [2025-03-14 01:00:07,312 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 136 selfloop transitions, 40 changer transitions 1/182 dead transitions. [2025-03-14 01:00:07,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 182 transitions, 1610 flow [2025-03-14 01:00:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:00:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:00:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 210 transitions. [2025-03-14 01:00:07,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-14 01:00:07,313 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 827 flow. Second operand 12 states and 210 transitions. [2025-03-14 01:00:07,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 182 transitions, 1610 flow [2025-03-14 01:00:07,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 182 transitions, 1575 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-14 01:00:07,404 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 973 flow [2025-03-14 01:00:07,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=973, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2025-03-14 01:00:07,404 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 62 predicate places. [2025-03-14 01:00:07,404 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 973 flow [2025-03-14 01:00:07,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:07,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:07,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:07,412 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:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:07,607 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:07,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 548662683, now seen corresponding path program 6 times [2025-03-14 01:00:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532969045] [2025-03-14 01:00:07,609 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:00:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:07,620 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-14 01:00:07,627 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-14 01:00:07,627 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:00:07,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:00:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532969045] [2025-03-14 01:00:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532969045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:07,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:00:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789109023] [2025-03-14 01:00:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:07,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:07,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:07,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:00:07,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:07,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 973 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:07,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:07,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:07,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:08,950 INFO L124 PetriNetUnfolderBase]: 7325/10855 cut-off events. [2025-03-14 01:00:08,950 INFO L125 PetriNetUnfolderBase]: For 47380/47742 co-relation queries the response was YES. [2025-03-14 01:00:08,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38867 conditions, 10855 events. 7325/10855 cut-off events. For 47380/47742 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 66136 event pairs, 1488 based on Foata normal form. 2/10844 useless extension candidates. Maximal degree in co-relation 38837. Up to 2854 conditions per place. [2025-03-14 01:00:09,006 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 150 selfloop transitions, 36 changer transitions 1/192 dead transitions. [2025-03-14 01:00:09,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 192 transitions, 1925 flow [2025-03-14 01:00:09,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:00:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:00:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-14 01:00:09,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-14 01:00:09,008 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 973 flow. Second operand 11 states and 198 transitions. [2025-03-14 01:00:09,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 192 transitions, 1925 flow [2025-03-14 01:00:09,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 192 transitions, 1891 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-14 01:00:09,076 INFO L231 Difference]: Finished difference. Result has 107 places, 104 transitions, 1260 flow [2025-03-14 01:00:09,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=107, PETRI_TRANSITIONS=104} [2025-03-14 01:00:09,077 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 70 predicate places. [2025-03-14 01:00:09,077 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 104 transitions, 1260 flow [2025-03-14 01:00:09,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:09,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:09,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:09,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:00:09,078 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:09,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1114314439, now seen corresponding path program 7 times [2025-03-14 01:00:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267856634] [2025-03-14 01:00:09,078 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:09,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:00:09,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:00:09,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:09,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:00:09,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:09,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267856634] [2025-03-14 01:00:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267856634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:09,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667497555] [2025-03-14 01:00:09,294 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:00:09,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:09,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:09,296 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:09,298 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:09,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:00:09,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:00:09,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:09,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:09,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:00:09,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:09,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:09,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667497555] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:09,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:09,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 22 [2025-03-14 01:00:09,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207176536] [2025-03-14 01:00:09,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:09,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:00:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:09,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:00:09,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:00:09,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:09,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 104 transitions, 1260 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:09,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:09,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:09,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:10,828 INFO L124 PetriNetUnfolderBase]: 7317/10821 cut-off events. [2025-03-14 01:00:10,828 INFO L125 PetriNetUnfolderBase]: For 59971/60332 co-relation queries the response was YES. [2025-03-14 01:00:10,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40533 conditions, 10821 events. 7317/10821 cut-off events. For 59971/60332 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 65367 event pairs, 1198 based on Foata normal form. 3/10812 useless extension candidates. Maximal degree in co-relation 40499. Up to 3352 conditions per place. [2025-03-14 01:00:10,899 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 148 selfloop transitions, 44 changer transitions 2/199 dead transitions. [2025-03-14 01:00:10,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 199 transitions, 2112 flow [2025-03-14 01:00:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:00:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:00:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions. [2025-03-14 01:00:10,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4590909090909091 [2025-03-14 01:00:10,901 INFO L175 Difference]: Start difference. First operand has 107 places, 104 transitions, 1260 flow. Second operand 11 states and 202 transitions. [2025-03-14 01:00:10,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 199 transitions, 2112 flow [2025-03-14 01:00:11,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 199 transitions, 2062 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:11,050 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 1481 flow [2025-03-14 01:00:11,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1481, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2025-03-14 01:00:11,051 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 78 predicate places. [2025-03-14 01:00:11,051 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 1481 flow [2025-03-14 01:00:11,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:11,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:11,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:11,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 01:00:11,251 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,SelfDestructingSolverStorable17 [2025-03-14 01:00:11,252 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:11,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:11,252 INFO L85 PathProgramCache]: Analyzing trace with hash 381400709, now seen corresponding path program 1 times [2025-03-14 01:00:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:11,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273613344] [2025-03-14 01:00:11,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:11,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:00:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:00:11,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:11,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:00:11,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273613344] [2025-03-14 01:00:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273613344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924831775] [2025-03-14 01:00:11,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:11,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:11,368 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:11,371 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:11,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:00:11,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:00:11,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:11,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:11,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:00:11,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:00:11,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:00:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924831775] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:11,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-14 01:00:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031124384] [2025-03-14 01:00:11,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:11,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:11,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:11,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:00:11,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:00:11,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 1481 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:11,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:11,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:00:11,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:12,537 INFO L124 PetriNetUnfolderBase]: 8449/12060 cut-off events. [2025-03-14 01:00:12,537 INFO L125 PetriNetUnfolderBase]: For 70567/71086 co-relation queries the response was YES. [2025-03-14 01:00:12,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46644 conditions, 12060 events. 8449/12060 cut-off events. For 70567/71086 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 70135 event pairs, 3815 based on Foata normal form. 54/12106 useless extension candidates. Maximal degree in co-relation 46607. Up to 6793 conditions per place. [2025-03-14 01:00:12,723 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 165 selfloop transitions, 15 changer transitions 0/183 dead transitions. [2025-03-14 01:00:12,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 183 transitions, 2418 flow [2025-03-14 01:00:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:00:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:00:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-14 01:00:12,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-14 01:00:12,724 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 1481 flow. Second operand 8 states and 144 transitions. [2025-03-14 01:00:12,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 183 transitions, 2418 flow [2025-03-14 01:00:12,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 2308 flow, removed 46 selfloop flow, removed 5 redundant places. [2025-03-14 01:00:12,909 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 1441 flow [2025-03-14 01:00:12,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1441, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-03-14 01:00:12,910 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 82 predicate places. [2025-03-14 01:00:12,910 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 1441 flow [2025-03-14 01:00:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:12,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:12,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:12,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 01:00:13,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:13,111 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:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 63209970, now seen corresponding path program 1 times [2025-03-14 01:00:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-14 01:00:13,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:13,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:00:13,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:00:13,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:13,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:13,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-14 01:00:13,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266031602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:13,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282789071] [2025-03-14 01:00:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:13,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:13,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:13,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:13,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:13,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 1441 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:13,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:13,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:13,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:13,518 INFO L124 PetriNetUnfolderBase]: 3206/4971 cut-off events. [2025-03-14 01:00:13,518 INFO L125 PetriNetUnfolderBase]: For 27136/27328 co-relation queries the response was YES. [2025-03-14 01:00:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18435 conditions, 4971 events. 3206/4971 cut-off events. For 27136/27328 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 28845 event pairs, 1365 based on Foata normal form. 252/5209 useless extension candidates. Maximal degree in co-relation 18396. Up to 2619 conditions per place. [2025-03-14 01:00:13,550 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 98 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2025-03-14 01:00:13,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 113 transitions, 1294 flow [2025-03-14 01:00:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-14 01:00:13,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.515 [2025-03-14 01:00:13,551 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 1441 flow. Second operand 5 states and 103 transitions. [2025-03-14 01:00:13,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 113 transitions, 1294 flow [2025-03-14 01:00:13,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 113 transitions, 1226 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-03-14 01:00:13,597 INFO L231 Difference]: Finished difference. Result has 113 places, 84 transitions, 930 flow [2025-03-14 01:00:13,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=930, PETRI_PLACES=113, PETRI_TRANSITIONS=84} [2025-03-14 01:00:13,598 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 76 predicate places. [2025-03-14 01:00:13,598 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 84 transitions, 930 flow [2025-03-14 01:00:13,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:13,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:13,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:13,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:00:13,598 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:13,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1128613000, now seen corresponding path program 1 times [2025-03-14 01:00:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:13,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696936172] [2025-03-14 01:00:13,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:13,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:00:13,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:00:13,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:13,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:00:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696936172] [2025-03-14 01:00:13,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696936172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:13,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:00:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152628492] [2025-03-14 01:00:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:13,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:00:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:13,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:00:13,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:00:13,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:13,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 84 transitions, 930 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:13,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:13,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:13,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:13,922 INFO L124 PetriNetUnfolderBase]: 2139/3490 cut-off events. [2025-03-14 01:00:13,922 INFO L125 PetriNetUnfolderBase]: For 15556/15685 co-relation queries the response was YES. [2025-03-14 01:00:13,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12176 conditions, 3490 events. 2139/3490 cut-off events. For 15556/15685 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 20691 event pairs, 1110 based on Foata normal form. 214/3676 useless extension candidates. Maximal degree in co-relation 12140. Up to 1747 conditions per place. [2025-03-14 01:00:13,939 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 41 selfloop transitions, 2 changer transitions 46/93 dead transitions. [2025-03-14 01:00:13,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 93 transitions, 949 flow [2025-03-14 01:00:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:00:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:00:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-14 01:00:13,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-14 01:00:13,940 INFO L175 Difference]: Start difference. First operand has 113 places, 84 transitions, 930 flow. Second operand 5 states and 95 transitions. [2025-03-14 01:00:13,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 93 transitions, 949 flow [2025-03-14 01:00:13,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 93 transitions, 889 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-03-14 01:00:13,965 INFO L231 Difference]: Finished difference. Result has 109 places, 47 transitions, 279 flow [2025-03-14 01:00:13,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=109, PETRI_TRANSITIONS=47} [2025-03-14 01:00:13,966 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 72 predicate places. [2025-03-14 01:00:13,966 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 47 transitions, 279 flow [2025-03-14 01:00:13,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:13,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:13,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:13,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:00:13,966 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:13,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1290524194, now seen corresponding path program 1 times [2025-03-14 01:00:13,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:13,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267586894] [2025-03-14 01:00:13,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:13,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:13,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:00:13,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:00:13,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:13,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:00:14,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267586894] [2025-03-14 01:00:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267586894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974949184] [2025-03-14 01:00:14,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:14,168 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:14,169 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:14,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:00:14,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:00:14,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:14,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:14,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:00:14,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:00:14,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:00:14,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974949184] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:14,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:14,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 7] total 18 [2025-03-14 01:00:14,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643021385] [2025-03-14 01:00:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:14,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:00:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:14,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:00:14,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:00:14,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-14 01:00:14,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 47 transitions, 279 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:14,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:14,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-14 01:00:14,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:14,642 INFO L124 PetriNetUnfolderBase]: 2016/2868 cut-off events. [2025-03-14 01:00:14,642 INFO L125 PetriNetUnfolderBase]: For 7784/7925 co-relation queries the response was YES. [2025-03-14 01:00:14,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9786 conditions, 2868 events. 2016/2868 cut-off events. For 7784/7925 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12279 event pairs, 708 based on Foata normal form. 90/2955 useless extension candidates. Maximal degree in co-relation 9752. Up to 1464 conditions per place. [2025-03-14 01:00:14,657 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 55 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2025-03-14 01:00:14,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 67 transitions, 524 flow [2025-03-14 01:00:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:00:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:00:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-03-14 01:00:14,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-03-14 01:00:14,659 INFO L175 Difference]: Start difference. First operand has 109 places, 47 transitions, 279 flow. Second operand 7 states and 93 transitions. [2025-03-14 01:00:14,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 67 transitions, 524 flow [2025-03-14 01:00:14,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 460 flow, removed 24 selfloop flow, removed 16 redundant places. [2025-03-14 01:00:14,664 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 274 flow [2025-03-14 01:00:14,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2025-03-14 01:00:14,665 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2025-03-14 01:00:14,665 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 274 flow [2025-03-14 01:00:14,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:14,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:14,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:14,670 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:14,865 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,SelfDestructingSolverStorable21 [2025-03-14 01:00:14,865 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash -224509833, now seen corresponding path program 1 times [2025-03-14 01:00:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-03-14 01:00:14,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:00:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:14,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:00:14,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:00:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:00:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:15,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-03-14 01:00:15,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565017852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:00:15,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:00:15,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 01:00:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163612387] [2025-03-14 01:00:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:15,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 01:00:15,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:15,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 01:00:15,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:00:15,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:15,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 274 flow. Second operand has 14 states, 14 states have (on average 9.071428571428571) internal successors, (127), 14 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:15,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:15,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:15,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:16,079 INFO L124 PetriNetUnfolderBase]: 2760/4106 cut-off events. [2025-03-14 01:00:16,079 INFO L125 PetriNetUnfolderBase]: For 7736/7882 co-relation queries the response was YES. [2025-03-14 01:00:16,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13388 conditions, 4106 events. 2760/4106 cut-off events. For 7736/7882 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21584 event pairs, 255 based on Foata normal form. 1/4104 useless extension candidates. Maximal degree in co-relation 13366. Up to 1721 conditions per place. [2025-03-14 01:00:16,094 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 141 selfloop transitions, 14 changer transitions 10/169 dead transitions. [2025-03-14 01:00:16,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 169 transitions, 1170 flow [2025-03-14 01:00:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:00:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:00:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 228 transitions. [2025-03-14 01:00:16,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2025-03-14 01:00:16,095 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 274 flow. Second operand 13 states and 228 transitions. [2025-03-14 01:00:16,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 169 transitions, 1170 flow [2025-03-14 01:00:16,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 169 transitions, 1142 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:00:16,099 INFO L231 Difference]: Finished difference. Result has 86 places, 56 transitions, 388 flow [2025-03-14 01:00:16,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=388, PETRI_PLACES=86, PETRI_TRANSITIONS=56} [2025-03-14 01:00:16,099 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2025-03-14 01:00:16,099 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 56 transitions, 388 flow [2025-03-14 01:00:16,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.071428571428571) internal successors, (127), 14 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:00:16,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:16,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:16,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:00:16,100 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1322441827, now seen corresponding path program 2 times [2025-03-14 01:00:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786367118] [2025-03-14 01:00:16,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:16,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:00:16,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:16,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:16,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:16,638 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:16,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:16,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786367118] [2025-03-14 01:00:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786367118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:16,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700445529] [2025-03-14 01:00:16,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:00:16,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:16,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:16,640 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:16,641 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:16,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:00:16,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:16,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:16,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:16,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-14 01:00:16,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:17,015 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-14 01:00:17,015 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 65 treesize of output 41 [2025-03-14 01:00:17,073 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:17,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:18,005 INFO L349 Elim1Store]: treesize reduction 70, result has 87.8 percent of original size [2025-03-14 01:00:18,005 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 198 treesize of output 550 [2025-03-14 01:00:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:00:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700445529] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:33,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:00:33,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 14] total 31 [2025-03-14 01:00:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318780896] [2025-03-14 01:00:33,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:00:33,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:00:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:33,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:00:33,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2025-03-14 01:00:33,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:33,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 56 transitions, 388 flow. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:33,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:33,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:33,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:34,293 INFO L124 PetriNetUnfolderBase]: 3133/4622 cut-off events. [2025-03-14 01:00:34,293 INFO L125 PetriNetUnfolderBase]: For 13743/13983 co-relation queries the response was YES. [2025-03-14 01:00:34,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17149 conditions, 4622 events. 3133/4622 cut-off events. For 13743/13983 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23764 event pairs, 707 based on Foata normal form. 1/4606 useless extension candidates. Maximal degree in co-relation 17120. Up to 2935 conditions per place. [2025-03-14 01:00:34,322 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 101 selfloop transitions, 24 changer transitions 9/138 dead transitions. [2025-03-14 01:00:34,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 138 transitions, 1076 flow [2025-03-14 01:00:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 01:00:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 01:00:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2025-03-14 01:00:34,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41458333333333336 [2025-03-14 01:00:34,323 INFO L175 Difference]: Start difference. First operand has 86 places, 56 transitions, 388 flow. Second operand 12 states and 199 transitions. [2025-03-14 01:00:34,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 138 transitions, 1076 flow [2025-03-14 01:00:34,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 138 transitions, 1029 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-14 01:00:34,336 INFO L231 Difference]: Finished difference. Result has 97 places, 70 transitions, 580 flow [2025-03-14 01:00:34,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=580, PETRI_PLACES=97, PETRI_TRANSITIONS=70} [2025-03-14 01:00:34,337 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 60 predicate places. [2025-03-14 01:00:34,337 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 70 transitions, 580 flow [2025-03-14 01:00:34,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:34,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:34,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:34,343 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:34,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-14 01:00:34,538 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:34,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1500900607, now seen corresponding path program 3 times [2025-03-14 01:00:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:34,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786231327] [2025-03-14 01:00:34,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:34,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:00:34,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:34,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:34,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:35,089 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:35,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786231327] [2025-03-14 01:00:35,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786231327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889326996] [2025-03-14 01:00:35,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:00:35,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:35,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:35,091 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:35,092 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:35,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:00:35,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:35,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:00:35,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:35,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-14 01:00:35,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:35,399 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-14 01:00:35,399 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 62 treesize of output 30 [2025-03-14 01:00:35,421 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:35,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:35,970 INFO L349 Elim1Store]: treesize reduction 28, result has 84.5 percent of original size [2025-03-14 01:00:35,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 112 treesize of output 184 [2025-03-14 01:00:36,496 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:36,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889326996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:36,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 29 [2025-03-14 01:00:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875867155] [2025-03-14 01:00:36,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:36,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 01:00:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:36,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 01:00:36,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2025-03-14 01:00:36,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:36,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 70 transitions, 580 flow. Second operand has 29 states, 29 states have (on average 9.241379310344827) internal successors, (268), 29 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:36,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:36,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:36,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:38,763 INFO L124 PetriNetUnfolderBase]: 4461/6671 cut-off events. [2025-03-14 01:00:38,763 INFO L125 PetriNetUnfolderBase]: For 22695/23127 co-relation queries the response was YES. [2025-03-14 01:00:38,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25251 conditions, 6671 events. 4461/6671 cut-off events. For 22695/23127 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 37168 event pairs, 380 based on Foata normal form. 18/6686 useless extension candidates. Maximal degree in co-relation 25217. Up to 1789 conditions per place. [2025-03-14 01:00:38,810 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 300 selfloop transitions, 63 changer transitions 22/389 dead transitions. [2025-03-14 01:00:38,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 389 transitions, 2928 flow [2025-03-14 01:00:38,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 01:00:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 01:00:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 586 transitions. [2025-03-14 01:00:38,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4308823529411765 [2025-03-14 01:00:38,812 INFO L175 Difference]: Start difference. First operand has 97 places, 70 transitions, 580 flow. Second operand 34 states and 586 transitions. [2025-03-14 01:00:38,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 389 transitions, 2928 flow [2025-03-14 01:00:38,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 389 transitions, 2849 flow, removed 35 selfloop flow, removed 2 redundant places. [2025-03-14 01:00:38,844 INFO L231 Difference]: Finished difference. Result has 146 places, 108 transitions, 1151 flow [2025-03-14 01:00:38,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1151, PETRI_PLACES=146, PETRI_TRANSITIONS=108} [2025-03-14 01:00:38,844 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 109 predicate places. [2025-03-14 01:00:38,844 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 108 transitions, 1151 flow [2025-03-14 01:00:38,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.241379310344827) internal successors, (268), 29 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:38,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:38,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:38,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-14 01:00:39,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-14 01:00:39,051 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:39,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:39,051 INFO L85 PathProgramCache]: Analyzing trace with hash 161431389, now seen corresponding path program 4 times [2025-03-14 01:00:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:39,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618755119] [2025-03-14 01:00:39,051 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:39,058 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:00:39,066 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:39,066 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:39,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:39,438 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:39,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618755119] [2025-03-14 01:00:39,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618755119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132313502] [2025-03-14 01:00:39,439 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:00:39,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:39,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:39,441 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:00:39,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-14 01:00:39,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:00:39,550 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:39,550 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:00:39,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:39,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-14 01:00:39,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:39,831 INFO L349 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2025-03-14 01:00:39,832 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 50 treesize of output 36 [2025-03-14 01:00:39,849 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:39,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:00:40,599 INFO L349 Elim1Store]: treesize reduction 28, result has 91.4 percent of original size [2025-03-14 01:00:40,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 144 treesize of output 344 [2025-03-14 01:00:43,955 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:43,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132313502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:00:43,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:00:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 26 [2025-03-14 01:00:43,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902850277] [2025-03-14 01:00:43,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:00:43,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 01:00:43,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:00:43,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 01:00:43,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-14 01:00:44,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-14 01:00:44,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 108 transitions, 1151 flow. Second operand has 26 states, 26 states have (on average 9.692307692307692) internal successors, (252), 26 states have internal predecessors, (252), 0 states have call successors, (0), 0 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,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:00:44,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-14 01:00:44,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:00:45,646 INFO L124 PetriNetUnfolderBase]: 4635/6889 cut-off events. [2025-03-14 01:00:45,646 INFO L125 PetriNetUnfolderBase]: For 56593/57048 co-relation queries the response was YES. [2025-03-14 01:00:45,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33086 conditions, 6889 events. 4635/6889 cut-off events. For 56593/57048 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 38283 event pairs, 606 based on Foata normal form. 2/6882 useless extension candidates. Maximal degree in co-relation 33033. Up to 2451 conditions per place. [2025-03-14 01:00:45,689 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 187 selfloop transitions, 50 changer transitions 12/253 dead transitions. [2025-03-14 01:00:45,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 253 transitions, 2685 flow [2025-03-14 01:00:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:00:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:00:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 305 transitions. [2025-03-14 01:00:45,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-03-14 01:00:45,690 INFO L175 Difference]: Start difference. First operand has 146 places, 108 transitions, 1151 flow. Second operand 18 states and 305 transitions. [2025-03-14 01:00:45,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 253 transitions, 2685 flow [2025-03-14 01:00:45,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 253 transitions, 2449 flow, removed 63 selfloop flow, removed 16 redundant places. [2025-03-14 01:00:45,772 INFO L231 Difference]: Finished difference. Result has 150 places, 116 transitions, 1227 flow [2025-03-14 01:00:45,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1227, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2025-03-14 01:00:45,772 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 113 predicate places. [2025-03-14 01:00:45,772 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 1227 flow [2025-03-14 01:00:45,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.692307692307692) internal successors, (252), 26 states have internal predecessors, (252), 0 states have call successors, (0), 0 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,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:00:45,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:00:45,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-14 01:00:45,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-14 01:00:45,974 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:00:45,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:00:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash 543731105, now seen corresponding path program 5 times [2025-03-14 01:00:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:00:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848228311] [2025-03-14 01:00:45,975 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:00:45,981 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:00:46,000 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:46,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:46,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:00:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:00:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848228311] [2025-03-14 01:00:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848228311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:00:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092433333] [2025-03-14 01:00:46,771 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:00:46,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:00:46,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:00:46,774 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:00:46,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-14 01:00:46,837 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:00:46,862 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:00:46,862 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:00:46,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:00:46,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-14 01:00:46,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:00:47,064 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2025-03-14 01:00:47,064 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 50 treesize of output 36 [2025-03-14 01:00:47,084 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:47,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:19,945 INFO L349 Elim1Store]: treesize reduction 28, result has 89.1 percent of original size [2025-03-14 01:01:19,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114 treesize of output 263 [2025-03-14 01:01:20,210 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:01:20,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092433333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:20,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 33 [2025-03-14 01:01:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411546357] [2025-03-14 01:01:20,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:20,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-14 01:01:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:20,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-14 01:01:20,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=920, Unknown=8, NotChecked=0, Total=1056