./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-bad-commit-1.wvr-bad.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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:33:03,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:33:03,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:33:03,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:33:03,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:33:03,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:33:03,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:33:03,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:33:03,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:33:03,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:33:03,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:33:03,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:33:03,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:33:03,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:33:03,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:33:03,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:33:03,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:33:03,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:33:03,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:33:03,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:33:03,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:33:03,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:33:03,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:33:03,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:33:03,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:33:03,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:33:03,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:33:03,731 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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-03-08 17:33:03,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:33:03,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:33:03,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:33:03,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:33:03,994 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:33:03,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-08 17:33:05,205 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa85e729/ddde5e44b7244521809c4b66b9c50058/FLAGd732f4248 [2025-03-08 17:33:05,524 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:33:05,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-08 17:33:05,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa85e729/ddde5e44b7244521809c4b66b9c50058/FLAGd732f4248 [2025-03-08 17:33:05,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa85e729/ddde5e44b7244521809c4b66b9c50058 [2025-03-08 17:33:05,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:33:05,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:33:05,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:33:05,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:33:05,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:33:05,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fad818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05, skipping insertion in model container [2025-03-08 17:33:05,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:33:05,741 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-bad-commit-1.wvr-bad.c[5161,5174] [2025-03-08 17:33:05,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:33:05,761 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:33:05,791 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-bad-commit-1.wvr-bad.c[5161,5174] [2025-03-08 17:33:05,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:33:05,814 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:33:05,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05 WrapperNode [2025-03-08 17:33:05,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:33:05,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:33:05,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:33:05,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:33:05,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,865 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-03-08 17:33:05,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:33:05,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:33:05,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:33:05,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:33:05,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,906 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-08 17:33:05,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:33:05,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:33:05,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:33:05,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:33:05,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (1/1) ... [2025-03-08 17:33:05,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:33:05,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:05,961 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-08 17:33:05,964 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-08 17:33:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:33:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:33:05,981 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:33:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:33:05,981 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:33:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:33:05,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:33:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:33:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:33:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:33:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:33:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:33:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:33:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:33:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:33:05,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:33:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:33:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:33:05,984 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:33:06,075 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:33:06,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:33:06,448 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:33:06,448 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:33:06,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:33:06,721 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:33:06,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:06 BoogieIcfgContainer [2025-03-08 17:33:06,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:33:06,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:33:06,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:33:06,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:33:06,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:33:05" (1/3) ... [2025-03-08 17:33:06,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3611c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:06, skipping insertion in model container [2025-03-08 17:33:06,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:05" (2/3) ... [2025-03-08 17:33:06,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3611c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:06, skipping insertion in model container [2025-03-08 17:33:06,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:06" (3/3) ... [2025-03-08 17:33:06,730 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-03-08 17:33:06,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:33:06,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 17:33:06,745 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:33:06,792 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:33:06,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 61 transitions, 143 flow [2025-03-08 17:33:06,849 INFO L124 PetriNetUnfolderBase]: 17/58 cut-off events. [2025-03-08 17:33:06,853 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:33:06,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 17/58 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2025-03-08 17:33:06,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 61 transitions, 143 flow [2025-03-08 17:33:06,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 57 transitions, 132 flow [2025-03-08 17:33:06,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:33:06,873 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;@71e87e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:33:06,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:33:06,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:33:06,888 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2025-03-08 17:33:06,888 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:33:06,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:06,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:06,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:06,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash 536192061, now seen corresponding path program 1 times [2025-03-08 17:33:06,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:06,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625148552] [2025-03-08 17:33:06,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:06,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:33:06,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:33:06,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:06,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:07,083 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-08 17:33:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625148552] [2025-03-08 17:33:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625148552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753717966] [2025-03-08 17:33:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:33:07,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:07,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:33:07,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:33:07,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-08 17:33:07,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-08 17:33:07,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:07,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-08 17:33:07,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:07,367 INFO L124 PetriNetUnfolderBase]: 1163/1704 cut-off events. [2025-03-08 17:33:07,367 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-08 17:33:07,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1704 events. 1163/1704 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6730 event pairs, 608 based on Foata normal form. 0/1341 useless extension candidates. Maximal degree in co-relation 2998. Up to 1448 conditions per place. [2025-03-08 17:33:07,404 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 37 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2025-03-08 17:33:07,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 200 flow [2025-03-08 17:33:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:33:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 17:33:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-03-08 17:33:07,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2025-03-08 17:33:07,416 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 132 flow. Second operand 2 states and 80 transitions. [2025-03-08 17:33:07,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 200 flow [2025-03-08 17:33:07,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 188 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:33:07,424 INFO L231 Difference]: Finished difference. Result has 45 places, 54 transitions, 114 flow [2025-03-08 17:33:07,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=54} [2025-03-08 17:33:07,429 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-08 17:33:07,430 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 54 transitions, 114 flow [2025-03-08 17:33:07,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-08 17:33:07,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:07,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:07,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:33:07,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:07,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash -288712845, now seen corresponding path program 1 times [2025-03-08 17:33:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-03-08 17:33:07,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:07,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:33:07,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:33:07,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:07,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:07,671 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-08 17:33:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-03-08 17:33:07,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817606132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:07,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:07,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837023996] [2025-03-08 17:33:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:07,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:07,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:07,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:07,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-08 17:33:07,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 54 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-08 17:33:07,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:07,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-08 17:33:07,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:07,971 INFO L124 PetriNetUnfolderBase]: 2322/3638 cut-off events. [2025-03-08 17:33:07,972 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-08 17:33:07,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6587 conditions, 3638 events. 2322/3638 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18687 event pairs, 608 based on Foata normal form. 1/2845 useless extension candidates. Maximal degree in co-relation 6584. Up to 1685 conditions per place. [2025-03-08 17:33:07,995 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 59 selfloop transitions, 5 changer transitions 1/82 dead transitions. [2025-03-08 17:33:07,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 305 flow [2025-03-08 17:33:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-08 17:33:07,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-03-08 17:33:07,998 INFO L175 Difference]: Start difference. First operand has 45 places, 54 transitions, 114 flow. Second operand 3 states and 126 transitions. [2025-03-08 17:33:07,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 305 flow [2025-03-08 17:33:07,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 305 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:33:08,001 INFO L231 Difference]: Finished difference. Result has 48 places, 58 transitions, 147 flow [2025-03-08 17:33:08,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=48, PETRI_TRANSITIONS=58} [2025-03-08 17:33:08,002 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-03-08 17:33:08,002 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 58 transitions, 147 flow [2025-03-08 17:33:08,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-08 17:33:08,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:08,004 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] [2025-03-08 17:33:08,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:33:08,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:08,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash -372478545, now seen corresponding path program 1 times [2025-03-08 17:33:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149961221] [2025-03-08 17:33:08,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:08,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:08,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:33:08,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:33:08,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:08,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:08,149 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-08 17:33:08,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149961221] [2025-03-08 17:33:08,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149961221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:08,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318191459] [2025-03-08 17:33:08,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:08,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:08,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:08,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:08,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-08 17:33:08,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 58 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-08 17:33:08,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:08,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-08 17:33:08,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:08,638 INFO L124 PetriNetUnfolderBase]: 4366/6626 cut-off events. [2025-03-08 17:33:08,638 INFO L125 PetriNetUnfolderBase]: For 1033/1033 co-relation queries the response was YES. [2025-03-08 17:33:08,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13266 conditions, 6626 events. 4366/6626 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 35730 event pairs, 1536 based on Foata normal form. 236/5382 useless extension candidates. Maximal degree in co-relation 13261. Up to 3068 conditions per place. [2025-03-08 17:33:08,678 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 65 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-03-08 17:33:08,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 353 flow [2025-03-08 17:33:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-03-08 17:33:08,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6775956284153005 [2025-03-08 17:33:08,680 INFO L175 Difference]: Start difference. First operand has 48 places, 58 transitions, 147 flow. Second operand 3 states and 124 transitions. [2025-03-08 17:33:08,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 353 flow [2025-03-08 17:33:08,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:08,683 INFO L231 Difference]: Finished difference. Result has 50 places, 60 transitions, 167 flow [2025-03-08 17:33:08,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=60} [2025-03-08 17:33:08,684 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-03-08 17:33:08,684 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 60 transitions, 167 flow [2025-03-08 17:33:08,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-08 17:33:08,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:08,685 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] [2025-03-08 17:33:08,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:33:08,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:08,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2052771473, now seen corresponding path program 1 times [2025-03-08 17:33:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:08,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456044656] [2025-03-08 17:33:08,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:08,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:33:08,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:33:08,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:08,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:08,775 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-08 17:33:08,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456044656] [2025-03-08 17:33:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456044656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:08,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214458404] [2025-03-08 17:33:08,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:08,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:08,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:08,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:08,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-08 17:33:08,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 60 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-08 17:33:08,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:08,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-08 17:33:08,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:09,465 INFO L124 PetriNetUnfolderBase]: 8300/13328 cut-off events. [2025-03-08 17:33:09,467 INFO L125 PetriNetUnfolderBase]: For 3336/3360 co-relation queries the response was YES. [2025-03-08 17:33:09,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27078 conditions, 13328 events. 8300/13328 cut-off events. For 3336/3360 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 88033 event pairs, 2722 based on Foata normal form. 245/10625 useless extension candidates. Maximal degree in co-relation 27072. Up to 5665 conditions per place. [2025-03-08 17:33:09,565 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 74 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-03-08 17:33:09,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 422 flow [2025-03-08 17:33:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-08 17:33:09,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-03-08 17:33:09,567 INFO L175 Difference]: Start difference. First operand has 50 places, 60 transitions, 167 flow. Second operand 3 states and 126 transitions. [2025-03-08 17:33:09,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 422 flow [2025-03-08 17:33:09,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:09,570 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 178 flow [2025-03-08 17:33:09,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=3, PETRI_FLOW=178, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2025-03-08 17:33:09,570 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-08 17:33:09,570 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 61 transitions, 178 flow [2025-03-08 17:33:09,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-08 17:33:09,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:09,571 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] [2025-03-08 17:33:09,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:33:09,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:09,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash -654099839, now seen corresponding path program 1 times [2025-03-08 17:33:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:09,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633990260] [2025-03-08 17:33:09,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:09,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:09,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:33:09,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:33:09,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:09,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:09,618 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-08 17:33:09,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633990260] [2025-03-08 17:33:09,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633990260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:09,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:09,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:09,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632085897] [2025-03-08 17:33:09,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:09,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:09,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:09,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:09,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:09,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2025-03-08 17:33:09,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 61 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-08 17:33:09,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:09,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2025-03-08 17:33:09,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:10,575 INFO L124 PetriNetUnfolderBase]: 13306/19339 cut-off events. [2025-03-08 17:33:10,576 INFO L125 PetriNetUnfolderBase]: For 6492/6506 co-relation queries the response was YES. [2025-03-08 17:33:10,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42408 conditions, 19339 events. 13306/19339 cut-off events. For 6492/6506 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 113386 event pairs, 6178 based on Foata normal form. 0/15600 useless extension candidates. Maximal degree in co-relation 42401. Up to 10586 conditions per place. [2025-03-08 17:33:10,653 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 69 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-08 17:33:10,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 420 flow [2025-03-08 17:33:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-08 17:33:10,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2025-03-08 17:33:10,655 INFO L175 Difference]: Start difference. First operand has 52 places, 61 transitions, 178 flow. Second operand 3 states and 116 transitions. [2025-03-08 17:33:10,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 420 flow [2025-03-08 17:33:10,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:10,663 INFO L231 Difference]: Finished difference. Result has 55 places, 62 transitions, 206 flow [2025-03-08 17:33:10,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2025-03-08 17:33:10,663 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-08 17:33:10,665 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 206 flow [2025-03-08 17:33:10,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-08 17:33:10,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:10,665 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] [2025-03-08 17:33:10,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:33:10,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1972123043, now seen corresponding path program 1 times [2025-03-08 17:33:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675024208] [2025-03-08 17:33:10,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:10,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 17:33:10,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 17:33:10,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:10,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:10,820 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-08 17:33:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675024208] [2025-03-08 17:33:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675024208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:10,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834812491] [2025-03-08 17:33:10,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:10,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:10,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:10,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:10,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-08 17:33:10,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-08 17:33:10,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:10,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-08 17:33:10,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:11,694 INFO L124 PetriNetUnfolderBase]: 12900/19830 cut-off events. [2025-03-08 17:33:11,694 INFO L125 PetriNetUnfolderBase]: For 9542/9724 co-relation queries the response was YES. [2025-03-08 17:33:11,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43792 conditions, 19830 events. 12900/19830 cut-off events. For 9542/9724 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 128386 event pairs, 9082 based on Foata normal form. 318/16318 useless extension candidates. Maximal degree in co-relation 43784. Up to 13549 conditions per place. [2025-03-08 17:33:11,862 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 74 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-03-08 17:33:11,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 446 flow [2025-03-08 17:33:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-03-08 17:33:11,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2025-03-08 17:33:11,864 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 206 flow. Second operand 4 states and 150 transitions. [2025-03-08 17:33:11,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 446 flow [2025-03-08 17:33:11,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:33:11,876 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 216 flow [2025-03-08 17:33:11,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2025-03-08 17:33:11,877 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2025-03-08 17:33:11,877 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 216 flow [2025-03-08 17:33:11,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-08 17:33:11,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:11,878 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] [2025-03-08 17:33:11,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:33:11,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash -929131362, now seen corresponding path program 1 times [2025-03-08 17:33:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:11,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303791776] [2025-03-08 17:33:11,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:11,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:33:11,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:33:11,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:11,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:12,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:12,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303791776] [2025-03-08 17:33:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303791776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:12,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222438125] [2025-03-08 17:33:12,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:12,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:12,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:12,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:33:12,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:33:12,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:33:12,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:33:12,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:12,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:12,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 17:33:12,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:12,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:33:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:13,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:13,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-08 17:33:13,406 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:33:13,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-08 17:33:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222438125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:13,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2025-03-08 17:33:13,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56326566] [2025-03-08 17:33:13,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:13,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 17:33:13,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:13,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 17:33:13,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-08 17:33:13,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-08 17:33:13,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 216 flow. Second operand has 21 states, 21 states have (on average 24.285714285714285) internal successors, (510), 21 states have internal predecessors, (510), 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-08 17:33:13,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:13,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-08 17:33:13,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:18,192 INFO L124 PetriNetUnfolderBase]: 48122/72940 cut-off events. [2025-03-08 17:33:18,193 INFO L125 PetriNetUnfolderBase]: For 33599/35013 co-relation queries the response was YES. [2025-03-08 17:33:18,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162345 conditions, 72940 events. 48122/72940 cut-off events. For 33599/35013 co-relation queries the response was YES. Maximal size of possible extension queue 2258. Compared 544048 event pairs, 7809 based on Foata normal form. 132/58291 useless extension candidates. Maximal degree in co-relation 162335. Up to 11256 conditions per place. [2025-03-08 17:33:18,625 INFO L140 encePairwiseOnDemand]: 41/61 looper letters, 491 selfloop transitions, 134 changer transitions 10/653 dead transitions. [2025-03-08 17:33:18,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 653 transitions, 3182 flow [2025-03-08 17:33:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 17:33:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-08 17:33:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 1325 transitions. [2025-03-08 17:33:18,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6033697632058288 [2025-03-08 17:33:18,629 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 216 flow. Second operand 36 states and 1325 transitions. [2025-03-08 17:33:18,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 653 transitions, 3182 flow [2025-03-08 17:33:18,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 653 transitions, 3178 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:18,655 INFO L231 Difference]: Finished difference. Result has 118 places, 199 transitions, 1380 flow [2025-03-08 17:33:18,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1380, PETRI_PLACES=118, PETRI_TRANSITIONS=199} [2025-03-08 17:33:18,655 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 68 predicate places. [2025-03-08 17:33:18,655 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 199 transitions, 1380 flow [2025-03-08 17:33:18,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 24.285714285714285) internal successors, (510), 21 states have internal predecessors, (510), 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-08 17:33:18,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:18,656 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] [2025-03-08 17:33:18,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:18,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:18,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:18,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash -253612935, now seen corresponding path program 1 times [2025-03-08 17:33:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677496617] [2025-03-08 17:33:18,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:18,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 17:33:18,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:33:18,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:18,901 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-08 17:33:18,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:18,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677496617] [2025-03-08 17:33:18,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677496617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:18,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:18,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528394140] [2025-03-08 17:33:18,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:18,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:18,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:18,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:18,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:18,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 61 [2025-03-08 17:33:18,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 199 transitions, 1380 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-08 17:33:18,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:18,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 61 [2025-03-08 17:33:18,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:26,061 INFO L124 PetriNetUnfolderBase]: 64061/92440 cut-off events. [2025-03-08 17:33:26,061 INFO L125 PetriNetUnfolderBase]: For 644935/647925 co-relation queries the response was YES. [2025-03-08 17:33:26,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435140 conditions, 92440 events. 64061/92440 cut-off events. For 644935/647925 co-relation queries the response was YES. Maximal size of possible extension queue 1933. Compared 617710 event pairs, 23996 based on Foata normal form. 160/77312 useless extension candidates. Maximal degree in co-relation 435104. Up to 42516 conditions per place. [2025-03-08 17:33:26,957 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 133 selfloop transitions, 14 changer transitions 22/182 dead transitions. [2025-03-08 17:33:26,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 182 transitions, 1602 flow [2025-03-08 17:33:26,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-08 17:33:26,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6120218579234973 [2025-03-08 17:33:26,958 INFO L175 Difference]: Start difference. First operand has 118 places, 199 transitions, 1380 flow. Second operand 3 states and 112 transitions. [2025-03-08 17:33:26,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 182 transitions, 1602 flow [2025-03-08 17:33:27,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 182 transitions, 1472 flow, removed 63 selfloop flow, removed 10 redundant places. [2025-03-08 17:33:27,973 INFO L231 Difference]: Finished difference. Result has 102 places, 129 transitions, 854 flow [2025-03-08 17:33:27,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=102, PETRI_TRANSITIONS=129} [2025-03-08 17:33:27,974 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2025-03-08 17:33:27,974 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 129 transitions, 854 flow [2025-03-08 17:33:27,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-08 17:33:27,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:27,974 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] [2025-03-08 17:33:27,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:33:27,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:27,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1012454617, now seen corresponding path program 1 times [2025-03-08 17:33:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-08 17:33:27,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:27,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 17:33:27,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 17:33:27,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:27,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:28,010 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-08 17:33:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-08 17:33:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429963816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255904970] [2025-03-08 17:33:28,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:28,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:28,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:28,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:28,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:28,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2025-03-08 17:33:28,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 129 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-08 17:33:28,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:28,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2025-03-08 17:33:28,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:35,309 INFO L124 PetriNetUnfolderBase]: 69635/104829 cut-off events. [2025-03-08 17:33:35,309 INFO L125 PetriNetUnfolderBase]: For 279622/284419 co-relation queries the response was YES. [2025-03-08 17:33:35,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369915 conditions, 104829 events. 69635/104829 cut-off events. For 279622/284419 co-relation queries the response was YES. Maximal size of possible extension queue 2158. Compared 774740 event pairs, 35729 based on Foata normal form. 148/84728 useless extension candidates. Maximal degree in co-relation 369886. Up to 64954 conditions per place. [2025-03-08 17:33:36,224 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 134 selfloop transitions, 7 changer transitions 2/159 dead transitions. [2025-03-08 17:33:36,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 159 transitions, 1365 flow [2025-03-08 17:33:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-08 17:33:36,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2025-03-08 17:33:36,226 INFO L175 Difference]: Start difference. First operand has 102 places, 129 transitions, 854 flow. Second operand 3 states and 116 transitions. [2025-03-08 17:33:36,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 159 transitions, 1365 flow [2025-03-08 17:33:36,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 159 transitions, 1259 flow, removed 34 selfloop flow, removed 8 redundant places. [2025-03-08 17:33:36,667 INFO L231 Difference]: Finished difference. Result has 91 places, 122 transitions, 762 flow [2025-03-08 17:33:36,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=91, PETRI_TRANSITIONS=122} [2025-03-08 17:33:36,668 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2025-03-08 17:33:36,668 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 122 transitions, 762 flow [2025-03-08 17:33:36,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-08 17:33:36,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:36,668 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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] [2025-03-08 17:33:36,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:33:36,668 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:36,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 251367654, now seen corresponding path program 1 times [2025-03-08 17:33:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658196898] [2025-03-08 17:33:36,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:36,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 17:33:36,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 17:33:36,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:36,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:33:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658196898] [2025-03-08 17:33:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658196898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:36,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:36,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189257145] [2025-03-08 17:33:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:36,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:36,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:36,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:36,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-08 17:33:36,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 122 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-08 17:33:36,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:36,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-08 17:33:36,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:43,333 INFO L124 PetriNetUnfolderBase]: 63815/99118 cut-off events. [2025-03-08 17:33:43,333 INFO L125 PetriNetUnfolderBase]: For 245420/252858 co-relation queries the response was YES. [2025-03-08 17:33:43,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311037 conditions, 99118 events. 63815/99118 cut-off events. For 245420/252858 co-relation queries the response was YES. Maximal size of possible extension queue 1906. Compared 755678 event pairs, 19206 based on Foata normal form. 1152/79902 useless extension candidates. Maximal degree in co-relation 311013. Up to 59172 conditions per place. [2025-03-08 17:33:44,020 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 135 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-08 17:33:44,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 157 transitions, 1278 flow [2025-03-08 17:33:44,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-08 17:33:44,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-08 17:33:44,021 INFO L175 Difference]: Start difference. First operand has 91 places, 122 transitions, 762 flow. Second operand 3 states and 122 transitions. [2025-03-08 17:33:44,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 157 transitions, 1278 flow [2025-03-08 17:33:44,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 157 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:33:44,424 INFO L231 Difference]: Finished difference. Result has 91 places, 119 transitions, 731 flow [2025-03-08 17:33:44,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=731, PETRI_PLACES=91, PETRI_TRANSITIONS=119} [2025-03-08 17:33:44,424 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2025-03-08 17:33:44,424 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 119 transitions, 731 flow [2025-03-08 17:33:44,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-08 17:33:44,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:44,425 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-08 17:33:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:33:44,425 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:33:44,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1167948215, now seen corresponding path program 1 times [2025-03-08 17:33:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382622376] [2025-03-08 17:33:44,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:44,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:44,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 17:33:44,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 17:33:44,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:44,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:33:45,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382622376] [2025-03-08 17:33:45,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382622376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:45,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109224028] [2025-03-08 17:33:45,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:45,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:45,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:45,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:33:45,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:33:45,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 17:33:45,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 17:33:45,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:45,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:45,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 17:33:45,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:33:45,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:45,572 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 17:33:45,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 17:33:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 17:33:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109224028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:45,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 16 [2025-03-08 17:33:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468238690] [2025-03-08 17:33:45,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:45,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 17:33:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:45,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 17:33:45,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:33:45,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-03-08 17:33:45,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 119 transitions, 731 flow. Second operand has 17 states, 17 states have (on average 24.41176470588235) internal successors, (415), 17 states have internal predecessors, (415), 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-08 17:33:45,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:45,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-03-08 17:33:45,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand