./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-commit-2.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/popl20-commit-2.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 ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:46:36,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:46:36,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:46:36,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:46:36,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:46:36,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:46:36,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:46:36,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:46:36,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:46:36,170 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:46:36,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:46:36,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:46:36,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:46:36,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:46:36,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:46:36,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:46:36,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:46:36,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:46:36,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:46:36,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:46:36,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:46:36,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:46:36,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:46:36,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:46:36,174 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 -> ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 [2025-03-13 21:46:36,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:46:36,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:46:36,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:46:36,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:46:36,429 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:46:36,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-03-13 21:46:37,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8c4d367/e772dfb29b5042d680a6d79b6103a1f0/FLAG11abaac4e [2025-03-13 21:46:37,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:46:37,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-03-13 21:46:37,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8c4d367/e772dfb29b5042d680a6d79b6103a1f0/FLAG11abaac4e [2025-03-13 21:46:38,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8c4d367/e772dfb29b5042d680a6d79b6103a1f0 [2025-03-13 21:46:38,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:46:38,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:46:38,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:46:38,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:46:38,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:46:38,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47167c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38, skipping insertion in model container [2025-03-13 21:46:38,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:46:38,326 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/popl20-commit-2.wvr.c[5898,5911] [2025-03-13 21:46:38,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:46:38,346 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:46:38,377 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/popl20-commit-2.wvr.c[5898,5911] [2025-03-13 21:46:38,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:46:38,402 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:46:38,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38 WrapperNode [2025-03-13 21:46:38,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:46:38,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:46:38,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:46:38,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:46:38,408 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:46:38" (1/1) ... [2025-03-13 21:46:38,419 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:46:38" (1/1) ... [2025-03-13 21:46:38,454 INFO L138 Inliner]: procedures = 25, calls = 73, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 445 [2025-03-13 21:46:38,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:46:38,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:46:38,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:46:38,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:46:38,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,493 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-13 21:46:38,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:46:38,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:46:38,515 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:46:38,515 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:46:38,516 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (1/1) ... [2025-03-13 21:46:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:46:38,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:38,544 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:46:38,546 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:46:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:46:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:46:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:46:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:46:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:46:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:46:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:46:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:46:38,564 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:46:38,658 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:46:38,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:46:39,176 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:46:39,177 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:46:39,177 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:46:39,629 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:46:39,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:46:39 BoogieIcfgContainer [2025-03-13 21:46:39,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:46:39,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:46:39,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:46:39,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:46:39,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:46:38" (1/3) ... [2025-03-13 21:46:39,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cf4ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:46:39, skipping insertion in model container [2025-03-13 21:46:39,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:38" (2/3) ... [2025-03-13 21:46:39,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cf4ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:46:39, skipping insertion in model container [2025-03-13 21:46:39,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:46:39" (3/3) ... [2025-03-13 21:46:39,637 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2025-03-13 21:46:39,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:46:39,654 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-2.wvr.c that has 5 procedures, 53 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-03-13 21:46:39,654 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:46:39,705 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:46:39,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 156 flow [2025-03-13 21:46:39,771 INFO L124 PetriNetUnfolderBase]: 12/60 cut-off events. [2025-03-13 21:46:39,772 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:46:39,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 12/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-13 21:46:39,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 64 transitions, 156 flow [2025-03-13 21:46:39,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 59 transitions, 142 flow [2025-03-13 21:46:39,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:46:39,804 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;@70226447, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:46:39,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:46:39,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:46:39,824 INFO L124 PetriNetUnfolderBase]: 12/58 cut-off events. [2025-03-13 21:46:39,824 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:46:39,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:39,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:39,825 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 2 more)] === [2025-03-13 21:46:39,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1471609769, now seen corresponding path program 1 times [2025-03-13 21:46:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:39,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-03-13 21:46:39,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:39,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:39,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:46:39,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:46:39,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:39,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:40,050 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:46:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-03-13 21:46:40,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752789115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:40,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:40,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:46:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167614315] [2025-03-13 21:46:40,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:46:40,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:40,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:46:40,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:46:40,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:46:40,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 142 flow. Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:46:40,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:40,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:46:40,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:43,088 INFO L124 PetriNetUnfolderBase]: 30762/39969 cut-off events. [2025-03-13 21:46:43,088 INFO L125 PetriNetUnfolderBase]: For 1579/1579 co-relation queries the response was YES. [2025-03-13 21:46:43,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81520 conditions, 39969 events. 30762/39969 cut-off events. For 1579/1579 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 206737 event pairs, 26232 based on Foata normal form. 0/35330 useless extension candidates. Maximal degree in co-relation 78021. Up to 39890 conditions per place. [2025-03-13 21:46:43,315 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 50 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2025-03-13 21:46:43,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 234 flow [2025-03-13 21:46:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:46:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:46:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2025-03-13 21:46:43,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-13 21:46:43,326 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 142 flow. Second operand 2 states and 72 transitions. [2025-03-13 21:46:43,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 234 flow [2025-03-13 21:46:43,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 218 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:46:43,348 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 118 flow [2025-03-13 21:46:43,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2025-03-13 21:46:43,354 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2025-03-13 21:46:43,354 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 118 flow [2025-03-13 21:46:43,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:46:43,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:43,355 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:46:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:46:43,355 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 2 more)] === [2025-03-13 21:46:43,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -738642913, now seen corresponding path program 1 times [2025-03-13 21:46:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:43,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411370697] [2025-03-13 21:46:43,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:43,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:46:43,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:46:43,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:43,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:43,631 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:46:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411370697] [2025-03-13 21:46:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411370697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:46:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303222912] [2025-03-13 21:46:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:43,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:43,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:43,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:43,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:46:43,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:43,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:43,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:46:43,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:45,933 INFO L124 PetriNetUnfolderBase]: 37721/48970 cut-off events. [2025-03-13 21:46:45,933 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-03-13 21:46:45,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98669 conditions, 48970 events. 37721/48970 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 1688. Compared 272082 event pairs, 8399 based on Foata normal form. 1/42926 useless extension candidates. Maximal degree in co-relation 98666. Up to 41703 conditions per place. [2025-03-13 21:46:46,101 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 76 selfloop transitions, 5 changer transitions 1/87 dead transitions. [2025-03-13 21:46:46,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 353 flow [2025-03-13 21:46:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-03-13 21:46:46,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-03-13 21:46:46,103 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 118 flow. Second operand 3 states and 110 transitions. [2025-03-13 21:46:46,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 353 flow [2025-03-13 21:46:46,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:46:46,105 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 151 flow [2025-03-13 21:46:46,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-03-13 21:46:46,105 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-03-13 21:46:46,105 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 151 flow [2025-03-13 21:46:46,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:46,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:46,107 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:46,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:46:46,107 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 2 more)] === [2025-03-13 21:46:46,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:46,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2116363206, now seen corresponding path program 1 times [2025-03-13 21:46:46,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:46,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927121157] [2025-03-13 21:46:46,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:46,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:46,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:46:46,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:46:46,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:46,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:46,254 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:46:46,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:46,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927121157] [2025-03-13 21:46:46,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927121157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:46,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:46,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:46,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640365995] [2025-03-13 21:46:46,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:46,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:46,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:46,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:46,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:46:46,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:46,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:46,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:46:46,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:49,011 INFO L124 PetriNetUnfolderBase]: 45950/59977 cut-off events. [2025-03-13 21:46:49,011 INFO L125 PetriNetUnfolderBase]: For 5732/5732 co-relation queries the response was YES. [2025-03-13 21:46:49,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128599 conditions, 59977 events. 45950/59977 cut-off events. For 5732/5732 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 332706 event pairs, 17194 based on Foata normal form. 1090/53110 useless extension candidates. Maximal degree in co-relation 128594. Up to 37348 conditions per place. [2025-03-13 21:46:49,301 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 85 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-13 21:46:49,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 403 flow [2025-03-13 21:46:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-13 21:46:49,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-13 21:46:49,303 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 151 flow. Second operand 3 states and 112 transitions. [2025-03-13 21:46:49,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 403 flow [2025-03-13 21:46:49,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:49,308 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 154 flow [2025-03-13 21:46:49,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2025-03-13 21:46:49,309 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-03-13 21:46:49,309 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 154 flow [2025-03-13 21:46:49,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:49,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:49,310 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:49,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:46:49,310 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 2 more)] === [2025-03-13 21:46:49,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1405483814, now seen corresponding path program 1 times [2025-03-13 21:46:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:49,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245178429] [2025-03-13 21:46:49,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:49,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:46:49,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:46:49,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:49,425 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:46:49,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:49,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245178429] [2025-03-13 21:46:49,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245178429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:49,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:49,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:49,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680228353] [2025-03-13 21:46:49,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:49,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:49,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:49,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:49,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:49,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:46:49,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:49,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:49,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:46:49,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:51,884 INFO L124 PetriNetUnfolderBase]: 42343/55479 cut-off events. [2025-03-13 21:46:51,885 INFO L125 PetriNetUnfolderBase]: For 7456/7456 co-relation queries the response was YES. [2025-03-13 21:46:51,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120198 conditions, 55479 events. 42343/55479 cut-off events. For 7456/7456 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 305118 event pairs, 14804 based on Foata normal form. 914/48925 useless extension candidates. Maximal degree in co-relation 120192. Up to 37354 conditions per place. [2025-03-13 21:46:52,092 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 85 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-13 21:46:52,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 409 flow [2025-03-13 21:46:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-13 21:46:52,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2025-03-13 21:46:52,094 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 154 flow. Second operand 3 states and 113 transitions. [2025-03-13 21:46:52,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 409 flow [2025-03-13 21:46:52,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:52,100 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 160 flow [2025-03-13 21:46:52,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-03-13 21:46:52,102 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-03-13 21:46:52,102 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 160 flow [2025-03-13 21:46:52,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:52,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:52,102 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:46:52,103 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 2 more)] === [2025-03-13 21:46:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash -193303620, now seen corresponding path program 1 times [2025-03-13 21:46:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323020215] [2025-03-13 21:46:52,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:52,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:46:52,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:46:52,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:52,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:52,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323020215] [2025-03-13 21:46:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323020215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868463879] [2025-03-13 21:46:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:52,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:52,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:52,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:52,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:52,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:46:52,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:52,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:52,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:46:52,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:55,164 INFO L124 PetriNetUnfolderBase]: 43382/56839 cut-off events. [2025-03-13 21:46:55,165 INFO L125 PetriNetUnfolderBase]: For 10077/10077 co-relation queries the response was YES. [2025-03-13 21:46:55,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125815 conditions, 56839 events. 43382/56839 cut-off events. For 10077/10077 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 306053 event pairs, 14565 based on Foata normal form. 695/50431 useless extension candidates. Maximal degree in co-relation 125808. Up to 37488 conditions per place. [2025-03-13 21:46:55,363 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 80 selfloop transitions, 2 changer transitions 6/93 dead transitions. [2025-03-13 21:46:55,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 417 flow [2025-03-13 21:46:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-13 21:46:55,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-13 21:46:55,364 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 160 flow. Second operand 3 states and 116 transitions. [2025-03-13 21:46:55,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 417 flow [2025-03-13 21:46:55,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:55,368 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 166 flow [2025-03-13 21:46:55,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-13 21:46:55,369 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-13 21:46:55,369 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 166 flow [2025-03-13 21:46:55,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:55,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:55,370 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:55,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:46:55,371 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 2 more)] === [2025-03-13 21:46:55,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:55,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1396265992, now seen corresponding path program 1 times [2025-03-13 21:46:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523498197] [2025-03-13 21:46:55,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:55,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:55,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 21:46:55,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 21:46:55,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:55,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:55,482 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:46:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523498197] [2025-03-13 21:46:55,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523498197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:55,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:55,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:46:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484989305] [2025-03-13 21:46:55,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:55,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:55,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:55,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:55,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:46:55,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 166 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:46:55,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:55,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:46:55,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:57,411 INFO L124 PetriNetUnfolderBase]: 27815/36509 cut-off events. [2025-03-13 21:46:57,411 INFO L125 PetriNetUnfolderBase]: For 9053/9053 co-relation queries the response was YES. [2025-03-13 21:46:57,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81653 conditions, 36509 events. 27815/36509 cut-off events. For 9053/9053 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 182013 event pairs, 12783 based on Foata normal form. 312/31781 useless extension candidates. Maximal degree in co-relation 81645. Up to 30323 conditions per place. [2025-03-13 21:46:57,553 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 66 selfloop transitions, 2 changer transitions 8/81 dead transitions. [2025-03-13 21:46:57,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 366 flow [2025-03-13 21:46:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-03-13 21:46:57,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-13 21:46:57,555 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 166 flow. Second operand 3 states and 100 transitions. [2025-03-13 21:46:57,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 366 flow [2025-03-13 21:46:57,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:57,557 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 176 flow [2025-03-13 21:46:57,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2025-03-13 21:46:57,557 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-03-13 21:46:57,557 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 176 flow [2025-03-13 21:46:57,557 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:46:57,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:57,558 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:57,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:46:57,558 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 2 more)] === [2025-03-13 21:46:57,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash -267195257, now seen corresponding path program 1 times [2025-03-13 21:46:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:57,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118981953] [2025-03-13 21:46:57,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:57,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:57,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 21:46:57,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 21:46:57,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:57,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:57,778 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:46:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118981953] [2025-03-13 21:46:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118981953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570191789] [2025-03-13 21:46:57,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:57,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:46:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:57,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:46:57,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:46:57,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:46:57,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:46:57,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:57,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:46:57,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:00,201 INFO L124 PetriNetUnfolderBase]: 32226/42704 cut-off events. [2025-03-13 21:47:00,202 INFO L125 PetriNetUnfolderBase]: For 8865/8865 co-relation queries the response was YES. [2025-03-13 21:47:00,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95689 conditions, 42704 events. 32226/42704 cut-off events. For 8865/8865 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 223610 event pairs, 28730 based on Foata normal form. 281/36683 useless extension candidates. Maximal degree in co-relation 95680. Up to 36456 conditions per place. [2025-03-13 21:47:00,343 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 54 selfloop transitions, 2 changer transitions 35/96 dead transitions. [2025-03-13 21:47:00,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 438 flow [2025-03-13 21:47:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:47:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:47:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-03-13 21:47:00,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48046875 [2025-03-13 21:47:00,344 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 176 flow. Second operand 4 states and 123 transitions. [2025-03-13 21:47:00,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 438 flow [2025-03-13 21:47:00,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:47:00,346 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 188 flow [2025-03-13 21:47:00,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-03-13 21:47:00,346 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-03-13 21:47:00,346 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 188 flow [2025-03-13 21:47:00,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:47:00,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:00,347 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:47:00,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:47:00,347 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 2 more)] === [2025-03-13 21:47:00,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1024391715, now seen corresponding path program 1 times [2025-03-13 21:47:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671626688] [2025-03-13 21:47:00,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:47:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:00,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 21:47:00,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 21:47:00,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:47:00,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:00,508 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:47:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:00,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671626688] [2025-03-13 21:47:00,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671626688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:00,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:00,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:47:00,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050224267] [2025-03-13 21:47:00,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:00,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:47:00,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:00,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:47:00,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:47:00,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:47:00,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:47:00,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:00,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:47:00,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:03,032 INFO L124 PetriNetUnfolderBase]: 33978/45151 cut-off events. [2025-03-13 21:47:03,032 INFO L125 PetriNetUnfolderBase]: For 9850/9850 co-relation queries the response was YES. [2025-03-13 21:47:03,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101560 conditions, 45151 events. 33978/45151 cut-off events. For 9850/9850 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 238828 event pairs, 30389 based on Foata normal form. 98/38659 useless extension candidates. Maximal degree in co-relation 101549. Up to 36454 conditions per place. [2025-03-13 21:47:03,239 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 54 selfloop transitions, 3 changer transitions 43/105 dead transitions. [2025-03-13 21:47:03,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 504 flow [2025-03-13 21:47:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:47:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:47:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-13 21:47:03,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51171875 [2025-03-13 21:47:03,240 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 188 flow. Second operand 4 states and 131 transitions. [2025-03-13 21:47:03,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 504 flow [2025-03-13 21:47:03,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 496 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:47:03,245 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 200 flow [2025-03-13 21:47:03,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-03-13 21:47:03,246 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2025-03-13 21:47:03,246 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 200 flow [2025-03-13 21:47:03,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:47:03,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:03,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:03,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:47:03,246 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 2 more)] === [2025-03-13 21:47:03,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash -176631479, now seen corresponding path program 1 times [2025-03-13 21:47:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:03,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939501467] [2025-03-13 21:47:03,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:47:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:03,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 21:47:03,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 21:47:03,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:47:03,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:03,592 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:47:03,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:03,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939501467] [2025-03-13 21:47:03,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939501467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:03,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:47:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858736629] [2025-03-13 21:47:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:03,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:47:03,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:03,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:47:03,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:47:03,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:47:03,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:47:03,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:03,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:47:03,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:47:05,615 INFO L124 PetriNetUnfolderBase]: 33129/43938 cut-off events. [2025-03-13 21:47:05,616 INFO L125 PetriNetUnfolderBase]: For 9089/9089 co-relation queries the response was YES. [2025-03-13 21:47:05,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98368 conditions, 43938 events. 33129/43938 cut-off events. For 9089/9089 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 229998 event pairs, 29635 based on Foata normal form. 50/37508 useless extension candidates. Maximal degree in co-relation 98356. Up to 36452 conditions per place. [2025-03-13 21:47:05,802 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 55 selfloop transitions, 3 changer transitions 33/96 dead transitions. [2025-03-13 21:47:05,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 464 flow [2025-03-13 21:47:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:47:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:47:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-03-13 21:47:05,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47265625 [2025-03-13 21:47:05,803 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 200 flow. Second operand 4 states and 121 transitions. [2025-03-13 21:47:05,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 464 flow [2025-03-13 21:47:05,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 96 transitions, 454 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:47:05,808 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 208 flow [2025-03-13 21:47:05,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2025-03-13 21:47:05,809 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2025-03-13 21:47:05,809 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 208 flow [2025-03-13 21:47:05,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:47:05,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:47:05,809 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:05,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:47:05,809 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 2 more)] === [2025-03-13 21:47:05,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:47:05,811 INFO L85 PathProgramCache]: Analyzing trace with hash 765293046, now seen corresponding path program 1 times [2025-03-13 21:47:05,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:47:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571637744] [2025-03-13 21:47:05,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:47:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:47:05,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 21:47:05,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 21:47:05,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:47:05,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:47:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:47:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:47:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571637744] [2025-03-13 21:47:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571637744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:47:06,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:47:06,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:47:06,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768695099] [2025-03-13 21:47:06,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:47:06,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:47:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:47:06,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:47:06,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:47:06,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-13 21:47:06,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 208 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:47:06,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:47:06,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-13 21:47:06,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand