./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:52:25,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:52:25,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:52:25,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:52:25,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:52:25,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:52:25,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:52:25,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:52:25,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:52:25,264 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:52:25,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:52:25,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:52:25,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:52:25,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:52:25,265 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:52:25,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:52:25,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:52:25,266 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:52:25,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:52:25,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:52:25,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:52:25,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:52:25,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:52:25,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:52:25,267 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:52:25,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:52:25,267 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:52:25,267 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:52:25,267 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:52:25,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:52:25,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:52:25,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:52:25,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:52:25,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:52:25,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:52:25,268 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:52:25,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:52:25,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:52:25,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:52:25,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:52:25,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:52:25,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:52:25,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:52:25,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 [2025-03-14 00:52:25,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:52:25,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:52:25,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:52:25,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:52:25,528 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:52:25,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-03-14 00:52:26,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecfe1673/772c066f2c8d442b96aecfe4eac03bdc/FLAGcadc8793b [2025-03-14 00:52:26,941 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:52:26,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-03-14 00:52:26,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecfe1673/772c066f2c8d442b96aecfe4eac03bdc/FLAGcadc8793b [2025-03-14 00:52:27,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecfe1673/772c066f2c8d442b96aecfe4eac03bdc [2025-03-14 00:52:27,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:52:27,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:52:27,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:52:27,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:52:27,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:52:27,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f13cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27, skipping insertion in model container [2025-03-14 00:52:27,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:52:27,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2025-03-14 00:52:27,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:52:27,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:52:27,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2025-03-14 00:52:27,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:52:27,605 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:52:27,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27 WrapperNode [2025-03-14 00:52:27,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:52:27,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:52:27,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:52:27,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:52:27,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,636 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2025-03-14 00:52:27,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:52:27,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:52:27,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:52:27,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:52:27,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,658 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-03-14 00:52:27,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,670 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:52:27,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:52:27,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:52:27,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:52:27,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (1/1) ... [2025-03-14 00:52:27,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:52:27,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:52:27,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:52:27,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:52:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:52:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:52:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-14 00:52:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-14 00:52:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-14 00:52:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-14 00:52:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-14 00:52:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-14 00:52:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:52:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:52:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:52:27,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:52:27,737 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:52:27,842 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:52:27,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:52:28,140 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:52:28,141 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:52:28,141 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:52:28,366 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:52:28,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:52:28 BoogieIcfgContainer [2025-03-14 00:52:28,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:52:28,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:52:28,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:52:28,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:52:28,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:52:27" (1/3) ... [2025-03-14 00:52:28,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d33d8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:52:28, skipping insertion in model container [2025-03-14 00:52:28,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:52:27" (2/3) ... [2025-03-14 00:52:28,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d33d8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:52:28, skipping insertion in model container [2025-03-14 00:52:28,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:52:28" (3/3) ... [2025-03-14 00:52:28,373 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-03-14 00:52:28,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:52:28,384 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-14 00:52:28,384 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:52:28,431 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 00:52:28,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-03-14 00:52:28,468 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-03-14 00:52:28,469 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:52:28,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-14 00:52:28,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-03-14 00:52:28,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2025-03-14 00:52:28,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:52:28,485 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;@4718dc12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:52:28,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:52:28,489 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:52:28,489 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-14 00:52:28,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:52:28,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:28,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-14 00:52:28,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:28,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1458346952, now seen corresponding path program 1 times [2025-03-14 00:52:28,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:28,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430466379] [2025-03-14 00:52:28,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:52:28,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:28,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-14 00:52:28,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-14 00:52:28,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:52:28,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:52:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:52:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:52:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430466379] [2025-03-14 00:52:28,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430466379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:52:28,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:52:28,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 00:52:28,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984105502] [2025-03-14 00:52:28,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:52:28,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:52:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:52:28,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:52:28,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:52:28,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:52:28,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:28,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:52:28,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:52:28,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:52:29,584 INFO L124 PetriNetUnfolderBase]: 4127/6000 cut-off events. [2025-03-14 00:52:29,585 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-14 00:52:29,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12007 conditions, 6000 events. 4127/6000 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 32087 event pairs, 383 based on Foata normal form. 210/6176 useless extension candidates. Maximal degree in co-relation 11996. Up to 5257 conditions per place. [2025-03-14 00:52:29,628 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 42 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-03-14 00:52:29,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 208 flow [2025-03-14 00:52:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:52:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:52:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-14 00:52:29,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6495726495726496 [2025-03-14 00:52:29,642 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 76 transitions. [2025-03-14 00:52:29,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 208 flow [2025-03-14 00:52:29,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:52:29,648 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2025-03-14 00:52:29,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-03-14 00:52:29,655 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-03-14 00:52:29,656 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2025-03-14 00:52:29,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:29,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:29,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:52:29,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:29,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2128067280, now seen corresponding path program 1 times [2025-03-14 00:52:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123120190] [2025-03-14 00:52:29,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:52:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:29,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:52:29,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:52:29,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:52:29,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:52:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:52:29,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:52:29,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123120190] [2025-03-14 00:52:29,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123120190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:52:29,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:52:29,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:52:29,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711792324] [2025-03-14 00:52:29,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:52:29,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:52:29,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:52:29,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:52:29,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:52:29,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:52:29,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:29,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:52:29,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:52:29,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:52:30,332 INFO L124 PetriNetUnfolderBase]: 3077/5013 cut-off events. [2025-03-14 00:52:30,333 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2025-03-14 00:52:30,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9861 conditions, 5013 events. 3077/5013 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 29762 event pairs, 520 based on Foata normal form. 210/5068 useless extension candidates. Maximal degree in co-relation 9851. Up to 2466 conditions per place. [2025-03-14 00:52:30,355 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 54 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2025-03-14 00:52:30,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 270 flow [2025-03-14 00:52:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:52:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:52:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-14 00:52:30,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-03-14 00:52:30,358 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 98 transitions. [2025-03-14 00:52:30,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 270 flow [2025-03-14 00:52:30,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:52:30,361 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2025-03-14 00:52:30,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-14 00:52:30,361 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2025-03-14 00:52:30,361 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2025-03-14 00:52:30,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:30,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:30,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:30,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:52:30,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash 917107760, now seen corresponding path program 1 times [2025-03-14 00:52:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979012099] [2025-03-14 00:52:30,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:52:30,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:30,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:52:30,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:52:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:52:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:52:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:52:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:52:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979012099] [2025-03-14 00:52:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979012099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:52:30,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:52:30,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:52:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808624382] [2025-03-14 00:52:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:52:30,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:52:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:52:30,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:52:30,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:52:30,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:52:30,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:30,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:52:30,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:52:30,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:52:30,951 INFO L124 PetriNetUnfolderBase]: 1816/2940 cut-off events. [2025-03-14 00:52:30,951 INFO L125 PetriNetUnfolderBase]: For 575/575 co-relation queries the response was YES. [2025-03-14 00:52:30,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6695 conditions, 2940 events. 1816/2940 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 14972 event pairs, 334 based on Foata normal form. 150/3029 useless extension candidates. Maximal degree in co-relation 6683. Up to 951 conditions per place. [2025-03-14 00:52:30,964 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 69 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2025-03-14 00:52:30,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 379 flow [2025-03-14 00:52:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:52:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:52:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-14 00:52:30,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-03-14 00:52:30,968 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 125 transitions. [2025-03-14 00:52:30,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 379 flow [2025-03-14 00:52:30,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 369 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 00:52:30,971 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2025-03-14 00:52:30,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-03-14 00:52:30,971 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2025-03-14 00:52:30,972 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2025-03-14 00:52:30,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:30,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:30,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:30,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:52:30,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1268951599, now seen corresponding path program 1 times [2025-03-14 00:52:30,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:30,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171169349] [2025-03-14 00:52:30,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:52:30,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 00:52:31,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 00:52:31,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:52:31,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:52:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:52:31,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:52:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171169349] [2025-03-14 00:52:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171169349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:52:31,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:52:31,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:52:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093987123] [2025-03-14 00:52:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:52:31,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:52:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:52:31,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:52:31,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:52:31,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-14 00:52:31,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:31,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:52:31,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-14 00:52:31,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:52:31,480 INFO L124 PetriNetUnfolderBase]: 1149/1795 cut-off events. [2025-03-14 00:52:31,481 INFO L125 PetriNetUnfolderBase]: For 1102/1102 co-relation queries the response was YES. [2025-03-14 00:52:31,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 1795 events. 1149/1795 cut-off events. For 1102/1102 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7887 event pairs, 299 based on Foata normal form. 56/1838 useless extension candidates. Maximal degree in co-relation 4511. Up to 670 conditions per place. [2025-03-14 00:52:31,492 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2025-03-14 00:52:31,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 370 flow [2025-03-14 00:52:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:52:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:52:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-14 00:52:31,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-14 00:52:31,495 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 126 transitions. [2025-03-14 00:52:31,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 370 flow [2025-03-14 00:52:31,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 345 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-14 00:52:31,506 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2025-03-14 00:52:31,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-03-14 00:52:31,507 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2025-03-14 00:52:31,508 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2025-03-14 00:52:31,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:31,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:31,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:52:31,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:31,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1795308873, now seen corresponding path program 1 times [2025-03-14 00:52:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199694456] [2025-03-14 00:52:31,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:52:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:31,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:52:31,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:52:31,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:52:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:52:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:52:31,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:52:31,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199694456] [2025-03-14 00:52:31,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199694456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:52:31,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:52:31,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:52:31,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400980125] [2025-03-14 00:52:31,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:52:31,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 00:52:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:52:31,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 00:52:31,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 00:52:31,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-14 00:52:31,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:31,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:52:31,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-14 00:52:31,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:52:32,278 INFO L124 PetriNetUnfolderBase]: 1473/2303 cut-off events. [2025-03-14 00:52:32,278 INFO L125 PetriNetUnfolderBase]: For 1698/1698 co-relation queries the response was YES. [2025-03-14 00:52:32,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5934 conditions, 2303 events. 1473/2303 cut-off events. For 1698/1698 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10479 event pairs, 301 based on Foata normal form. 8/2306 useless extension candidates. Maximal degree in co-relation 5919. Up to 1144 conditions per place. [2025-03-14 00:52:32,286 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 44 selfloop transitions, 1 changer transitions 32/82 dead transitions. [2025-03-14 00:52:32,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 496 flow [2025-03-14 00:52:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:52:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:52:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-03-14 00:52:32,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2025-03-14 00:52:32,288 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 6 states and 112 transitions. [2025-03-14 00:52:32,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 496 flow [2025-03-14 00:52:32,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 371 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-14 00:52:32,294 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 115 flow [2025-03-14 00:52:32,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-03-14 00:52:32,295 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2025-03-14 00:52:32,295 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 115 flow [2025-03-14 00:52:32,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:32,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:32,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:32,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:52:32,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:32,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1492708803, now seen corresponding path program 2 times [2025-03-14 00:52:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:32,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156754118] [2025-03-14 00:52:32,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:52:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:32,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:52:32,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:52:32,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:52:32,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:52:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:52:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:52:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156754118] [2025-03-14 00:52:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156754118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:52:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:52:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 00:52:33,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759967647] [2025-03-14 00:52:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:52:33,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 00:52:33,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:52:33,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 00:52:33,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 00:52:33,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-14 00:52:33,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 115 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:33,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:52:33,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-14 00:52:33,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:52:33,632 INFO L124 PetriNetUnfolderBase]: 1802/2840 cut-off events. [2025-03-14 00:52:33,632 INFO L125 PetriNetUnfolderBase]: For 616/616 co-relation queries the response was YES. [2025-03-14 00:52:33,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 2840 events. 1802/2840 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13883 event pairs, 485 based on Foata normal form. 8/2845 useless extension candidates. Maximal degree in co-relation 6481. Up to 1416 conditions per place. [2025-03-14 00:52:33,645 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 49 selfloop transitions, 4 changer transitions 47/105 dead transitions. [2025-03-14 00:52:33,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 493 flow [2025-03-14 00:52:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 00:52:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 00:52:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2025-03-14 00:52:33,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4586894586894587 [2025-03-14 00:52:33,646 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 115 flow. Second operand 9 states and 161 transitions. [2025-03-14 00:52:33,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 493 flow [2025-03-14 00:52:33,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 105 transitions, 479 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 00:52:33,648 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 140 flow [2025-03-14 00:52:33,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=9, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2025-03-14 00:52:33,649 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2025-03-14 00:52:33,649 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 140 flow [2025-03-14 00:52:33,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:33,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:33,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:33,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:52:33,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:33,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash -973587103, now seen corresponding path program 3 times [2025-03-14 00:52:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186420332] [2025-03-14 00:52:33,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:52:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:33,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:52:33,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:52:33,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:52:33,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:52:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:52:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:52:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186420332] [2025-03-14 00:52:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186420332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:52:35,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:52:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 00:52:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036124871] [2025-03-14 00:52:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:52:35,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 00:52:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:52:35,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 00:52:35,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 00:52:35,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-14 00:52:35,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:35,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:52:35,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-14 00:52:35,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:52:35,794 INFO L124 PetriNetUnfolderBase]: 1009/1639 cut-off events. [2025-03-14 00:52:35,795 INFO L125 PetriNetUnfolderBase]: For 1048/1048 co-relation queries the response was YES. [2025-03-14 00:52:35,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4396 conditions, 1639 events. 1009/1639 cut-off events. For 1048/1048 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7342 event pairs, 236 based on Foata normal form. 8/1646 useless extension candidates. Maximal degree in co-relation 4377. Up to 785 conditions per place. [2025-03-14 00:52:35,802 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 44 selfloop transitions, 4 changer transitions 46/99 dead transitions. [2025-03-14 00:52:35,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 530 flow [2025-03-14 00:52:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:52:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:52:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2025-03-14 00:52:35,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4128205128205128 [2025-03-14 00:52:35,803 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 140 flow. Second operand 10 states and 161 transitions. [2025-03-14 00:52:35,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 530 flow [2025-03-14 00:52:35,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 502 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-03-14 00:52:35,805 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 144 flow [2025-03-14 00:52:35,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, 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=10, PETRI_FLOW=144, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2025-03-14 00:52:35,807 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2025-03-14 00:52:35,808 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 144 flow [2025-03-14 00:52:35,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:35,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:35,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:35,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:52:35,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:35,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1237320153, now seen corresponding path program 4 times [2025-03-14 00:52:35,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:35,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355061689] [2025-03-14 00:52:35,809 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:52:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:35,818 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-14 00:52:35,829 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:52:35,830 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:52:35,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:52:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:52:36,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:52:36,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355061689] [2025-03-14 00:52:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355061689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:52:36,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:52:36,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 00:52:36,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344190957] [2025-03-14 00:52:36,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:52:36,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:52:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:52:36,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:52:36,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:52:36,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-14 00:52:36,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 144 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:36,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:52:36,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-14 00:52:36,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:52:36,211 INFO L124 PetriNetUnfolderBase]: 907/1498 cut-off events. [2025-03-14 00:52:36,212 INFO L125 PetriNetUnfolderBase]: For 711/711 co-relation queries the response was YES. [2025-03-14 00:52:36,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 1498 events. 907/1498 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6325 event pairs, 239 based on Foata normal form. 8/1505 useless extension candidates. Maximal degree in co-relation 3882. Up to 589 conditions per place. [2025-03-14 00:52:36,217 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 36 selfloop transitions, 3 changer transitions 39/82 dead transitions. [2025-03-14 00:52:36,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 82 transitions, 440 flow [2025-03-14 00:52:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:52:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:52:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2025-03-14 00:52:36,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4175824175824176 [2025-03-14 00:52:36,218 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 144 flow. Second operand 7 states and 114 transitions. [2025-03-14 00:52:36,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 82 transitions, 440 flow [2025-03-14 00:52:36,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 414 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-14 00:52:36,220 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 140 flow [2025-03-14 00:52:36,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2025-03-14 00:52:36,220 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2025-03-14 00:52:36,221 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 140 flow [2025-03-14 00:52:36,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:52:36,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:52:36,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:52:36,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:52:36,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:52:36,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:52:36,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1329685651, now seen corresponding path program 5 times [2025-03-14 00:52:36,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:52:36,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067593764] [2025-03-14 00:52:36,223 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:52:36,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:52:36,232 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:52:36,292 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:52:36,292 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:52:36,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:52:36,292 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:52:36,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:52:36,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:52:36,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:52:36,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:52:36,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:52:36,361 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:52:36,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-14 00:52:36,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 00:52:36,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-14 00:52:36,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-14 00:52:36,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-14 00:52:36,363 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 00:52:36,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:52:36,364 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2025-03-14 00:52:36,414 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:52:36,414 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:52:36,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:52:36 BasicIcfg [2025-03-14 00:52:36,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:52:36,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:52:36,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:52:36,422 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:52:36,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:52:28" (3/4) ... [2025-03-14 00:52:36,423 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 00:52:36,503 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-14 00:52:36,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:52:36,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:52:36,540 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:52:36,542 INFO L158 Benchmark]: Toolchain (without parser) took 9296.65ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 109.5MB in the beginning and 320.6MB in the end (delta: -211.2MB). Peak memory consumption was 218.0MB. Max. memory is 16.1GB. [2025-03-14 00:52:36,542 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:52:36,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.84ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 84.9MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 00:52:36,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.35ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:52:36,542 INFO L158 Benchmark]: Boogie Preprocessor took 47.58ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 79.4MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:52:36,543 INFO L158 Benchmark]: IcfgBuilder took 682.42ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 68.5MB in the end (delta: 10.9MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-14 00:52:36,543 INFO L158 Benchmark]: TraceAbstraction took 8052.54ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 67.8MB in the beginning and 337.4MB in the end (delta: -269.6MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. [2025-03-14 00:52:36,543 INFO L158 Benchmark]: Witness Printer took 118.99ms. Allocated memory is still 570.4MB. Free memory was 337.4MB in the beginning and 320.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:52:36,544 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.26ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.84ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 84.9MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.35ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.58ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 79.4MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 682.42ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 68.5MB in the end (delta: 10.9MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8052.54ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 67.8MB in the beginning and 337.4MB in the end (delta: -269.6MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. * Witness Printer took 118.99ms. Allocated memory is still 570.4MB. Free memory was 337.4MB in the beginning and 320.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1740=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1740=-2, t1741=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1740=-2, t1741=-1, t1742=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L802] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L819] 3 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740=-2, t1741=-1, t1742=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740=-2, t1741=-1, t1742=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740=-2, t1741=-1, t1742=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: 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: 845]: 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: 849]: 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: 847]: 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 7 procedures, 64 locations, 6 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.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1362 IncrementalHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 4 mSDtfsCounter, 1362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=4, InterpolantAutomatonStates: 50, 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.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 1242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-03-14 00:52:36,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE