./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/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-?-798a7b3-m [2025-03-04 02:22:36,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:22:36,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:22:36,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:22:36,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:22:36,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:22:36,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:22:36,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:22:36,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:22:36,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:22:36,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:22:36,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:22:36,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:22:36,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:22:36,488 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:22:36,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:22:36,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:22:36,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:22:36,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:22:36,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:22:36,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:22:36,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:22:36,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:22:36,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:22:36,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:22:36,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:22:36,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:22:36,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:22:36,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:22:36,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:22:36,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:22:36,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:22:36,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:36,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:22:36,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:22:36,492 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-04 02:22:36,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:22:36,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:22:36,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:22:36,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:22:36,731 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:22:36,735 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-04 02:22:37,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d433d749f/2ca044a20de947268e38869ddcac72f7/FLAG711587e32 [2025-03-04 02:22:38,129 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:22:38,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-03-04 02:22:38,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d433d749f/2ca044a20de947268e38869ddcac72f7/FLAG711587e32 [2025-03-04 02:22:38,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d433d749f/2ca044a20de947268e38869ddcac72f7 [2025-03-04 02:22:38,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:22:38,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:22:38,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:38,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:22:38,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:22:38,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21eeb8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38, skipping insertion in model container [2025-03-04 02:22:38,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:22:38,631 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-04 02:22:38,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:38,650 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:22:38,680 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-04 02:22:38,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:22:38,694 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:22:38,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38 WrapperNode [2025-03-04 02:22:38,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:22:38,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:38,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:22:38,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:22:38,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,728 INFO L138 Inliner]: procedures = 25, calls = 73, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 445 [2025-03-04 02:22:38,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:22:38,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:22:38,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:22:38,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:22:38,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,764 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-04 02:22:38,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:22:38,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:22:38,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:22:38,781 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:22:38,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (1/1) ... [2025-03-04 02:22:38,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:22:38,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:22:38,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:22:38,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:22:38,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:22:38,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:22:38,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 02:22:38,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:22:38,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:22:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:22:38,828 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:22:38,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:22:38,932 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:22:39,423 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:22:39,424 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:22:39,735 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:22:39,736 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:22:39,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:39 BoogieIcfgContainer [2025-03-04 02:22:39,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:22:39,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:22:39,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:22:39,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:22:39,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:22:38" (1/3) ... [2025-03-04 02:22:39,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e051627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:39, skipping insertion in model container [2025-03-04 02:22:39,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:22:38" (2/3) ... [2025-03-04 02:22:39,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e051627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:22:39, skipping insertion in model container [2025-03-04 02:22:39,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:22:39" (3/3) ... [2025-03-04 02:22:39,743 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2025-03-04 02:22:39,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:22:39,780 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-04 02:22:39,780 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:22:39,837 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 02:22:39,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 156 flow [2025-03-04 02:22:39,895 INFO L124 PetriNetUnfolderBase]: 12/60 cut-off events. [2025-03-04 02:22:39,900 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:22:39,903 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-04 02:22:39,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 64 transitions, 156 flow [2025-03-04 02:22:39,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 59 transitions, 142 flow [2025-03-04 02:22:39,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:22:39,927 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;@37b9da1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:22:39,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:22:39,947 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:22:39,948 INFO L124 PetriNetUnfolderBase]: 12/58 cut-off events. [2025-03-04 02:22:39,949 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 02:22:39,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:39,949 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-04 02:22:39,950 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-04 02:22:39,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1471609769, now seen corresponding path program 1 times [2025-03-04 02:22:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130716340] [2025-03-04 02:22:39,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:40,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:22:40,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:22:40,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:40,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130716340] [2025-03-04 02:22:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130716340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:40,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:22:40,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834523163] [2025-03-04 02:22:40,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:40,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:22:40,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:40,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:22:40,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:22:40,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:22:40,211 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-04 02:22:40,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:40,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:22:40,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:42,751 INFO L124 PetriNetUnfolderBase]: 30762/39969 cut-off events. [2025-03-04 02:22:42,752 INFO L125 PetriNetUnfolderBase]: For 1579/1579 co-relation queries the response was YES. [2025-03-04 02:22:42,838 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-04 02:22:43,066 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 50 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2025-03-04 02:22:43,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 234 flow [2025-03-04 02:22:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:22:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:22:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2025-03-04 02:22:43,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 02:22:43,076 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 142 flow. Second operand 2 states and 72 transitions. [2025-03-04 02:22:43,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 234 flow [2025-03-04 02:22:43,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 218 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 02:22:43,114 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 118 flow [2025-03-04 02:22:43,117 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-04 02:22:43,119 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2025-03-04 02:22:43,120 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 118 flow [2025-03-04 02:22:43,120 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-04 02:22:43,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:43,120 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-04 02:22:43,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:22:43,121 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-04 02:22:43,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -738642913, now seen corresponding path program 1 times [2025-03-04 02:22:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:43,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107992629] [2025-03-04 02:22:43,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:43,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:22:43,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:22:43,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:43,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:43,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107992629] [2025-03-04 02:22:43,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107992629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:43,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:43,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:22:43,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053237260] [2025-03-04 02:22:43,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:43,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:43,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:43,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:43,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:43,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:22:43,363 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-04 02:22:43,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:43,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:22:43,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:45,743 INFO L124 PetriNetUnfolderBase]: 37721/48970 cut-off events. [2025-03-04 02:22:45,743 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-03-04 02:22:45,796 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-04 02:22:45,907 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 76 selfloop transitions, 5 changer transitions 1/87 dead transitions. [2025-03-04 02:22:45,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 353 flow [2025-03-04 02:22:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-03-04 02:22:45,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-03-04 02:22:45,908 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 118 flow. Second operand 3 states and 110 transitions. [2025-03-04 02:22:45,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 353 flow [2025-03-04 02:22:45,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:22:45,910 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 151 flow [2025-03-04 02:22:45,911 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-04 02:22:45,911 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-03-04 02:22:45,911 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 151 flow [2025-03-04 02:22:45,911 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-04 02:22:45,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:45,911 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-04 02:22:45,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:22:45,912 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-04 02:22:45,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2116363206, now seen corresponding path program 1 times [2025-03-04 02:22:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:45,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568313297] [2025-03-04 02:22:45,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:45,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:45,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:22:45,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:22:45,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:45,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:46,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:46,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568313297] [2025-03-04 02:22:46,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568313297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:46,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:46,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:46,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082717904] [2025-03-04 02:22:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:46,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:46,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:46,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:46,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:22:46,065 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-04 02:22:46,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:46,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:22:46,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:48,545 INFO L124 PetriNetUnfolderBase]: 45950/59977 cut-off events. [2025-03-04 02:22:48,545 INFO L125 PetriNetUnfolderBase]: For 5732/5732 co-relation queries the response was YES. [2025-03-04 02:22:48,609 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-04 02:22:48,762 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 85 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-04 02:22:48,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 403 flow [2025-03-04 02:22:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-04 02:22:48,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 02:22:48,763 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 151 flow. Second operand 3 states and 112 transitions. [2025-03-04 02:22:48,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 403 flow [2025-03-04 02:22:48,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:48,767 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 154 flow [2025-03-04 02:22:48,767 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-04 02:22:48,768 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-03-04 02:22:48,768 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 154 flow [2025-03-04 02:22:48,768 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-04 02:22:48,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:48,768 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-04 02:22:48,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:22:48,768 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-04 02:22:48,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1405483814, now seen corresponding path program 1 times [2025-03-04 02:22:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:48,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099426505] [2025-03-04 02:22:48,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:48,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:48,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:22:48,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:22:48,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:48,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:48,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:48,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099426505] [2025-03-04 02:22:48,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099426505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:48,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:48,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914667066] [2025-03-04 02:22:48,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:48,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:48,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:48,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:48,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:22:48,901 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-04 02:22:48,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:48,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:22:48,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:51,481 INFO L124 PetriNetUnfolderBase]: 42343/55479 cut-off events. [2025-03-04 02:22:51,482 INFO L125 PetriNetUnfolderBase]: For 7456/7456 co-relation queries the response was YES. [2025-03-04 02:22:51,555 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-04 02:22:51,693 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 85 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-04 02:22:51,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 409 flow [2025-03-04 02:22:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-04 02:22:51,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2025-03-04 02:22:51,696 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 154 flow. Second operand 3 states and 113 transitions. [2025-03-04 02:22:51,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 409 flow [2025-03-04 02:22:51,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:51,706 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 160 flow [2025-03-04 02:22:51,706 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-04 02:22:51,707 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-03-04 02:22:51,708 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 160 flow [2025-03-04 02:22:51,708 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-04 02:22:51,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:51,708 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-04 02:22:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:22:51,709 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-04 02:22:51,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash -193303620, now seen corresponding path program 1 times [2025-03-04 02:22:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016949924] [2025-03-04 02:22:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:51,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:22:51,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:22:51,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:51,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:51,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:51,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016949924] [2025-03-04 02:22:51,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016949924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:51,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:51,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615390486] [2025-03-04 02:22:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:51,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:51,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:51,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:22:51,815 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-04 02:22:51,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:51,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:22:51,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:54,828 INFO L124 PetriNetUnfolderBase]: 43382/56839 cut-off events. [2025-03-04 02:22:54,829 INFO L125 PetriNetUnfolderBase]: For 10077/10077 co-relation queries the response was YES. [2025-03-04 02:22:54,903 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-04 02:22:55,174 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 80 selfloop transitions, 2 changer transitions 6/93 dead transitions. [2025-03-04 02:22:55,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 417 flow [2025-03-04 02:22:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-04 02:22:55,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-04 02:22:55,178 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 160 flow. Second operand 3 states and 116 transitions. [2025-03-04 02:22:55,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 417 flow [2025-03-04 02:22:55,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:55,184 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 166 flow [2025-03-04 02:22:55,185 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-04 02:22:55,185 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-04 02:22:55,186 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 166 flow [2025-03-04 02:22:55,187 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-04 02:22:55,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:55,187 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-04 02:22:55,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:22:55,187 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-04 02:22:55,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1396265992, now seen corresponding path program 1 times [2025-03-04 02:22:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369674389] [2025-03-04 02:22:55,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:55,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:22:55,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:22:55,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:55,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369674389] [2025-03-04 02:22:55,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369674389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:55,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:55,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:22:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761631345] [2025-03-04 02:22:55,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:55,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:22:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:55,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:22:55,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:22:55,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:22:55,286 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-04 02:22:55,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:55,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:22:55,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:22:57,109 INFO L124 PetriNetUnfolderBase]: 27815/36509 cut-off events. [2025-03-04 02:22:57,109 INFO L125 PetriNetUnfolderBase]: For 9053/9053 co-relation queries the response was YES. [2025-03-04 02:22:57,151 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-04 02:22:57,240 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 66 selfloop transitions, 2 changer transitions 8/81 dead transitions. [2025-03-04 02:22:57,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 366 flow [2025-03-04 02:22:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:22:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:22:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-03-04 02:22:57,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-03-04 02:22:57,241 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 166 flow. Second operand 3 states and 100 transitions. [2025-03-04 02:22:57,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 366 flow [2025-03-04 02:22:57,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:22:57,243 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 176 flow [2025-03-04 02:22:57,243 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-04 02:22:57,244 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-03-04 02:22:57,244 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 176 flow [2025-03-04 02:22:57,244 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-04 02:22:57,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:22:57,244 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-04 02:22:57,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:22:57,245 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-04 02:22:57,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:22:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -267195257, now seen corresponding path program 1 times [2025-03-04 02:22:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:22:57,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903832195] [2025-03-04 02:22:57,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:22:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:22:57,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:22:57,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:22:57,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:22:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:22:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:22:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:22:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903832195] [2025-03-04 02:22:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903832195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:22:57,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:22:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:22:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213245305] [2025-03-04 02:22:57,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:22:57,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:22:57,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:22:57,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:22:57,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:22:57,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:22:57,440 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-04 02:22:57,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:22:57,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:22:57,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:00,114 INFO L124 PetriNetUnfolderBase]: 32226/42704 cut-off events. [2025-03-04 02:23:00,114 INFO L125 PetriNetUnfolderBase]: For 8865/8865 co-relation queries the response was YES. [2025-03-04 02:23:00,166 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-04 02:23:00,239 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 54 selfloop transitions, 2 changer transitions 35/96 dead transitions. [2025-03-04 02:23:00,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 438 flow [2025-03-04 02:23:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:23:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:23:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-04 02:23:00,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125 [2025-03-04 02:23:00,240 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 176 flow. Second operand 5 states and 132 transitions. [2025-03-04 02:23:00,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 438 flow [2025-03-04 02:23:00,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:23:00,242 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 190 flow [2025-03-04 02:23:00,242 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=5, PETRI_FLOW=190, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-03-04 02:23:00,242 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2025-03-04 02:23:00,242 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 190 flow [2025-03-04 02:23:00,242 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-04 02:23:00,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:00,242 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-04 02:23:00,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:23:00,243 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-04 02:23:00,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1024391715, now seen corresponding path program 1 times [2025-03-04 02:23:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982789212] [2025-03-04 02:23:00,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:23:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:00,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:23:00,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:23:00,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:23:00,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:23:00,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:00,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982789212] [2025-03-04 02:23:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982789212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:23:00,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:23:00,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:23:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115443782] [2025-03-04 02:23:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:23:00,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:23:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:00,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:23:00,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:23:00,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:23:00,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 190 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-04 02:23:00,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:00,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:23:00,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:02,828 INFO L124 PetriNetUnfolderBase]: 33980/45155 cut-off events. [2025-03-04 02:23:02,828 INFO L125 PetriNetUnfolderBase]: For 9850/9850 co-relation queries the response was YES. [2025-03-04 02:23:02,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101572 conditions, 45155 events. 33980/45155 cut-off events. For 9850/9850 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 238684 event pairs, 30389 based on Foata normal form. 98/38664 useless extension candidates. Maximal degree in co-relation 101560. Up to 36454 conditions per place. [2025-03-04 02:23:03,018 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 53 selfloop transitions, 4 changer transitions 47/109 dead transitions. [2025-03-04 02:23:03,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 526 flow [2025-03-04 02:23:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:23:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:23:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-04 02:23:03,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-03-04 02:23:03,019 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 190 flow. Second operand 5 states and 145 transitions. [2025-03-04 02:23:03,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 526 flow [2025-03-04 02:23:03,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 109 transitions, 512 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:23:03,026 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 212 flow [2025-03-04 02:23:03,027 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2025-03-04 02:23:03,027 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2025-03-04 02:23:03,027 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 212 flow [2025-03-04 02:23:03,027 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-04 02:23:03,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:03,027 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-04 02:23:03,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:23:03,027 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-04 02:23:03,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash -176631479, now seen corresponding path program 1 times [2025-03-04 02:23:03,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:03,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060281062] [2025-03-04 02:23:03,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:23:03,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:03,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 02:23:03,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 02:23:03,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:23:03,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:23:03,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:03,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060281062] [2025-03-04 02:23:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060281062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:23:03,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:23:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:23:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613171660] [2025-03-04 02:23:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:23:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:23:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:03,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:23:03,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:23:03,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:23:03,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 212 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-04 02:23:03,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:03,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:23:03,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:23:05,541 INFO L124 PetriNetUnfolderBase]: 33129/43938 cut-off events. [2025-03-04 02:23:05,541 INFO L125 PetriNetUnfolderBase]: For 9087/9087 co-relation queries the response was YES. [2025-03-04 02:23:05,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98379 conditions, 43938 events. 33129/43938 cut-off events. For 9087/9087 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 229940 event pairs, 29635 based on Foata normal form. 50/37510 useless extension candidates. Maximal degree in co-relation 98366. Up to 36452 conditions per place. [2025-03-04 02:23:05,725 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 55 selfloop transitions, 3 changer transitions 33/96 dead transitions. [2025-03-04 02:23:05,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 484 flow [2025-03-04 02:23:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:23:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:23:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-03-04 02:23:05,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47265625 [2025-03-04 02:23:05,726 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 212 flow. Second operand 4 states and 121 transitions. [2025-03-04 02:23:05,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 484 flow [2025-03-04 02:23:05,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 456 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-04 02:23:05,732 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 210 flow [2025-03-04 02:23:05,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=210, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2025-03-04 02:23:05,732 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2025-03-04 02:23:05,732 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 210 flow [2025-03-04 02:23:05,733 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-04 02:23:05,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:23:05,733 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-04 02:23:05,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:23:05,733 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-04 02:23:05,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:23:05,733 INFO L85 PathProgramCache]: Analyzing trace with hash 765293046, now seen corresponding path program 1 times [2025-03-04 02:23:05,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:23:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066554485] [2025-03-04 02:23:05,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:23:05,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:23:05,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 02:23:05,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 02:23:05,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:23:05,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:23:05,848 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-04 02:23:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:23:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066554485] [2025-03-04 02:23:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066554485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:23:05,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:23:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:23:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427388217] [2025-03-04 02:23:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:23:05,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:23:05,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:23:05,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:23:05,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:23:05,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 64 [2025-03-04 02:23:05,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 210 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-04 02:23:05,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:23:05,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 64 [2025-03-04 02:23:05,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand