./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -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 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:05:55,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:05:55,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:05:55,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:05:55,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:05:55,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:05:55,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:05:55,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:05:55,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:05:55,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:05:55,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:05:55,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:05:55,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:05:55,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:05:55,841 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:05:55,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:05:55,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:05:55,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:05:55,842 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2025-02-08 01:05:56,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:05:56,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:05:56,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:05:56,187 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:05:56,187 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:05:56,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:05:57,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d96bef71d/0f94f5845547461d97a818a39bb60e29/FLAGb9f66b158 [2025-02-08 01:05:57,690 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:05:57,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:05:57,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d96bef71d/0f94f5845547461d97a818a39bb60e29/FLAGb9f66b158 [2025-02-08 01:05:57,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d96bef71d/0f94f5845547461d97a818a39bb60e29 [2025-02-08 01:05:57,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:05:57,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:05:57,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:05:57,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:05:57,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:05:57,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:05:57" (1/1) ... [2025-02-08 01:05:57,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:57, skipping insertion in model container [2025-02-08 01:05:57,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:05:57" (1/1) ... [2025-02-08 01:05:57,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:05:58,087 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/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2025-02-08 01:05:58,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:05:58,199 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:05:58,207 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/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2025-02-08 01:05:58,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:05:58,261 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:05:58,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58 WrapperNode [2025-02-08 01:05:58,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:05:58,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:05:58,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:05:58,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:05:58,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,295 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2025-02-08 01:05:58,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:05:58,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:05:58,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:05:58,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:05:58,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,315 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:05:58,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:05:58,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:05:58,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:05:58,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:05:58,337 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (1/1) ... [2025-02-08 01:05:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:05:58,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:05:58,364 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-08 01:05:58,372 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-08 01:05:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:05:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:05:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 01:05:58,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 01:05:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 01:05:58,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 01:05:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:05:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:05:58,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:05:58,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:05:58,389 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:05:58,511 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:05:58,513 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:05:58,812 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:05:58,812 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:05:58,982 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:05:58,982 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:05:58,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:05:58 BoogieIcfgContainer [2025-02-08 01:05:58,982 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:05:58,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:05:58,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:05:58,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:05:58,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:05:57" (1/3) ... [2025-02-08 01:05:58,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc7276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:05:58, skipping insertion in model container [2025-02-08 01:05:58,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:05:58" (2/3) ... [2025-02-08 01:05:58,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc7276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:05:58, skipping insertion in model container [2025-02-08 01:05:58,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:05:58" (3/3) ... [2025-02-08 01:05:58,988 INFO L128 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:05:59,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:05:59,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe029_power.opt_pso.opt_rmo.opt.i that has 3 procedures, 30 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-08 01:05:59,009 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:05:59,066 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:05:59,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 68 flow [2025-02-08 01:05:59,141 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2025-02-08 01:05:59,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:05:59,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-02-08 01:05:59,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 30 transitions, 68 flow [2025-02-08 01:05:59,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 62 flow [2025-02-08 01:05:59,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:05:59,164 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;@29975874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:05:59,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:05:59,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:05:59,172 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 01:05:59,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:05:59,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:05:59,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 01:05:59,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:05:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:05:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 341762449, now seen corresponding path program 1 times [2025-02-08 01:05:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:05:59,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167614315] [2025-02-08 01:05:59,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:05:59,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:05:59,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 01:05:59,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 01:05:59,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:05:59,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:05:59,582 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-08 01:05:59,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:05:59,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167614315] [2025-02-08 01:05:59,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167614315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:05:59,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:05:59,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 01:05:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123371132] [2025-02-08 01:05:59,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:05:59,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:05:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:05:59,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:05:59,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:05:59,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-02-08 01:05:59,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 01:05:59,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:05:59,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-02-08 01:05:59,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:05:59,867 INFO L124 PetriNetUnfolderBase]: 455/777 cut-off events. [2025-02-08 01:05:59,867 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:05:59,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 777 events. 455/777 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3474 event pairs, 45 based on Foata normal form. 36/806 useless extension candidates. Maximal degree in co-relation 1541. Up to 651 conditions per place. [2025-02-08 01:05:59,877 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 29 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2025-02-08 01:05:59,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 148 flow [2025-02-08 01:05:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:05:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:05:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-08 01:05:59,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-02-08 01:05:59,887 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 62 flow. Second operand 3 states and 57 transitions. [2025-02-08 01:05:59,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 148 flow [2025-02-08 01:05:59,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:05:59,894 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 58 flow [2025-02-08 01:05:59,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-02-08 01:05:59,900 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-02-08 01:05:59,901 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 58 flow [2025-02-08 01:05:59,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-08 01:05:59,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:05:59,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:05:59,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:05:59,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:05:59,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:05:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash -504916325, now seen corresponding path program 1 times [2025-02-08 01:05:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:05:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138703699] [2025-02-08 01:05:59,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:05:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:05:59,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 01:05:59,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 01:05:59,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:05:59,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:00,554 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-08 01:06:00,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138703699] [2025-02-08 01:06:00,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138703699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:00,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:00,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:06:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322857756] [2025-02-08 01:06:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:00,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:06:00,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:00,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:06:00,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:06:00,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-02-08 01:06:00,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 58 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-08 01:06:00,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:00,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-02-08 01:06:00,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:01,169 INFO L124 PetriNetUnfolderBase]: 745/1279 cut-off events. [2025-02-08 01:06:01,169 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-08 01:06:01,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 1279 events. 745/1279 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6418 event pairs, 191 based on Foata normal form. 0/1240 useless extension candidates. Maximal degree in co-relation 2598. Up to 729 conditions per place. [2025-02-08 01:06:01,177 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 34 selfloop transitions, 8 changer transitions 63/108 dead transitions. [2025-02-08 01:06:01,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 108 transitions, 448 flow [2025-02-08 01:06:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:06:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:06:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2025-02-08 01:06:01,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-02-08 01:06:01,179 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 58 flow. Second operand 12 states and 168 transitions. [2025-02-08 01:06:01,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 108 transitions, 448 flow [2025-02-08 01:06:01,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 108 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:06:01,183 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 125 flow [2025-02-08 01:06:01,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2025-02-08 01:06:01,184 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2025-02-08 01:06:01,184 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 125 flow [2025-02-08 01:06:01,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-08 01:06:01,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:01,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:01,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:06:01,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash 611045852, now seen corresponding path program 1 times [2025-02-08 01:06:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:01,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332955174] [2025-02-08 01:06:01,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:01,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:06:01,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:06:01,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:01,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:01,530 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-08 01:06:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332955174] [2025-02-08 01:06:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332955174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:01,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:06:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331682321] [2025-02-08 01:06:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:01,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:06:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:01,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:06:01,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:06:01,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-02-08 01:06:01,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 30 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-08 01:06:01,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:01,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-02-08 01:06:01,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:01,775 INFO L124 PetriNetUnfolderBase]: 576/1016 cut-off events. [2025-02-08 01:06:01,776 INFO L125 PetriNetUnfolderBase]: For 1669/1669 co-relation queries the response was YES. [2025-02-08 01:06:01,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3152 conditions, 1016 events. 576/1016 cut-off events. For 1669/1669 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4744 event pairs, 240 based on Foata normal form. 33/1049 useless extension candidates. Maximal degree in co-relation 3133. Up to 813 conditions per place. [2025-02-08 01:06:01,784 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 33 selfloop transitions, 3 changer transitions 29/68 dead transitions. [2025-02-08 01:06:01,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 68 transitions, 404 flow [2025-02-08 01:06:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:06:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:06:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2025-02-08 01:06:01,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2025-02-08 01:06:01,787 INFO L175 Difference]: Start difference. First operand has 50 places, 30 transitions, 125 flow. Second operand 7 states and 92 transitions. [2025-02-08 01:06:01,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 68 transitions, 404 flow [2025-02-08 01:06:01,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 376 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-02-08 01:06:01,802 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 148 flow [2025-02-08 01:06:01,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2025-02-08 01:06:01,803 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2025-02-08 01:06:01,803 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 148 flow [2025-02-08 01:06:01,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-08 01:06:01,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:01,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:01,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:06:01,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash -734531558, now seen corresponding path program 1 times [2025-02-08 01:06:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:01,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007021220] [2025-02-08 01:06:01,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:01,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:06:01,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:06:01,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:01,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:02,103 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-08 01:06:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007021220] [2025-02-08 01:06:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007021220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:02,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:06:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314631517] [2025-02-08 01:06:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:02,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:06:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:02,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:06:02,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:06:02,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-02-08 01:06:02,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-08 01:06:02,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:02,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-02-08 01:06:02,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:02,446 INFO L124 PetriNetUnfolderBase]: 561/973 cut-off events. [2025-02-08 01:06:02,446 INFO L125 PetriNetUnfolderBase]: For 1689/1691 co-relation queries the response was YES. [2025-02-08 01:06:02,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 973 events. 561/973 cut-off events. For 1689/1691 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4513 event pairs, 48 based on Foata normal form. 29/1002 useless extension candidates. Maximal degree in co-relation 3268. Up to 741 conditions per place. [2025-02-08 01:06:02,453 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 9 changer transitions 32/93 dead transitions. [2025-02-08 01:06:02,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 93 transitions, 625 flow [2025-02-08 01:06:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:06:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:06:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2025-02-08 01:06:02,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2025-02-08 01:06:02,454 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 148 flow. Second operand 11 states and 137 transitions. [2025-02-08 01:06:02,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 93 transitions, 625 flow [2025-02-08 01:06:02,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 604 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-02-08 01:06:02,460 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 224 flow [2025-02-08 01:06:02,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=224, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2025-02-08 01:06:02,460 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2025-02-08 01:06:02,461 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 224 flow [2025-02-08 01:06:02,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-08 01:06:02,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:02,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:02,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:06:02,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:02,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash -97302068, now seen corresponding path program 2 times [2025-02-08 01:06:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22327988] [2025-02-08 01:06:02,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:06:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:02,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:06:02,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:06:02,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:06:02,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:02,847 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-08 01:06:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22327988] [2025-02-08 01:06:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22327988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:06:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571325108] [2025-02-08 01:06:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:02,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:06:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:02,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:06:02,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:06:02,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-02-08 01:06:02,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-08 01:06:02,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:02,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-02-08 01:06:02,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:03,497 INFO L124 PetriNetUnfolderBase]: 543/951 cut-off events. [2025-02-08 01:06:03,497 INFO L125 PetriNetUnfolderBase]: For 3168/3168 co-relation queries the response was YES. [2025-02-08 01:06:03,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3755 conditions, 951 events. 543/951 cut-off events. For 3168/3168 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4265 event pairs, 57 based on Foata normal form. 27/978 useless extension candidates. Maximal degree in co-relation 3727. Up to 632 conditions per place. [2025-02-08 01:06:03,503 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 50 selfloop transitions, 17 changer transitions 38/108 dead transitions. [2025-02-08 01:06:03,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 108 transitions, 824 flow [2025-02-08 01:06:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 01:06:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 01:06:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2025-02-08 01:06:03,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4022222222222222 [2025-02-08 01:06:03,509 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 224 flow. Second operand 15 states and 181 transitions. [2025-02-08 01:06:03,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 108 transitions, 824 flow [2025-02-08 01:06:03,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 756 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-02-08 01:06:03,517 INFO L231 Difference]: Finished difference. Result has 71 places, 39 transitions, 269 flow [2025-02-08 01:06:03,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=269, PETRI_PLACES=71, PETRI_TRANSITIONS=39} [2025-02-08 01:06:03,518 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 37 predicate places. [2025-02-08 01:06:03,518 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 39 transitions, 269 flow [2025-02-08 01:06:03,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-08 01:06:03,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:03,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:03,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:06:03,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:03,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:03,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1361219908, now seen corresponding path program 1 times [2025-02-08 01:06:03,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:03,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306119450] [2025-02-08 01:06:03,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:03,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:03,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:06:03,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:06:03,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:03,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:03,690 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-08 01:06:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:03,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306119450] [2025-02-08 01:06:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306119450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:06:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145481264] [2025-02-08 01:06:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:06:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:03,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:06:03,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:06:03,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-02-08 01:06:03,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 39 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-08 01:06:03,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:03,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-02-08 01:06:03,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:04,145 INFO L124 PetriNetUnfolderBase]: 759/1331 cut-off events. [2025-02-08 01:06:04,146 INFO L125 PetriNetUnfolderBase]: For 7261/7263 co-relation queries the response was YES. [2025-02-08 01:06:04,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 1331 events. 759/1331 cut-off events. For 7261/7263 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6583 event pairs, 189 based on Foata normal form. 44/1375 useless extension candidates. Maximal degree in co-relation 5719. Up to 591 conditions per place. [2025-02-08 01:06:04,155 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 45 selfloop transitions, 4 changer transitions 33/85 dead transitions. [2025-02-08 01:06:04,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 731 flow [2025-02-08 01:06:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:06:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:06:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2025-02-08 01:06:04,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 01:06:04,158 INFO L175 Difference]: Start difference. First operand has 71 places, 39 transitions, 269 flow. Second operand 7 states and 105 transitions. [2025-02-08 01:06:04,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 731 flow [2025-02-08 01:06:04,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 645 flow, removed 27 selfloop flow, removed 13 redundant places. [2025-02-08 01:06:04,170 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 237 flow [2025-02-08 01:06:04,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2025-02-08 01:06:04,171 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2025-02-08 01:06:04,172 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 237 flow [2025-02-08 01:06:04,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-08 01:06:04,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:04,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:06:04,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:04,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1589905570, now seen corresponding path program 1 times [2025-02-08 01:06:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292122399] [2025-02-08 01:06:04,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:04,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:06:04,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:06:04,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:04,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:04,308 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-08 01:06:04,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:04,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292122399] [2025-02-08 01:06:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292122399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:04,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:04,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:06:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536202116] [2025-02-08 01:06:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:06:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:04,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:06:04,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:06:04,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-02-08 01:06:04,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 237 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-08 01:06:04,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:04,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-02-08 01:06:04,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:04,490 INFO L124 PetriNetUnfolderBase]: 418/815 cut-off events. [2025-02-08 01:06:04,491 INFO L125 PetriNetUnfolderBase]: For 2055/2057 co-relation queries the response was YES. [2025-02-08 01:06:04,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 815 events. 418/815 cut-off events. For 2055/2057 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3877 event pairs, 79 based on Foata normal form. 59/874 useless extension candidates. Maximal degree in co-relation 2870. Up to 371 conditions per place. [2025-02-08 01:06:04,494 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 46 selfloop transitions, 5 changer transitions 6/61 dead transitions. [2025-02-08 01:06:04,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 474 flow [2025-02-08 01:06:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:06:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:06:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-08 01:06:04,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 01:06:04,495 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 237 flow. Second operand 4 states and 72 transitions. [2025-02-08 01:06:04,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 474 flow [2025-02-08 01:06:04,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 450 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 01:06:04,500 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 236 flow [2025-02-08 01:06:04,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2025-02-08 01:06:04,501 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2025-02-08 01:06:04,502 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 236 flow [2025-02-08 01:06:04,502 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-08 01:06:04,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:04,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:04,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:06:04,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:04,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 154037173, now seen corresponding path program 1 times [2025-02-08 01:06:04,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:04,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066024189] [2025-02-08 01:06:04,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:04,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:06:04,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:06:04,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:04,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:05,039 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-08 01:06:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:05,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066024189] [2025-02-08 01:06:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066024189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:05,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:06:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597289715] [2025-02-08 01:06:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:05,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:06:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:05,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:06:05,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:06:05,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-02-08 01:06:05,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 236 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:05,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:05,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-02-08 01:06:05,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:05,308 INFO L124 PetriNetUnfolderBase]: 414/788 cut-off events. [2025-02-08 01:06:05,308 INFO L125 PetriNetUnfolderBase]: For 1749/1751 co-relation queries the response was YES. [2025-02-08 01:06:05,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 788 events. 414/788 cut-off events. For 1749/1751 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3523 event pairs, 159 based on Foata normal form. 12/800 useless extension candidates. Maximal degree in co-relation 2879. Up to 617 conditions per place. [2025-02-08 01:06:05,312 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 37 selfloop transitions, 8 changer transitions 24/72 dead transitions. [2025-02-08 01:06:05,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 536 flow [2025-02-08 01:06:05,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:06:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:06:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-02-08 01:06:05,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2025-02-08 01:06:05,313 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 236 flow. Second operand 9 states and 106 transitions. [2025-02-08 01:06:05,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 536 flow [2025-02-08 01:06:05,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 509 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-02-08 01:06:05,316 INFO L231 Difference]: Finished difference. Result has 68 places, 39 transitions, 272 flow [2025-02-08 01:06:05,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=272, PETRI_PLACES=68, PETRI_TRANSITIONS=39} [2025-02-08 01:06:05,317 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2025-02-08 01:06:05,317 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 39 transitions, 272 flow [2025-02-08 01:06:05,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:05,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:05,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:06:05,318 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:05,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1885793185, now seen corresponding path program 2 times [2025-02-08 01:06:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147875908] [2025-02-08 01:06:05,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:06:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:05,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:06:05,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:06:05,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:06:05,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:05,963 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-08 01:06:05,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:05,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147875908] [2025-02-08 01:06:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147875908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:05,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:06:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687055374] [2025-02-08 01:06:05,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:05,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:06:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:05,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:06:05,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:06:05,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2025-02-08 01:06:05,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 39 transitions, 272 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:05,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:05,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2025-02-08 01:06:05,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:06,241 INFO L124 PetriNetUnfolderBase]: 374/728 cut-off events. [2025-02-08 01:06:06,241 INFO L125 PetriNetUnfolderBase]: For 2347/2349 co-relation queries the response was YES. [2025-02-08 01:06:06,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2858 conditions, 728 events. 374/728 cut-off events. For 2347/2349 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3230 event pairs, 177 based on Foata normal form. 12/740 useless extension candidates. Maximal degree in co-relation 2823. Up to 575 conditions per place. [2025-02-08 01:06:06,248 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 33 selfloop transitions, 9 changer transitions 26/71 dead transitions. [2025-02-08 01:06:06,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 591 flow [2025-02-08 01:06:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:06:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:06:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-02-08 01:06:06,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2025-02-08 01:06:06,252 INFO L175 Difference]: Start difference. First operand has 68 places, 39 transitions, 272 flow. Second operand 10 states and 112 transitions. [2025-02-08 01:06:06,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 591 flow [2025-02-08 01:06:06,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 570 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-02-08 01:06:06,263 INFO L231 Difference]: Finished difference. Result has 76 places, 38 transitions, 304 flow [2025-02-08 01:06:06,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=76, PETRI_TRANSITIONS=38} [2025-02-08 01:06:06,263 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2025-02-08 01:06:06,263 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 38 transitions, 304 flow [2025-02-08 01:06:06,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:06:06,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:06,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:06,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:06:06,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:06,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1793047133, now seen corresponding path program 3 times [2025-02-08 01:06:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:06,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257714154] [2025-02-08 01:06:06,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:06:06,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:06,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:06:06,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:06:06,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:06:06,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:06:06,453 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-08 01:06:06,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:06:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257714154] [2025-02-08 01:06:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257714154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:06:06,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:06:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:06:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501366051] [2025-02-08 01:06:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:06:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:06:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:06:06,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:06:06,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:06:06,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2025-02-08 01:06:06,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 38 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-08 01:06:06,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:06:06,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2025-02-08 01:06:06,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:06:06,545 INFO L124 PetriNetUnfolderBase]: 190/382 cut-off events. [2025-02-08 01:06:06,545 INFO L125 PetriNetUnfolderBase]: For 1421/1423 co-relation queries the response was YES. [2025-02-08 01:06:06,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 382 events. 190/382 cut-off events. For 1421/1423 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1445 event pairs, 44 based on Foata normal form. 32/414 useless extension candidates. Maximal degree in co-relation 1445. Up to 156 conditions per place. [2025-02-08 01:06:06,547 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 30 selfloop transitions, 6 changer transitions 11/51 dead transitions. [2025-02-08 01:06:06,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 51 transitions, 477 flow [2025-02-08 01:06:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:06:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:06:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-02-08 01:06:06,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-02-08 01:06:06,548 INFO L175 Difference]: Start difference. First operand has 76 places, 38 transitions, 304 flow. Second operand 5 states and 71 transitions. [2025-02-08 01:06:06,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 51 transitions, 477 flow [2025-02-08 01:06:06,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 352 flow, removed 47 selfloop flow, removed 21 redundant places. [2025-02-08 01:06:06,551 INFO L231 Difference]: Finished difference. Result has 56 places, 30 transitions, 163 flow [2025-02-08 01:06:06,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=56, PETRI_TRANSITIONS=30} [2025-02-08 01:06:06,552 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2025-02-08 01:06:06,552 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 30 transitions, 163 flow [2025-02-08 01:06:06,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-08 01:06:06,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:06:06,552 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-08 01:06:06,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:06:06,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:06:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:06:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1782513765, now seen corresponding path program 1 times [2025-02-08 01:06:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:06:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182580395] [2025-02-08 01:06:06,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:06:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:06:06,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:06:06,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:06:06,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:06,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:06:06,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 01:06:06,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:06:06,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:06:06,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:06:06,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:06:06,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 01:06:06,643 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 01:06:06,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-02-08 01:06:06,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 01:06:06,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-08 01:06:06,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-08 01:06:06,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-08 01:06:06,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:06:06,646 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 01:06:06,675 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:06:06,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:06:06,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:06:06 BasicIcfg [2025-02-08 01:06:06,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:06:06,680 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:06:06,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:06:06,680 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:06:06,681 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:05:58" (3/4) ... [2025-02-08 01:06:06,681 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 01:06:06,727 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-08 01:06:06,761 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:06:06,761 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:06:06,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:06:06,762 INFO L158 Benchmark]: Toolchain (without parser) took 8824.10ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.5MB in the beginning and 289.6MB in the end (delta: -176.1MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2025-02-08 01:06:06,762 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 124.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:06:06,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.03ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 91.2MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 01:06:06,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.04ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:06:06,763 INFO L158 Benchmark]: Boogie Preprocessor took 39.46ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:06:06,763 INFO L158 Benchmark]: IcfgBuilder took 646.49ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 106.7MB in the end (delta: -20.7MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-02-08 01:06:06,763 INFO L158 Benchmark]: TraceAbstraction took 7695.76ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 106.7MB in the beginning and 302.2MB in the end (delta: -195.5MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2025-02-08 01:06:06,764 INFO L158 Benchmark]: Witness Printer took 81.72ms. Allocated memory is still 427.8MB. Free memory was 302.2MB in the beginning and 289.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 01:06:06,765 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.54ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 124.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.03ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 91.2MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.04ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.46ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 646.49ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 106.7MB in the end (delta: -20.7MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7695.76ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 106.7MB in the beginning and 302.2MB in the end (delta: -195.5MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. * Witness Printer took 81.72ms. Allocated memory is still 427.8MB. Free memory was 302.2MB in the beginning and 289.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 5 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.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1571 IncrementalHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 0 mSDtfsCounter, 1571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=9, InterpolantAutomatonStates: 83, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 1262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-08 01:06:06,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE