./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/bench-exp3x3-opt.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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:40:52,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:40:52,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:40:52,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:40:52,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:40:52,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:40:52,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:40:52,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:40:52,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:40:52,135 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:40:52,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:40:52,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:40:52,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:40:52,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:40:52,136 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:40:52,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:40:52,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:40:52,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:40:52,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:40:52,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:40:52,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:40:52,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:40:52,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:40:52,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:52,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:40:52,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:40:52,139 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2025-03-13 21:40:52,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:40:52,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:40:52,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:40:52,399 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:40:52,400 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:40:52,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-13 21:40:53,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264331473/3b7c187c6fdb42398b8419e6e359aca1/FLAGd1dd69acb [2025-03-13 21:40:53,729 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:40:53,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-13 21:40:53,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264331473/3b7c187c6fdb42398b8419e6e359aca1/FLAGd1dd69acb [2025-03-13 21:40:54,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/264331473/3b7c187c6fdb42398b8419e6e359aca1 [2025-03-13 21:40:54,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:40:54,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:40:54,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:54,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:40:54,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:40:54,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3670606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54, skipping insertion in model container [2025-03-13 21:40:54,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:40:54,222 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/bench-exp3x3-opt.wvr.c[2904,2917] [2025-03-13 21:40:54,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:54,234 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:40:54,247 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/bench-exp3x3-opt.wvr.c[2904,2917] [2025-03-13 21:40:54,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:54,256 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:40:54,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54 WrapperNode [2025-03-13 21:40:54,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:54,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:54,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:40:54,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:40:54,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,277 INFO L138 Inliner]: procedures = 24, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-03-13 21:40:54,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:54,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:40:54,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:40:54,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:40:54,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,295 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-13 21:40:54,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:40:54,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:40:54,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:40:54,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:40:54,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (1/1) ... [2025-03-13 21:40:54,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:54,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:54,324 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-13 21:40:54,326 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-13 21:40:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:40:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:40:54,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:40:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:40:54,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:40:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:40:54,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:40:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:40:54,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:40:54,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:40:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-13 21:40:54,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-13 21:40:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-13 21:40:54,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-13 21:40:54,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:40:54,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:40:54,340 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:40:54,415 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:40:54,416 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:40:54,561 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:40:54,562 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:40:54,562 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:40:54,695 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:40:54,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:54 BoogieIcfgContainer [2025-03-13 21:40:54,696 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:40:54,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:40:54,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:40:54,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:40:54,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:40:54" (1/3) ... [2025-03-13 21:40:54,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e813f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:54, skipping insertion in model container [2025-03-13 21:40:54,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:54" (2/3) ... [2025-03-13 21:40:54,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e813f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:54, skipping insertion in model container [2025-03-13 21:40:54,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:54" (3/3) ... [2025-03-13 21:40:54,704 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2025-03-13 21:40:54,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:40:54,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 41 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-13 21:40:54,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:40:54,766 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-13 21:40:54,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 134 flow [2025-03-13 21:40:54,815 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-03-13 21:40:54,818 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 21:40:54,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 40 events. 6/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 25 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-13 21:40:54,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 134 flow [2025-03-13 21:40:54,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 114 flow [2025-03-13 21:40:54,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:40:54,837 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;@3803f8e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:40:54,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 21:40:54,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:40:54,851 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-13 21:40:54,851 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 21:40:54,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:54,852 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, 1, 1] [2025-03-13 21:40:54,852 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 4 more)] === [2025-03-13 21:40:54,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash 567144112, now seen corresponding path program 1 times [2025-03-13 21:40:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:54,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610006499] [2025-03-13 21:40:54,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:54,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:54,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:40:54,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:40:54,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:54,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:55,280 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-13 21:40:55,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610006499] [2025-03-13 21:40:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610006499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:55,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:55,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:40:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981217996] [2025-03-13 21:40:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:55,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:40:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:55,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:40:55,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:40:55,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:40:55,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-13 21:40:55,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:55,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:40:55,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:56,655 INFO L124 PetriNetUnfolderBase]: 21455/24889 cut-off events. [2025-03-13 21:40:56,656 INFO L125 PetriNetUnfolderBase]: For 1515/1515 co-relation queries the response was YES. [2025-03-13 21:40:56,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51114 conditions, 24889 events. 21455/24889 cut-off events. For 1515/1515 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 85364 event pairs, 3088 based on Foata normal form. 1/13614 useless extension candidates. Maximal degree in co-relation 43944. Up to 18337 conditions per place. [2025-03-13 21:40:56,796 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 51 selfloop transitions, 3 changer transitions 3/64 dead transitions. [2025-03-13 21:40:56,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 305 flow [2025-03-13 21:40:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:40:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:40:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-13 21:40:56,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2025-03-13 21:40:56,808 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 114 flow. Second operand 3 states and 97 transitions. [2025-03-13 21:40:56,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 305 flow [2025-03-13 21:40:56,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 263 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-13 21:40:56,846 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 109 flow [2025-03-13 21:40:56,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-03-13 21:40:56,853 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2025-03-13 21:40:56,853 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 109 flow [2025-03-13 21:40:56,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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-13 21:40:56,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:56,854 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, 1, 1, 1] [2025-03-13 21:40:56,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:40:56,854 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 4 more)] === [2025-03-13 21:40:56,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1598415264, now seen corresponding path program 1 times [2025-03-13 21:40:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818122219] [2025-03-13 21:40:56,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:56,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:40:56,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:40:56,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:56,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:57,040 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-13 21:40:57,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:57,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818122219] [2025-03-13 21:40:57,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818122219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:40:57,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016214075] [2025-03-13 21:40:57,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:57,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:40:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:57,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:40:57,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:40:57,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:40:57,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-13 21:40:57,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:57,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:40:57,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:58,292 INFO L124 PetriNetUnfolderBase]: 27769/32544 cut-off events. [2025-03-13 21:40:58,293 INFO L125 PetriNetUnfolderBase]: For 5329/5329 co-relation queries the response was YES. [2025-03-13 21:40:58,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71795 conditions, 32544 events. 27769/32544 cut-off events. For 5329/5329 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 120943 event pairs, 5276 based on Foata normal form. 1/22837 useless extension candidates. Maximal degree in co-relation 18283. Up to 21036 conditions per place. [2025-03-13 21:40:58,527 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 53 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2025-03-13 21:40:58,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 286 flow [2025-03-13 21:40:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:40:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:40:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-13 21:40:58,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2025-03-13 21:40:58,529 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 109 flow. Second operand 3 states and 93 transitions. [2025-03-13 21:40:58,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 286 flow [2025-03-13 21:40:58,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:58,530 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 125 flow [2025-03-13 21:40:58,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-13 21:40:58,531 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-03-13 21:40:58,531 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 125 flow [2025-03-13 21:40:58,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-13 21:40:58,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:58,531 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, 1, 1, 1, 1] [2025-03-13 21:40:58,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:40:58,533 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 4 more)] === [2025-03-13 21:40:58,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1226886398, now seen corresponding path program 1 times [2025-03-13 21:40:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:58,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245972217] [2025-03-13 21:40:58,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:58,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:58,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:40:58,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:40:58,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:58,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:58,663 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-13 21:40:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:58,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245972217] [2025-03-13 21:40:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245972217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:40:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770477651] [2025-03-13 21:40:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:58,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:40:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:58,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:40:58,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:40:58,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:40:58,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:58,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:58,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:40:58,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:00,044 INFO L124 PetriNetUnfolderBase]: 36425/42807 cut-off events. [2025-03-13 21:41:00,044 INFO L125 PetriNetUnfolderBase]: For 12474/12474 co-relation queries the response was YES. [2025-03-13 21:41:00,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100880 conditions, 42807 events. 36425/42807 cut-off events. For 12474/12474 co-relation queries the response was YES. Maximal size of possible extension queue 1536. Compared 170052 event pairs, 6150 based on Foata normal form. 1/36346 useless extension candidates. Maximal degree in co-relation 32846. Up to 30370 conditions per place. [2025-03-13 21:41:00,205 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 61 selfloop transitions, 3 changer transitions 5/76 dead transitions. [2025-03-13 21:41:00,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 358 flow [2025-03-13 21:41:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:41:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:41:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-13 21:41:00,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7318840579710145 [2025-03-13 21:41:00,210 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 125 flow. Second operand 3 states and 101 transitions. [2025-03-13 21:41:00,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 358 flow [2025-03-13 21:41:00,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:00,214 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 141 flow [2025-03-13 21:41:00,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-03-13 21:41:00,215 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-03-13 21:41:00,215 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 141 flow [2025-03-13 21:41:00,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:00,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:00,215 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, 1, 1, 1, 1, 1] [2025-03-13 21:41:00,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:41:00,216 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 4 more)] === [2025-03-13 21:41:00,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1358656878, now seen corresponding path program 1 times [2025-03-13 21:41:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731710329] [2025-03-13 21:41:00,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:00,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:41:00,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:00,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:00,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:00,335 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-13 21:41:00,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:00,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731710329] [2025-03-13 21:41:00,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731710329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:00,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:00,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:41:00,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879777931] [2025-03-13 21:41:00,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:00,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:41:00,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:00,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:41:00,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:41:00,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:00,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:00,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:00,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:00,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:02,152 INFO L124 PetriNetUnfolderBase]: 36199/42469 cut-off events. [2025-03-13 21:41:02,153 INFO L125 PetriNetUnfolderBase]: For 16293/16293 co-relation queries the response was YES. [2025-03-13 21:41:02,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105774 conditions, 42469 events. 36199/42469 cut-off events. For 16293/16293 co-relation queries the response was YES. Maximal size of possible extension queue 1529. Compared 167359 event pairs, 982 based on Foata normal form. 418/42777 useless extension candidates. Maximal degree in co-relation 35461. Up to 15401 conditions per place. [2025-03-13 21:41:02,276 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 106 selfloop transitions, 6 changer transitions 8/127 dead transitions. [2025-03-13 21:41:02,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 127 transitions, 619 flow [2025-03-13 21:41:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-13 21:41:02,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7391304347826086 [2025-03-13 21:41:02,277 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 141 flow. Second operand 5 states and 170 transitions. [2025-03-13 21:41:02,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 127 transitions, 619 flow [2025-03-13 21:41:02,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 127 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:02,280 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 162 flow [2025-03-13 21:41:02,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-03-13 21:41:02,281 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-03-13 21:41:02,281 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 162 flow [2025-03-13 21:41:02,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:02,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:02,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:02,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:41:02,282 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 4 more)] === [2025-03-13 21:41:02,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1221330821, now seen corresponding path program 1 times [2025-03-13 21:41:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791071594] [2025-03-13 21:41:02,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:02,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:41:02,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:02,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:02,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:02,366 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-13 21:41:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791071594] [2025-03-13 21:41:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791071594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943203528] [2025-03-13 21:41:02,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:02,368 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-13 21:41:02,370 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-13 21:41:02,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:41:02,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:02,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:02,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:02,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:41:02,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:02,516 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-13 21:41:02,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:02,569 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-13 21:41:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943203528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:02,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:02,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-13 21:41:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549335765] [2025-03-13 21:41:02,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:02,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:02,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:02,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:02,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-13 21:41:02,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:02,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:02,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:04,204 INFO L124 PetriNetUnfolderBase]: 36847/43803 cut-off events. [2025-03-13 21:41:04,204 INFO L125 PetriNetUnfolderBase]: For 26397/26397 co-relation queries the response was YES. [2025-03-13 21:41:04,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117535 conditions, 43803 events. 36847/43803 cut-off events. For 26397/26397 co-relation queries the response was YES. Maximal size of possible extension queue 1634. Compared 183662 event pairs, 4764 based on Foata normal form. 941/44325 useless extension candidates. Maximal degree in co-relation 40002. Up to 21452 conditions per place. [2025-03-13 21:41:04,373 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 108 selfloop transitions, 6 changer transitions 7/128 dead transitions. [2025-03-13 21:41:04,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 128 transitions, 693 flow [2025-03-13 21:41:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-03-13 21:41:04,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2025-03-13 21:41:04,375 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 162 flow. Second operand 5 states and 165 transitions. [2025-03-13 21:41:04,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 128 transitions, 693 flow [2025-03-13 21:41:04,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 128 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:04,381 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 195 flow [2025-03-13 21:41:04,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-03-13 21:41:04,381 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-03-13 21:41:04,381 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 195 flow [2025-03-13 21:41:04,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-13 21:41:04,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:04,382 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, 1, 1, 1, 1, 1] [2025-03-13 21:41:04,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:04,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:04,586 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 4 more)] === [2025-03-13 21:41:04,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1051831324, now seen corresponding path program 1 times [2025-03-13 21:41:04,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:04,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607996102] [2025-03-13 21:41:04,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:04,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:41:04,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:04,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:04,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:04,658 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-13 21:41:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607996102] [2025-03-13 21:41:04,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607996102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:04,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:04,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:41:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511770822] [2025-03-13 21:41:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:04,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:41:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:04,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:41:04,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:41:04,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:04,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:04,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:04,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:04,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:06,626 INFO L124 PetriNetUnfolderBase]: 36711/43547 cut-off events. [2025-03-13 21:41:06,627 INFO L125 PetriNetUnfolderBase]: For 43836/43836 co-relation queries the response was YES. [2025-03-13 21:41:06,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130678 conditions, 43547 events. 36711/43547 cut-off events. For 43836/43836 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 179833 event pairs, 1081 based on Foata normal form. 654/43579 useless extension candidates. Maximal degree in co-relation 57566. Up to 19299 conditions per place. [2025-03-13 21:41:06,748 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 90 selfloop transitions, 4 changer transitions 34/135 dead transitions. [2025-03-13 21:41:06,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 135 transitions, 774 flow [2025-03-13 21:41:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-03-13 21:41:06,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7217391304347827 [2025-03-13 21:41:06,749 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 195 flow. Second operand 5 states and 166 transitions. [2025-03-13 21:41:06,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 135 transitions, 774 flow [2025-03-13 21:41:06,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 135 transitions, 757 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:06,762 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 188 flow [2025-03-13 21:41:06,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-03-13 21:41:06,763 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2025-03-13 21:41:06,763 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 188 flow [2025-03-13 21:41:06,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:06,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:06,763 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, 1, 1, 1, 1, 1] [2025-03-13 21:41:06,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:41:06,763 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 4 more)] === [2025-03-13 21:41:06,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1023055575, now seen corresponding path program 1 times [2025-03-13 21:41:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439291719] [2025-03-13 21:41:06,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:06,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:06,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:41:06,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:06,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:06,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:06,830 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-13 21:41:06,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:06,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439291719] [2025-03-13 21:41:06,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439291719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:06,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:06,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:41:06,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040196260] [2025-03-13 21:41:06,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:06,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:41:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:06,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:41:06,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:41:06,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:06,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:06,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:06,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:06,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:08,036 INFO L124 PetriNetUnfolderBase]: 29341/34570 cut-off events. [2025-03-13 21:41:08,036 INFO L125 PetriNetUnfolderBase]: For 31302/31302 co-relation queries the response was YES. [2025-03-13 21:41:08,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107098 conditions, 34570 events. 29341/34570 cut-off events. For 31302/31302 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 133608 event pairs, 664 based on Foata normal form. 366/34809 useless extension candidates. Maximal degree in co-relation 46496. Up to 13517 conditions per place. [2025-03-13 21:41:08,168 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 80 selfloop transitions, 4 changer transitions 31/122 dead transitions. [2025-03-13 21:41:08,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 122 transitions, 699 flow [2025-03-13 21:41:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-03-13 21:41:08,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-13 21:41:08,169 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 188 flow. Second operand 5 states and 161 transitions. [2025-03-13 21:41:08,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 122 transitions, 699 flow [2025-03-13 21:41:08,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 122 transitions, 671 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-13 21:41:08,516 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 191 flow [2025-03-13 21:41:08,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2025-03-13 21:41:08,517 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-03-13 21:41:08,517 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 191 flow [2025-03-13 21:41:08,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:08,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:08,517 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, 1, 1, 1, 1, 1] [2025-03-13 21:41:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:41:08,517 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 4 more)] === [2025-03-13 21:41:08,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:08,517 INFO L85 PathProgramCache]: Analyzing trace with hash -389778421, now seen corresponding path program 2 times [2025-03-13 21:41:08,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:08,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745952971] [2025-03-13 21:41:08,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:08,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-13 21:41:08,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:08,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:08,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:08,601 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-13 21:41:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745952971] [2025-03-13 21:41:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745952971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225874238] [2025-03-13 21:41:08,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:08,603 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-13 21:41:08,605 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-13 21:41:08,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-13 21:41:08,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:08,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:08,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:08,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:41:08,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:08,748 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-13 21:41:08,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:08,822 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-13 21:41:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225874238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:08,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-13 21:41:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126511771] [2025-03-13 21:41:08,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:08,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:08,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:08,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:41:08,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:08,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-13 21:41:08,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:08,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:08,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:10,370 INFO L124 PetriNetUnfolderBase]: 20616/24372 cut-off events. [2025-03-13 21:41:10,371 INFO L125 PetriNetUnfolderBase]: For 32848/32848 co-relation queries the response was YES. [2025-03-13 21:41:10,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78662 conditions, 24372 events. 20616/24372 cut-off events. For 32848/32848 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 89967 event pairs, 355 based on Foata normal form. 1232/25554 useless extension candidates. Maximal degree in co-relation 43654. Up to 6837 conditions per place. [2025-03-13 21:41:10,460 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 284 selfloop transitions, 41 changer transitions 6/338 dead transitions. [2025-03-13 21:41:10,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 338 transitions, 2218 flow [2025-03-13 21:41:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:41:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:41:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 489 transitions. [2025-03-13 21:41:10,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6253196930946292 [2025-03-13 21:41:10,462 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 191 flow. Second operand 17 states and 489 transitions. [2025-03-13 21:41:10,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 338 transitions, 2218 flow [2025-03-13 21:41:10,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 338 transitions, 2181 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:10,470 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 564 flow [2025-03-13 21:41:10,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=564, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2025-03-13 21:41:10,471 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2025-03-13 21:41:10,471 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 564 flow [2025-03-13 21:41:10,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-13 21:41:10,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:10,471 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, 1, 1, 1, 1, 1] [2025-03-13 21:41:10,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:10,676 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,SelfDestructingSolverStorable7 [2025-03-13 21:41:10,676 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 4 more)] === [2025-03-13 21:41:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -349573631, now seen corresponding path program 1 times [2025-03-13 21:41:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513674211] [2025-03-13 21:41:10,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:10,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:41:10,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:10,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:10,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:10,767 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-13 21:41:10,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:10,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513674211] [2025-03-13 21:41:10,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513674211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:10,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:10,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:41:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990501528] [2025-03-13 21:41:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:10,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:41:10,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:10,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:41:10,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:41:10,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:10,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:10,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:10,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:10,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:12,013 INFO L124 PetriNetUnfolderBase]: 20413/24293 cut-off events. [2025-03-13 21:41:12,014 INFO L125 PetriNetUnfolderBase]: For 126829/126835 co-relation queries the response was YES. [2025-03-13 21:41:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114727 conditions, 24293 events. 20413/24293 cut-off events. For 126829/126835 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 90721 event pairs, 1051 based on Foata normal form. 204/24220 useless extension candidates. Maximal degree in co-relation 65928. Up to 9636 conditions per place. [2025-03-13 21:41:12,157 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 118 selfloop transitions, 10 changer transitions 51/186 dead transitions. [2025-03-13 21:41:12,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 186 transitions, 1576 flow [2025-03-13 21:41:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-03-13 21:41:12,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6652173913043479 [2025-03-13 21:41:12,158 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 564 flow. Second operand 5 states and 153 transitions. [2025-03-13 21:41:12,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 186 transitions, 1576 flow [2025-03-13 21:41:12,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 186 transitions, 1522 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-13 21:41:12,515 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 561 flow [2025-03-13 21:41:12,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2025-03-13 21:41:12,516 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2025-03-13 21:41:12,516 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 561 flow [2025-03-13 21:41:12,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:12,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:12,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:12,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:41:12,516 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 4 more)] === [2025-03-13 21:41:12,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:12,517 INFO L85 PathProgramCache]: Analyzing trace with hash -296498139, now seen corresponding path program 2 times [2025-03-13 21:41:12,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:12,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49434965] [2025-03-13 21:41:12,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:12,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:12,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-13 21:41:12,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:12,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:12,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:12,584 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-13 21:41:12,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:12,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49434965] [2025-03-13 21:41:12,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49434965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:12,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663035172] [2025-03-13 21:41:12,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:12,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:12,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:12,587 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-13 21:41:12,588 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-13 21:41:12,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-13 21:41:12,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:41:12,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:41:12,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:12,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:41:12,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:12,688 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-13 21:41:12,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:12,724 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-13 21:41:12,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663035172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:12,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:12,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-13 21:41:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259592192] [2025-03-13 21:41:12,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:12,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:12,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:12,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:12,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:12,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 561 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:12,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:12,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:12,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:13,500 INFO L124 PetriNetUnfolderBase]: 13887/16466 cut-off events. [2025-03-13 21:41:13,501 INFO L125 PetriNetUnfolderBase]: For 79889/79889 co-relation queries the response was YES. [2025-03-13 21:41:13,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77818 conditions, 16466 events. 13887/16466 cut-off events. For 79889/79889 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 57657 event pairs, 1293 based on Foata normal form. 484/16923 useless extension candidates. Maximal degree in co-relation 53794. Up to 12405 conditions per place. [2025-03-13 21:41:13,597 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 155 selfloop transitions, 12 changer transitions 0/174 dead transitions. [2025-03-13 21:41:13,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 174 transitions, 1379 flow [2025-03-13 21:41:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-03-13 21:41:13,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6869565217391305 [2025-03-13 21:41:13,598 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 561 flow. Second operand 5 states and 158 transitions. [2025-03-13 21:41:13,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 174 transitions, 1379 flow [2025-03-13 21:41:13,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 174 transitions, 1362 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:13,884 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 616 flow [2025-03-13 21:41:13,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=616, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2025-03-13 21:41:13,884 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2025-03-13 21:41:13,884 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 616 flow [2025-03-13 21:41:13,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:41:13,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:13,884 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, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:13,890 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-13 21:41:14,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:14,085 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 4 more)] === [2025-03-13 21:41:14,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash -885286465, now seen corresponding path program 1 times [2025-03-13 21:41:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047564269] [2025-03-13 21:41:14,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:14,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:41:14,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:41:14,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:14,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:14,146 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-13 21:41:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047564269] [2025-03-13 21:41:14,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047564269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:14,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724617237] [2025-03-13 21:41:14,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:14,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:14,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:14,149 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-13 21:41:14,150 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-13 21:41:14,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:41:14,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:41:14,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:14,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:14,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:41:14,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:14,252 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-13 21:41:14,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:14,292 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-13 21:41:14,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724617237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:14,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-13 21:41:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228482964] [2025-03-13 21:41:14,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:14,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:14,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:14,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:14,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:14,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 616 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-13 21:41:14,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:14,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:14,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:15,213 INFO L124 PetriNetUnfolderBase]: 13347/15940 cut-off events. [2025-03-13 21:41:15,214 INFO L125 PetriNetUnfolderBase]: For 119962/119968 co-relation queries the response was YES. [2025-03-13 21:41:15,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79872 conditions, 15940 events. 13347/15940 cut-off events. For 119962/119968 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 58167 event pairs, 346 based on Foata normal form. 541/16438 useless extension candidates. Maximal degree in co-relation 66520. Up to 11432 conditions per place. [2025-03-13 21:41:15,331 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 278 selfloop transitions, 6 changer transitions 0/291 dead transitions. [2025-03-13 21:41:15,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 291 transitions, 2699 flow [2025-03-13 21:41:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-03-13 21:41:15,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6608695652173913 [2025-03-13 21:41:15,332 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 616 flow. Second operand 5 states and 152 transitions. [2025-03-13 21:41:15,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 291 transitions, 2699 flow [2025-03-13 21:41:15,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 291 transitions, 2626 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:15,433 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 638 flow [2025-03-13 21:41:15,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=638, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2025-03-13 21:41:15,433 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 46 predicate places. [2025-03-13 21:41:15,434 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 638 flow [2025-03-13 21:41:15,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-13 21:41:15,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:15,434 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:15,440 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-13 21:41:15,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:15,638 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 4 more)] === [2025-03-13 21:41:15,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1650559135, now seen corresponding path program 1 times [2025-03-13 21:41:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:15,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342023304] [2025-03-13 21:41:15,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:15,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:41:15,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:41:15,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:15,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:41:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:15,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342023304] [2025-03-13 21:41:15,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342023304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:15,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443755009] [2025-03-13 21:41:15,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:15,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:15,707 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-13 21:41:15,708 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-13 21:41:15,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:41:15,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:41:15,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:15,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:15,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:41:15,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:41:15,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:41:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443755009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:15,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-13 21:41:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042105580] [2025-03-13 21:41:15,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:15,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:15,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:15,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:15,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:15,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 96 transitions, 638 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-13 21:41:15,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:15,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:15,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:16,956 INFO L124 PetriNetUnfolderBase]: 12943/15624 cut-off events. [2025-03-13 21:41:16,957 INFO L125 PetriNetUnfolderBase]: For 100983/100989 co-relation queries the response was YES. [2025-03-13 21:41:16,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80560 conditions, 15624 events. 12943/15624 cut-off events. For 100983/100989 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 57118 event pairs, 942 based on Foata normal form. 405/15878 useless extension candidates. Maximal degree in co-relation 68211. Up to 10371 conditions per place. [2025-03-13 21:41:17,075 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 167 selfloop transitions, 12 changer transitions 0/186 dead transitions. [2025-03-13 21:41:17,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 186 transitions, 1687 flow [2025-03-13 21:41:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-13 21:41:17,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6347826086956522 [2025-03-13 21:41:17,076 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 638 flow. Second operand 5 states and 146 transitions. [2025-03-13 21:41:17,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 186 transitions, 1687 flow [2025-03-13 21:41:17,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 186 transitions, 1654 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:17,331 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 697 flow [2025-03-13 21:41:17,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=697, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2025-03-13 21:41:17,331 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 51 predicate places. [2025-03-13 21:41:17,331 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 697 flow [2025-03-13 21:41:17,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-13 21:41:17,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:17,332 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:17,337 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-13 21:41:17,532 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-13 21:41:17,532 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 4 more)] === [2025-03-13 21:41:17,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2087231595, now seen corresponding path program 1 times [2025-03-13 21:41:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:17,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611349364] [2025-03-13 21:41:17,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:17,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:17,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:41:17,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:41:17,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:17,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:41:17,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:17,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611349364] [2025-03-13 21:41:17,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611349364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:17,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117615893] [2025-03-13 21:41:17,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:17,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:17,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:17,998 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-13 21:41:17,999 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-13 21:41:18,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:41:18,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:41:18,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:18,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:18,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:41:18,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:41:18,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:41:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117615893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:41:19,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:41:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 16 [2025-03-13 21:41:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791672934] [2025-03-13 21:41:19,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:41:19,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-13 21:41:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:19,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-13 21:41:19,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-13 21:41:19,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2025-03-13 21:41:19,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 697 flow. Second operand has 17 states, 17 states have (on average 18.647058823529413) internal successors, (317), 17 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-13 21:41:19,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:19,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2025-03-13 21:41:19,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:23,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:27,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:30,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:35,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:37,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:40,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:45,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:49,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:50,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:41:56,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:42:05,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-13 21:42:09,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []