./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:34:08,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:34:08,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:34:08,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:34:08,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:34:08,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:34:08,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:34:08,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:34:08,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:34:08,737 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:34:08,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:34:08,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:34:08,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:34:08,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:34:08,738 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:34:08,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:34:08,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:34:08,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:34:08,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:34:08,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:34:08,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:34:08,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:34:08,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:34:08,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:34:08,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:34:08,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:34:08,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:34:08,742 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-jdk21/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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-02-06 04:34:08,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:34:08,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:34:08,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:34:08,973 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:34:08,973 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:34:08,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-02-06 04:34:10,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10f507e1c/335afbb6e50b4ada8aa3cd462fda1997/FLAGed22cb03a [2025-02-06 04:34:10,423 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:34:10,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-02-06 04:34:10,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10f507e1c/335afbb6e50b4ada8aa3cd462fda1997/FLAGed22cb03a [2025-02-06 04:34:10,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10f507e1c/335afbb6e50b4ada8aa3cd462fda1997 [2025-02-06 04:34:10,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:34:10,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:34:10,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:34:10,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:34:10,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:34:10,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:10,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dace18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10, skipping insertion in model container [2025-02-06 04:34:10,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:10,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:34:10,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c[3984,3997] [2025-02-06 04:34:10,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:34:10,930 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:34:10,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c[3984,3997] [2025-02-06 04:34:10,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:34:10,967 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:34:10,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10 WrapperNode [2025-02-06 04:34:10,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:34:10,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:34:10,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:34:10,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:34:10,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:10,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,019 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2025-02-06 04:34:11,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:34:11,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:34:11,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:34:11,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:34:11,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,065 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 9, 15]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-02-06 04:34:11,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:34:11,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:34:11,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:34:11,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:34:11,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (1/1) ... [2025-02-06 04:34:11,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:34:11,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:11,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:34:11,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:34:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:34:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:34:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:34:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:34:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:34:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:34:11,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:34:11,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 04:34:11,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:34:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:34:11,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:34:11,132 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:34:11,221 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:34:11,222 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:34:11,685 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:34:11,685 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:34:12,051 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:34:12,051 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:34:12,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:34:12 BoogieIcfgContainer [2025-02-06 04:34:12,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:34:12,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:34:12,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:34:12,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:34:12,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:34:10" (1/3) ... [2025-02-06 04:34:12,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d607e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:34:12, skipping insertion in model container [2025-02-06 04:34:12,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:34:10" (2/3) ... [2025-02-06 04:34:12,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d607e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:34:12, skipping insertion in model container [2025-02-06 04:34:12,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:34:12" (3/3) ... [2025-02-06 04:34:12,059 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-02-06 04:34:12,073 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:34:12,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-06 04:34:12,076 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:34:12,141 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:34:12,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-02-06 04:34:12,203 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-02-06 04:34:12,206 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:34:12,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-06 04:34:12,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-02-06 04:34:12,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-02-06 04:34:12,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:34:12,233 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;@6075fda0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:34:12,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:34:12,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:34:12,246 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-02-06 04:34:12,247 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:34:12,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:12,247 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-02-06 04:34:12,248 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-02-06 04:34:12,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1827037519, now seen corresponding path program 1 times [2025-02-06 04:34:12,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-02-06 04:34:12,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:12,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:34:12,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:34:12,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:12,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:34:12,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839612250] [2025-02-06 04:34:12,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839612250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:12,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:34:12,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182813050] [2025-02-06 04:34:12,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:12,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:34:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:12,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:34:12,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:34:12,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:12,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-06 04:34:12,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:12,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:12,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:12,928 INFO L124 PetriNetUnfolderBase]: 38/83 cut-off events. [2025-02-06 04:34:12,929 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 04:34:12,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 83 events. 38/83 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2025-02-06 04:34:12,933 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-02-06 04:34:12,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2025-02-06 04:34:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:34:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:34:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-02-06 04:34:12,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2025-02-06 04:34:12,956 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 40 transitions. [2025-02-06 04:34:12,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2025-02-06 04:34:12,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 04:34:12,964 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2025-02-06 04:34:12,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2025-02-06 04:34:12,970 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-02-06 04:34:12,971 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2025-02-06 04:34:12,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-06 04:34:12,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:12,971 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] [2025-02-06 04:34:12,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:34:12,972 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-02-06 04:34:12,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash 552778432, now seen corresponding path program 1 times [2025-02-06 04:34:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:12,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421448230] [2025-02-06 04:34:12,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:12,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:34:13,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:34:13,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:13,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:34:13,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:13,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421448230] [2025-02-06 04:34:13,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421448230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:13,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:13,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:34:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401851491] [2025-02-06 04:34:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:13,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:34:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:13,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:34:13,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:34:13,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:13,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-06 04:34:13,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:13,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:13,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:13,328 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2025-02-06 04:34:13,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:34:13,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 84 events. 38/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 172. Up to 81 conditions per place. [2025-02-06 04:34:13,330 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 24 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-02-06 04:34:13,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 130 flow [2025-02-06 04:34:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:34:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:34:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-02-06 04:34:13,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2025-02-06 04:34:13,332 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 4 states and 45 transitions. [2025-02-06 04:34:13,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 130 flow [2025-02-06 04:34:13,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:34:13,334 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 86 flow [2025-02-06 04:34:13,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-02-06 04:34:13,335 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2025-02-06 04:34:13,335 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 86 flow [2025-02-06 04:34:13,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-06 04:34:13,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:13,335 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] [2025-02-06 04:34:13,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:34:13,336 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-02-06 04:34:13,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 274854040, now seen corresponding path program 1 times [2025-02-06 04:34:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096981904] [2025-02-06 04:34:13,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:13,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:34:13,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:34:13,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:13,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:34:13,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:13,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096981904] [2025-02-06 04:34:13,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096981904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:13,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:13,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:34:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968722625] [2025-02-06 04:34:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:13,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:34:13,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:13,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:34:13,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:34:13,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:13,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-02-06 04:34:13,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:13,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:13,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:13,650 INFO L124 PetriNetUnfolderBase]: 38/85 cut-off events. [2025-02-06 04:34:13,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:34:13,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 85 events. 38/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 172. Up to 82 conditions per place. [2025-02-06 04:34:13,652 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 25 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-02-06 04:34:13,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 146 flow [2025-02-06 04:34:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:34:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:34:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-02-06 04:34:13,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2025-02-06 04:34:13,654 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 86 flow. Second operand 4 states and 45 transitions. [2025-02-06 04:34:13,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 146 flow [2025-02-06 04:34:13,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:34:13,655 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 103 flow [2025-02-06 04:34:13,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-02-06 04:34:13,655 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2025-02-06 04:34:13,656 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 103 flow [2025-02-06 04:34:13,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-02-06 04:34:13,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:13,656 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-02-06 04:34:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:34:13,656 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-02-06 04:34:13,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash -786339793, now seen corresponding path program 1 times [2025-02-06 04:34:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83290336] [2025-02-06 04:34:13,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:13,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:13,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:34:13,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:34:13,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:13,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:34:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:13,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83290336] [2025-02-06 04:34:13,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83290336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:13,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:34:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209935489] [2025-02-06 04:34:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:34:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:13,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:34:13,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:34:13,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:13,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-02-06 04:34:13,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:13,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:13,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:13,918 INFO L124 PetriNetUnfolderBase]: 38/86 cut-off events. [2025-02-06 04:34:13,918 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:34:13,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 86 events. 38/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 179. Up to 84 conditions per place. [2025-02-06 04:34:13,919 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-02-06 04:34:13,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 165 flow [2025-02-06 04:34:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:34:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:34:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-02-06 04:34:13,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-02-06 04:34:13,922 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 103 flow. Second operand 4 states and 44 transitions. [2025-02-06 04:34:13,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 165 flow [2025-02-06 04:34:13,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:34:13,923 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 113 flow [2025-02-06 04:34:13,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-02-06 04:34:13,923 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2025-02-06 04:34:13,924 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 113 flow [2025-02-06 04:34:13,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-02-06 04:34:13,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:13,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:13,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:34:13,924 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-02-06 04:34:13,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash 445273649, now seen corresponding path program 1 times [2025-02-06 04:34:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:13,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824550363] [2025-02-06 04:34:13,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:13,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:34:13,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:34:13,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:13,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:34:14,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:14,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824550363] [2025-02-06 04:34:14,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824550363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:14,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:14,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:34:14,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147412633] [2025-02-06 04:34:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:14,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:34:14,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:14,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:34:14,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:34:14,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:14,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-02-06 04:34:14,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:14,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:14,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:14,173 INFO L124 PetriNetUnfolderBase]: 38/87 cut-off events. [2025-02-06 04:34:14,173 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:34:14,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 87 events. 38/87 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 185. Up to 85 conditions per place. [2025-02-06 04:34:14,174 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-02-06 04:34:14,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 177 flow [2025-02-06 04:34:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:34:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:34:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-02-06 04:34:14,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-02-06 04:34:14,179 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 113 flow. Second operand 4 states and 44 transitions. [2025-02-06 04:34:14,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 177 flow [2025-02-06 04:34:14,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 171 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:34:14,181 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2025-02-06 04:34:14,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-02-06 04:34:14,181 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2025-02-06 04:34:14,181 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2025-02-06 04:34:14,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-02-06 04:34:14,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:14,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:14,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:34:14,182 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-02-06 04:34:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1737051261, now seen corresponding path program 1 times [2025-02-06 04:34:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:14,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-02-06 04:34:14,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:14,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:34:14,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:34:14,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:14,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:34:14,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-02-06 04:34:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798448606] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:34:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675293951] [2025-02-06 04:34:14,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:14,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:14,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:34:14,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:34:14,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:34:14,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 04:34:14,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 04:34:14,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:14,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:14,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:34:14,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:34:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:34:14,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:34:14,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675293951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:14,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:34:14,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-06 04:34:14,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672045732] [2025-02-06 04:34:14,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:14,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:34:14,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:14,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:34:14,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:34:14,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:14,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-02-06 04:34:14,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:14,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:14,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:14,689 INFO L124 PetriNetUnfolderBase]: 38/88 cut-off events. [2025-02-06 04:34:14,689 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 04:34:14,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 88 events. 38/88 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 32 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 190. Up to 86 conditions per place. [2025-02-06 04:34:14,690 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-06 04:34:14,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 187 flow [2025-02-06 04:34:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:34:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:34:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-02-06 04:34:14,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-02-06 04:34:14,692 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 4 states and 44 transitions. [2025-02-06 04:34:14,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 187 flow [2025-02-06 04:34:14,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 181 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:34:14,694 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 129 flow [2025-02-06 04:34:14,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-02-06 04:34:14,695 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2025-02-06 04:34:14,695 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 129 flow [2025-02-06 04:34:14,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-02-06 04:34:14,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:14,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:14,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:34:14,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:34:14,900 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-02-06 04:34:14,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1645648858, now seen corresponding path program 1 times [2025-02-06 04:34:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149098815] [2025-02-06 04:34:14,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:34:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:14,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 04:34:14,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:34:14,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:34:14,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:34:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149098815] [2025-02-06 04:34:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149098815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:34:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879977873] [2025-02-06 04:34:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:15,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:34:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:15,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:34:15,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:34:15,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:15,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:15,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:15,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:15,978 INFO L124 PetriNetUnfolderBase]: 39/107 cut-off events. [2025-02-06 04:34:15,978 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 04:34:15,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 107 events. 39/107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 282 event pairs, 7 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 231. Up to 41 conditions per place. [2025-02-06 04:34:15,979 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 2 changer transitions 7/52 dead transitions. [2025-02-06 04:34:15,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 278 flow [2025-02-06 04:34:15,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:34:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:34:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2025-02-06 04:34:15,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2025-02-06 04:34:15,980 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 129 flow. Second operand 5 states and 66 transitions. [2025-02-06 04:34:15,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 278 flow [2025-02-06 04:34:15,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 272 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:34:15,982 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 138 flow [2025-02-06 04:34:15,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2025-02-06 04:34:15,983 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2025-02-06 04:34:15,983 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 138 flow [2025-02-06 04:34:15,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:15,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:15,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:15,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:34:15,983 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-02-06 04:34:15,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1576563708, now seen corresponding path program 2 times [2025-02-06 04:34:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:15,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335293938] [2025-02-06 04:34:15,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:34:15,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:16,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:34:16,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 27 statements. [2025-02-06 04:34:16,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:34:16,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:34:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335293938] [2025-02-06 04:34:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335293938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:34:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922454867] [2025-02-06 04:34:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:16,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:34:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:16,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:34:16,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:34:16,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:16,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:16,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:16,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:16,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:16,779 INFO L124 PetriNetUnfolderBase]: 35/112 cut-off events. [2025-02-06 04:34:16,779 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-06 04:34:16,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 112 events. 35/112 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 315 event pairs, 10 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 295. Up to 48 conditions per place. [2025-02-06 04:34:16,780 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 41 selfloop transitions, 3 changer transitions 5/50 dead transitions. [2025-02-06 04:34:16,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 286 flow [2025-02-06 04:34:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:34:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:34:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-02-06 04:34:16,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2025-02-06 04:34:16,782 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 138 flow. Second operand 5 states and 63 transitions. [2025-02-06 04:34:16,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 286 flow [2025-02-06 04:34:16,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 279 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 04:34:16,783 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 155 flow [2025-02-06 04:34:16,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-02-06 04:34:16,784 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2025-02-06 04:34:16,784 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 155 flow [2025-02-06 04:34:16,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:16,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:16,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:16,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:34:16,785 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-02-06 04:34:16,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1358682176, now seen corresponding path program 3 times [2025-02-06 04:34:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522805052] [2025-02-06 04:34:16,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:34:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:16,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:34:16,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 27 statements. [2025-02-06 04:34:16,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:34:16,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:34:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522805052] [2025-02-06 04:34:17,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522805052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:17,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:17,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:34:17,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80037049] [2025-02-06 04:34:17,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:17,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:34:17,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:17,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:34:17,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:34:17,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:17,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:17,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:17,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:17,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:17,509 INFO L124 PetriNetUnfolderBase]: 35/115 cut-off events. [2025-02-06 04:34:17,509 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-02-06 04:34:17,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 115 events. 35/115 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 351 event pairs, 8 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 353. Up to 50 conditions per place. [2025-02-06 04:34:17,510 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 40 selfloop transitions, 2 changer transitions 9/52 dead transitions. [2025-02-06 04:34:17,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 318 flow [2025-02-06 04:34:17,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:34:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:34:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-02-06 04:34:17,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2025-02-06 04:34:17,514 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 155 flow. Second operand 5 states and 64 transitions. [2025-02-06 04:34:17,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 318 flow [2025-02-06 04:34:17,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 307 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 04:34:17,516 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 162 flow [2025-02-06 04:34:17,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2025-02-06 04:34:17,517 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2025-02-06 04:34:17,517 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 162 flow [2025-02-06 04:34:17,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:17,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:17,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:17,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:34:17,517 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-02-06 04:34:17,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash 222734542, now seen corresponding path program 4 times [2025-02-06 04:34:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:17,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895168969] [2025-02-06 04:34:17,518 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:34:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:17,544 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:34:17,566 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:34:17,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:34:17,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:34:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:18,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895168969] [2025-02-06 04:34:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895168969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:18,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:34:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475941743] [2025-02-06 04:34:18,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:18,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:34:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:18,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:34:18,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:34:18,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:18,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:18,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:18,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:18,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:18,276 INFO L124 PetriNetUnfolderBase]: 30/98 cut-off events. [2025-02-06 04:34:18,276 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-02-06 04:34:18,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 98 events. 30/98 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 229 event pairs, 15 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 332. Up to 64 conditions per place. [2025-02-06 04:34:18,277 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 40 selfloop transitions, 3 changer transitions 7/51 dead transitions. [2025-02-06 04:34:18,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 330 flow [2025-02-06 04:34:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:34:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:34:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-02-06 04:34:18,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-02-06 04:34:18,278 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 162 flow. Second operand 5 states and 62 transitions. [2025-02-06 04:34:18,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 330 flow [2025-02-06 04:34:18,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 311 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-06 04:34:18,280 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 169 flow [2025-02-06 04:34:18,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2025-02-06 04:34:18,281 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-02-06 04:34:18,281 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 169 flow [2025-02-06 04:34:18,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:18,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:18,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:18,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:34:18,286 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-02-06 04:34:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1037016458, now seen corresponding path program 5 times [2025-02-06 04:34:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097997250] [2025-02-06 04:34:18,287 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 04:34:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:18,310 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:34:18,329 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 04:34:18,330 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:34:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:34:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097997250] [2025-02-06 04:34:18,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097997250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:18,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:18,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:34:18,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862547773] [2025-02-06 04:34:18,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:34:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:18,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:34:18,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:34:18,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:18,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:18,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:18,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:18,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:18,993 INFO L124 PetriNetUnfolderBase]: 24/77 cut-off events. [2025-02-06 04:34:18,994 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-02-06 04:34:18,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 77 events. 24/77 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 7 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 276. Up to 45 conditions per place. [2025-02-06 04:34:18,995 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 33 selfloop transitions, 1 changer transitions 14/49 dead transitions. [2025-02-06 04:34:18,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 307 flow [2025-02-06 04:34:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:34:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:34:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-02-06 04:34:18,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-02-06 04:34:18,999 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 169 flow. Second operand 5 states and 62 transitions. [2025-02-06 04:34:18,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 307 flow [2025-02-06 04:34:19,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 04:34:19,001 INFO L231 Difference]: Finished difference. Result has 56 places, 33 transitions, 148 flow [2025-02-06 04:34:19,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=33} [2025-02-06 04:34:19,001 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2025-02-06 04:34:19,001 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 33 transitions, 148 flow [2025-02-06 04:34:19,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:19,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:34:19,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:19,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:34:19,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-06 04:34:19,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:34:19,002 INFO L85 PathProgramCache]: Analyzing trace with hash -724173860, now seen corresponding path program 6 times [2025-02-06 04:34:19,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:34:19,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325488260] [2025-02-06 04:34:19,002 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 04:34:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:34:19,017 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-02-06 04:34:19,029 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 27 statements. [2025-02-06 04:34:19,029 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 04:34:19,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:34:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 04:34:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:34:19,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325488260] [2025-02-06 04:34:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325488260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:34:19,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:34:19,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:34:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646380307] [2025-02-06 04:34:19,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:34:19,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:34:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:34:19,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:34:19,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:34:19,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-02-06 04:34:19,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 33 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:19,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:34:19,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-02-06 04:34:19,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:34:19,599 INFO L124 PetriNetUnfolderBase]: 15/51 cut-off events. [2025-02-06 04:34:19,599 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 04:34:19,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 51 events. 15/51 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 5 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 181. Up to 38 conditions per place. [2025-02-06 04:34:19,599 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2025-02-06 04:34:19,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 37 transitions, 236 flow [2025-02-06 04:34:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:34:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:34:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-02-06 04:34:19,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2025-02-06 04:34:19,601 INFO L175 Difference]: Start difference. First operand has 56 places, 33 transitions, 148 flow. Second operand 5 states and 52 transitions. [2025-02-06 04:34:19,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 37 transitions, 236 flow [2025-02-06 04:34:19,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 218 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-06 04:34:19,602 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2025-02-06 04:34:19,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2025-02-06 04:34:19,602 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2025-02-06 04:34:19,602 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2025-02-06 04:34:19,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-02-06 04:34:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-02-06 04:34:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-02-06 04:34:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-06 04:34:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-02-06 04:34:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:34:19,609 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-02-06 04:34:19,611 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:34:19,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:34:19,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:34:19 BasicIcfg [2025-02-06 04:34:19,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:34:19,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:34:19,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:34:19,615 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:34:19,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:34:12" (3/4) ... [2025-02-06 04:34:19,616 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 04:34:19,622 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 04:34:19,622 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 04:34:19,622 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 04:34:19,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 223 nodes and edges [2025-02-06 04:34:19,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 106 nodes and edges [2025-02-06 04:34:19,628 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2025-02-06 04:34:19,629 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 04:34:19,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:34:19,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:34:19,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:34:19,703 INFO L158 Benchmark]: Toolchain (without parser) took 8972.42ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 112.0MB in the beginning and 161.4MB in the end (delta: -49.4MB). Peak memory consumption was 172.8MB. Max. memory is 16.1GB. [2025-02-06 04:34:19,703 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:34:19,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.57ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:34:19,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.12ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:34:19,705 INFO L158 Benchmark]: Boogie Preprocessor took 54.77ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:34:19,705 INFO L158 Benchmark]: IcfgBuilder took 972.58ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 95.2MB in the end (delta: -2.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-02-06 04:34:19,706 INFO L158 Benchmark]: TraceAbstraction took 7561.17ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 94.4MB in the beginning and 169.8MB in the end (delta: -75.4MB). Peak memory consumption was 149.0MB. Max. memory is 16.1GB. [2025-02-06 04:34:19,706 INFO L158 Benchmark]: Witness Printer took 87.16ms. Allocated memory is still 369.1MB. Free memory was 169.8MB in the beginning and 161.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:34:19,707 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.59ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.57ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.12ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.77ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 972.58ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 95.2MB in the end (delta: -2.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7561.17ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 94.4MB in the beginning and 169.8MB in the end (delta: -75.4MB). Peak memory consumption was 149.0MB. Max. memory is 16.1GB. * Witness Printer took 87.16ms. Allocated memory is still 369.1MB. Free memory was 169.8MB in the beginning and 161.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 35 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1064 IncrementalHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 1064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 329 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 1423 SizeOfPredicates, 2 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 55/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 04:34:19,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE