./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:09:35,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:09:35,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:09:35,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:09:35,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:09:35,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:09:35,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:09:35,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:09:35,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:09:35,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:09:35,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:09:35,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:09:35,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:09:35,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:09:35,680 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:09:35,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:09:35,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:09:35,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:09:35,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:09:35,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:09:35,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:09:35,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:09:35,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:09:35,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:09:35,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:09:35,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:09:35,683 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2025-03-04 02:09:35,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:09:35,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:09:35,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:09:35,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:09:35,936 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:09:35,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2025-03-04 02:09:37,121 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa6f4184/9a6f4f8c38b34727b34fceb87b799f02/FLAGf6757feb1 [2025-03-04 02:09:37,398 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:09:37,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2025-03-04 02:09:37,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa6f4184/9a6f4f8c38b34727b34fceb87b799f02/FLAGf6757feb1 [2025-03-04 02:09:37,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa6f4184/9a6f4f8c38b34727b34fceb87b799f02 [2025-03-04 02:09:37,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:09:37,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:09:37,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:09:37,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:09:37,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:09:37,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245b14de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37, skipping insertion in model container [2025-03-04 02:09:37,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:09:37,599 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2025-03-04 02:09:37,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:09:37,791 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:09:37,798 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2025-03-04 02:09:37,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:09:37,864 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:09:37,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37 WrapperNode [2025-03-04 02:09:37,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:09:37,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:09:37,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:09:37,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:09:37,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,913 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2025-03-04 02:09:37,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:09:37,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:09:37,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:09:37,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:09:37,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,945 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-04 02:09:37,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:09:37,959 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:09:37,959 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:09:37,959 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:09:37,960 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (1/1) ... [2025-03-04 02:09:37,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:09:37,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:09:37,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:09:37,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:09:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:09:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:09:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 02:09:38,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 02:09:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 02:09:38,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 02:09:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 02:09:38,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 02:09:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:09:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:09:38,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:09:38,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:09:38,015 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:09:38,130 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:09:38,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:09:38,420 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:09:38,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:09:38,588 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:09:38,588 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:09:38,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:09:38 BoogieIcfgContainer [2025-03-04 02:09:38,588 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:09:38,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:09:38,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:09:38,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:09:38,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:09:37" (1/3) ... [2025-03-04 02:09:38,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15376434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:09:38, skipping insertion in model container [2025-03-04 02:09:38,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:09:37" (2/3) ... [2025-03-04 02:09:38,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15376434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:09:38, skipping insertion in model container [2025-03-04 02:09:38,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:09:38" (3/3) ... [2025-03-04 02:09:38,597 INFO L128 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2025-03-04 02:09:38,608 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:09:38,611 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe004_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 02:09:38,612 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:09:38,678 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:09:38,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-03-04 02:09:38,734 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-03-04 02:09:38,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:09:38,741 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 4. Compared 67 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-04 02:09:38,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-03-04 02:09:38,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2025-03-04 02:09:38,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:09:38,762 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;@4bd566d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:09:38,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:09:38,768 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:09:38,768 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 02:09:38,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:09:38,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:38,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:09:38,769 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-04 02:09:38,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1830633885, now seen corresponding path program 1 times [2025-03-04 02:09:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:38,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455901147] [2025-03-04 02:09:38,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:38,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:38,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:09:38,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:09:38,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:38,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:39,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:39,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455901147] [2025-03-04 02:09:39,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455901147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:39,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:39,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 02:09:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900232192] [2025-03-04 02:09:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:39,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:09:39,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:39,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:09:39,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:09:39,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-04 02:09:39,148 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-04 02:09:39,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:39,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-04 02:09:39,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:39,882 INFO L124 PetriNetUnfolderBase]: 4235/6144 cut-off events. [2025-03-04 02:09:39,883 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-04 02:09:39,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12283 conditions, 6144 events. 4235/6144 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 33562 event pairs, 465 based on Foata normal form. 210/6313 useless extension candidates. Maximal degree in co-relation 12272. Up to 5271 conditions per place. [2025-03-04 02:09:39,923 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 43 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2025-03-04 02:09:39,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 212 flow [2025-03-04 02:09:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:09:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:09:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 02:09:39,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6581196581196581 [2025-03-04 02:09:39,937 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 77 transitions. [2025-03-04 02:09:39,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 212 flow [2025-03-04 02:09:39,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:09:39,942 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2025-03-04 02:09:39,944 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-04 02:09:39,946 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-03-04 02:09:39,947 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2025-03-04 02:09:39,947 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-04 02:09:39,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:39,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:39,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:09:39,948 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-04 02:09:39,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash -792226052, now seen corresponding path program 1 times [2025-03-04 02:09:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007290372] [2025-03-04 02:09:39,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:39,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:39,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:09:39,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:09:40,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007290372] [2025-03-04 02:09:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007290372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:09:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223672438] [2025-03-04 02:09:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:40,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:40,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:40,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:40,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-04 02:09:40,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:40,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:40,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-04 02:09:40,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:42,079 INFO L124 PetriNetUnfolderBase]: 8129/11783 cut-off events. [2025-03-04 02:09:42,079 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2025-03-04 02:09:42,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23993 conditions, 11783 events. 8129/11783 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 65636 event pairs, 611 based on Foata normal form. 0/11531 useless extension candidates. Maximal degree in co-relation 23983. Up to 5135 conditions per place. [2025-03-04 02:09:42,123 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 52 selfloop transitions, 10 changer transitions 116/182 dead transitions. [2025-03-04 02:09:42,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 182 transitions, 750 flow [2025-03-04 02:09:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:09:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:09:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 265 transitions. [2025-03-04 02:09:42,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5662393162393162 [2025-03-04 02:09:42,128 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 12 states and 265 transitions. [2025-03-04 02:09:42,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 182 transitions, 750 flow [2025-03-04 02:09:42,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 182 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:09:42,134 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 200 flow [2025-03-04 02:09:42,135 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=200, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2025-03-04 02:09:42,135 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2025-03-04 02:09:42,135 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 200 flow [2025-03-04 02:09:42,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:42,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:42,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:42,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:09:42,136 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-04 02:09:42,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:42,137 INFO L85 PathProgramCache]: Analyzing trace with hash 415940379, now seen corresponding path program 1 times [2025-03-04 02:09:42,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:42,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118446410] [2025-03-04 02:09:42,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:42,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:09:42,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:09:42,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:42,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118446410] [2025-03-04 02:09:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118446410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:09:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333919035] [2025-03-04 02:09:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:42,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-04 02:09:42,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:42,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:42,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-04 02:09:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:43,809 INFO L124 PetriNetUnfolderBase]: 8926/13006 cut-off events. [2025-03-04 02:09:43,810 INFO L125 PetriNetUnfolderBase]: For 26572/26572 co-relation queries the response was YES. [2025-03-04 02:09:43,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44935 conditions, 13006 events. 8926/13006 cut-off events. For 26572/26572 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 74671 event pairs, 1165 based on Foata normal form. 240/13243 useless extension candidates. Maximal degree in co-relation 44914. Up to 6541 conditions per place. [2025-03-04 02:09:43,878 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 57 selfloop transitions, 4 changer transitions 91/156 dead transitions. [2025-03-04 02:09:43,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 156 transitions, 1192 flow [2025-03-04 02:09:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:09:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:09:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2025-03-04 02:09:43,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2025-03-04 02:09:43,881 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 200 flow. Second operand 8 states and 166 transitions. [2025-03-04 02:09:43,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 156 transitions, 1192 flow [2025-03-04 02:09:43,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 156 transitions, 1099 flow, removed 45 selfloop flow, removed 5 redundant places. [2025-03-04 02:09:43,945 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 246 flow [2025-03-04 02:09:43,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=246, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2025-03-04 02:09:43,946 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2025-03-04 02:09:43,946 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 246 flow [2025-03-04 02:09:43,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:43,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:43,946 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-04 02:09:43,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:09:43,946 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-04 02:09:43,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1631882982, now seen corresponding path program 1 times [2025-03-04 02:09:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:43,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047613004] [2025-03-04 02:09:43,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:43,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:09:43,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:09:43,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:43,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047613004] [2025-03-04 02:09:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047613004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:09:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702882798] [2025-03-04 02:09:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:44,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:09:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:44,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:09:44,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:09:44,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-04 02:09:44,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:44,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:44,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-04 02:09:44,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:45,915 INFO L124 PetriNetUnfolderBase]: 11191/16344 cut-off events. [2025-03-04 02:09:45,915 INFO L125 PetriNetUnfolderBase]: For 30857/30857 co-relation queries the response was YES. [2025-03-04 02:09:45,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54981 conditions, 16344 events. 11191/16344 cut-off events. For 30857/30857 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 95867 event pairs, 1048 based on Foata normal form. 320/16657 useless extension candidates. Maximal degree in co-relation 54957. Up to 5139 conditions per place. [2025-03-04 02:09:45,984 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 69 selfloop transitions, 22 changer transitions 116/211 dead transitions. [2025-03-04 02:09:45,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 211 transitions, 1514 flow [2025-03-04 02:09:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:09:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:09:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 250 transitions. [2025-03-04 02:09:45,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5827505827505828 [2025-03-04 02:09:45,986 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 246 flow. Second operand 11 states and 250 transitions. [2025-03-04 02:09:45,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 211 transitions, 1514 flow [2025-03-04 02:09:46,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 211 transitions, 1456 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-03-04 02:09:46,050 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 391 flow [2025-03-04 02:09:46,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=391, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-03-04 02:09:46,051 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2025-03-04 02:09:46,051 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 391 flow [2025-03-04 02:09:46,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:46,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:46,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:46,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:09:46,052 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-04 02:09:46,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1721105983, now seen corresponding path program 1 times [2025-03-04 02:09:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:46,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201953973] [2025-03-04 02:09:46,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:46,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:46,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:09:46,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:09:46,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:46,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201953973] [2025-03-04 02:09:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201953973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:46,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:09:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428460045] [2025-03-04 02:09:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:46,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:46,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:46,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:46,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-04 02:09:46,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:46,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:46,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-04 02:09:46,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:47,736 INFO L124 PetriNetUnfolderBase]: 5786/8592 cut-off events. [2025-03-04 02:09:47,737 INFO L125 PetriNetUnfolderBase]: For 29893/29893 co-relation queries the response was YES. [2025-03-04 02:09:47,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32869 conditions, 8592 events. 5786/8592 cut-off events. For 29893/29893 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 46524 event pairs, 736 based on Foata normal form. 264/8855 useless extension candidates. Maximal degree in co-relation 32838. Up to 3279 conditions per place. [2025-03-04 02:09:47,782 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 56 selfloop transitions, 11 changer transitions 85/156 dead transitions. [2025-03-04 02:09:47,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 156 transitions, 1271 flow [2025-03-04 02:09:47,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:09:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:09:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2025-03-04 02:09:47,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-03-04 02:09:47,783 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 391 flow. Second operand 10 states and 205 transitions. [2025-03-04 02:09:47,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 156 transitions, 1271 flow [2025-03-04 02:09:47,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 156 transitions, 1187 flow, removed 42 selfloop flow, removed 6 redundant places. [2025-03-04 02:09:47,860 INFO L231 Difference]: Finished difference. Result has 77 places, 47 transitions, 354 flow [2025-03-04 02:09:47,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=354, PETRI_PLACES=77, PETRI_TRANSITIONS=47} [2025-03-04 02:09:47,861 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2025-03-04 02:09:47,861 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 47 transitions, 354 flow [2025-03-04 02:09:47,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:47,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:47,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:47,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:09:47,862 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-04 02:09:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1095001432, now seen corresponding path program 1 times [2025-03-04 02:09:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492782443] [2025-03-04 02:09:47,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:47,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:09:47,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:09:47,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:47,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:48,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:48,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492782443] [2025-03-04 02:09:48,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492782443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:48,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:48,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:09:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199245573] [2025-03-04 02:09:48,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:48,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:48,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:48,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:48,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:48,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-04 02:09:48,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 47 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:48,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:48,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-04 02:09:48,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:48,856 INFO L124 PetriNetUnfolderBase]: 2853/4301 cut-off events. [2025-03-04 02:09:48,856 INFO L125 PetriNetUnfolderBase]: For 16862/16867 co-relation queries the response was YES. [2025-03-04 02:09:48,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16734 conditions, 4301 events. 2853/4301 cut-off events. For 16862/16867 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20394 event pairs, 475 based on Foata normal form. 119/4420 useless extension candidates. Maximal degree in co-relation 16699. Up to 2495 conditions per place. [2025-03-04 02:09:48,874 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 54 selfloop transitions, 12 changer transitions 56/126 dead transitions. [2025-03-04 02:09:48,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 126 transitions, 1016 flow [2025-03-04 02:09:48,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:09:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:09:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2025-03-04 02:09:48,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 02:09:48,876 INFO L175 Difference]: Start difference. First operand has 77 places, 47 transitions, 354 flow. Second operand 10 states and 182 transitions. [2025-03-04 02:09:48,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 126 transitions, 1016 flow [2025-03-04 02:09:48,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 126 transitions, 929 flow, removed 32 selfloop flow, removed 12 redundant places. [2025-03-04 02:09:48,901 INFO L231 Difference]: Finished difference. Result has 76 places, 50 transitions, 398 flow [2025-03-04 02:09:48,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=398, PETRI_PLACES=76, PETRI_TRANSITIONS=50} [2025-03-04 02:09:48,903 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2025-03-04 02:09:48,904 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 50 transitions, 398 flow [2025-03-04 02:09:48,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:48,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:48,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:48,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:09:48,904 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-04 02:09:48,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash -203682494, now seen corresponding path program 1 times [2025-03-04 02:09:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229542303] [2025-03-04 02:09:48,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:48,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:09:48,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:09:48,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:48,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:49,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229542303] [2025-03-04 02:09:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229542303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:49,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:49,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:09:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592532766] [2025-03-04 02:09:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:49,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:49,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:49,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:49,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-04 02:09:49,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 50 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-04 02:09:49,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:49,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-04 02:09:49,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:49,558 INFO L124 PetriNetUnfolderBase]: 3575/5339 cut-off events. [2025-03-04 02:09:49,559 INFO L125 PetriNetUnfolderBase]: For 14442/14447 co-relation queries the response was YES. [2025-03-04 02:09:49,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19436 conditions, 5339 events. 3575/5339 cut-off events. For 14442/14447 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 26479 event pairs, 364 based on Foata normal form. 81/5420 useless extension candidates. Maximal degree in co-relation 19403. Up to 2674 conditions per place. [2025-03-04 02:09:49,579 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 48 selfloop transitions, 2 changer transitions 44/98 dead transitions. [2025-03-04 02:09:49,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 790 flow [2025-03-04 02:09:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:09:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:09:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-03-04 02:09:49,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2025-03-04 02:09:49,580 INFO L175 Difference]: Start difference. First operand has 76 places, 50 transitions, 398 flow. Second operand 6 states and 120 transitions. [2025-03-04 02:09:49,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 790 flow [2025-03-04 02:09:49,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 746 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-03-04 02:09:49,608 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 294 flow [2025-03-04 02:09:49,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2025-03-04 02:09:49,609 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2025-03-04 02:09:49,609 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 294 flow [2025-03-04 02:09:49,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-04 02:09:49,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:49,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:49,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:09:49,610 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-04 02:09:49,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash 249968826, now seen corresponding path program 2 times [2025-03-04 02:09:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148127940] [2025-03-04 02:09:49,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:09:49,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:49,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:09:49,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:09:49,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:09:49,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148127940] [2025-03-04 02:09:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148127940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:49,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:49,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:09:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045220091] [2025-03-04 02:09:49,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:49,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:09:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:49,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:09:49,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:09:49,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-04 02:09:49,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:49,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:49,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-04 02:09:49,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:49,961 INFO L124 PetriNetUnfolderBase]: 1730/2813 cut-off events. [2025-03-04 02:09:49,962 INFO L125 PetriNetUnfolderBase]: For 7706/7711 co-relation queries the response was YES. [2025-03-04 02:09:49,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9388 conditions, 2813 events. 1730/2813 cut-off events. For 7706/7711 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 14338 event pairs, 170 based on Foata normal form. 143/2956 useless extension candidates. Maximal degree in co-relation 9361. Up to 1487 conditions per place. [2025-03-04 02:09:49,974 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 63 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2025-03-04 02:09:49,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 640 flow [2025-03-04 02:09:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:09:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:09:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-04 02:09:49,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2025-03-04 02:09:49,975 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 294 flow. Second operand 4 states and 92 transitions. [2025-03-04 02:09:49,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 640 flow [2025-03-04 02:09:49,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 622 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 02:09:49,984 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 288 flow [2025-03-04 02:09:49,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-03-04 02:09:49,986 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2025-03-04 02:09:49,987 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 288 flow [2025-03-04 02:09:49,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:49,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:49,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:49,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:09:49,987 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-04 02:09:49,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash 594690205, now seen corresponding path program 1 times [2025-03-04 02:09:49,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:49,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428407523] [2025-03-04 02:09:49,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:49,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:09:50,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:09:50,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:50,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428407523] [2025-03-04 02:09:50,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428407523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:50,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:09:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783320897] [2025-03-04 02:09:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:50,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:09:50,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:50,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:09:50,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:09:50,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-04 02:09:50,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:50,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:50,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-04 02:09:50,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:50,343 INFO L124 PetriNetUnfolderBase]: 1103/1836 cut-off events. [2025-03-04 02:09:50,344 INFO L125 PetriNetUnfolderBase]: For 4524/4529 co-relation queries the response was YES. [2025-03-04 02:09:50,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6407 conditions, 1836 events. 1103/1836 cut-off events. For 4524/4529 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8433 event pairs, 85 based on Foata normal form. 113/1949 useless extension candidates. Maximal degree in co-relation 6382. Up to 617 conditions per place. [2025-03-04 02:09:50,349 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 65 selfloop transitions, 8 changer transitions 3/81 dead transitions. [2025-03-04 02:09:50,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 664 flow [2025-03-04 02:09:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:09:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:09:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-04 02:09:50,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5794871794871795 [2025-03-04 02:09:50,350 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 288 flow. Second operand 5 states and 113 transitions. [2025-03-04 02:09:50,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 664 flow [2025-03-04 02:09:50,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 654 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:09:50,353 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 304 flow [2025-03-04 02:09:50,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2025-03-04 02:09:50,354 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2025-03-04 02:09:50,354 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 304 flow [2025-03-04 02:09:50,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:50,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:50,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:50,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:09:50,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:09:50,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1161605168, now seen corresponding path program 1 times [2025-03-04 02:09:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517620198] [2025-03-04 02:09:50,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:50,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:50,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:09:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:09:50,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:50,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:50,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517620198] [2025-03-04 02:09:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517620198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:50,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:50,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:09:50,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662771896] [2025-03-04 02:09:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:50,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:09:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:50,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:09:50,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:09:50,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-04 02:09:50,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:50,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:50,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-04 02:09:50,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:50,674 INFO L124 PetriNetUnfolderBase]: 661/1098 cut-off events. [2025-03-04 02:09:50,674 INFO L125 PetriNetUnfolderBase]: For 3456/3461 co-relation queries the response was YES. [2025-03-04 02:09:50,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4143 conditions, 1098 events. 661/1098 cut-off events. For 3456/3461 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4430 event pairs, 61 based on Foata normal form. 49/1147 useless extension candidates. Maximal degree in co-relation 4116. Up to 384 conditions per place. [2025-03-04 02:09:50,678 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 11 changer transitions 3/77 dead transitions. [2025-03-04 02:09:50,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 636 flow [2025-03-04 02:09:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:09:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:09:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-03-04 02:09:50,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2025-03-04 02:09:50,680 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 304 flow. Second operand 6 states and 118 transitions. [2025-03-04 02:09:50,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 636 flow [2025-03-04 02:09:50,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 586 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-04 02:09:50,686 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 298 flow [2025-03-04 02:09:50,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2025-03-04 02:09:50,687 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2025-03-04 02:09:50,687 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 298 flow [2025-03-04 02:09:50,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:50,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:50,687 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-04 02:09:50,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:09:50,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:09:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1159559720, now seen corresponding path program 1 times [2025-03-04 02:09:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705297781] [2025-03-04 02:09:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:09:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:50,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:09:50,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:09:50,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:50,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:09:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:09:51,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:09:51,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705297781] [2025-03-04 02:09:51,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705297781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:09:51,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:09:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:09:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539402660] [2025-03-04 02:09:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:09:51,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:09:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:09:51,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:09:51,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:09:51,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-04 02:09:51,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 298 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:51,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:09:51,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-04 02:09:51,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:09:52,296 INFO L124 PetriNetUnfolderBase]: 850/1392 cut-off events. [2025-03-04 02:09:52,296 INFO L125 PetriNetUnfolderBase]: For 3658/3658 co-relation queries the response was YES. [2025-03-04 02:09:52,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5081 conditions, 1392 events. 850/1392 cut-off events. For 3658/3658 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5779 event pairs, 208 based on Foata normal form. 8/1400 useless extension candidates. Maximal degree in co-relation 5055. Up to 656 conditions per place. [2025-03-04 02:09:52,301 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 45 selfloop transitions, 3 changer transitions 51/103 dead transitions. [2025-03-04 02:09:52,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 103 transitions, 820 flow [2025-03-04 02:09:52,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:09:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:09:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2025-03-04 02:09:52,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.396011396011396 [2025-03-04 02:09:52,302 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 298 flow. Second operand 9 states and 139 transitions. [2025-03-04 02:09:52,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 103 transitions, 820 flow [2025-03-04 02:09:52,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 635 flow, removed 42 selfloop flow, removed 10 redundant places. [2025-03-04 02:09:52,309 INFO L231 Difference]: Finished difference. Result has 71 places, 40 transitions, 192 flow [2025-03-04 02:09:52,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=71, PETRI_TRANSITIONS=40} [2025-03-04 02:09:52,310 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2025-03-04 02:09:52,310 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 40 transitions, 192 flow [2025-03-04 02:09:52,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:09:52,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:09:52,311 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-04 02:09:52,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:09:52,311 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 02:09:52,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:09:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash -208760634, now seen corresponding path program 2 times [2025-03-04 02:09:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:09:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586241866] [2025-03-04 02:09:52,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:09:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:09:52,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:09:52,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:09:52,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:09:52,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:09:52,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:09:52,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:09:52,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:09:52,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:09:52,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:09:52,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:09:52,450 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:09:52,451 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-04 02:09:52,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:09:52,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-04 02:09:52,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 02:09:52,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 02:09:52,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-04 02:09:52,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:09:52,453 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:09:52,519 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:09:52,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:09:52,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:09:52 BasicIcfg [2025-03-04 02:09:52,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:09:52,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:09:52,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:09:52,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:09:52,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:09:38" (3/4) ... [2025-03-04 02:09:52,524 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:09:52,595 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-04 02:09:52,631 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:09:52,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:09:52,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:09:52,633 INFO L158 Benchmark]: Toolchain (without parser) took 15204.75ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 122.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 364.8MB. Max. memory is 16.1GB. [2025-03-04 02:09:52,634 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:09:52,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.33ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 99.5MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:09:52,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.11ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 97.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:09:52,636 INFO L158 Benchmark]: Boogie Preprocessor took 45.03ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 94.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:09:52,637 INFO L158 Benchmark]: IcfgBuilder took 629.25ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 37.9MB in the end (delta: 56.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 02:09:52,637 INFO L158 Benchmark]: TraceAbstraction took 13932.54ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 37.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 272.5MB. Max. memory is 16.1GB. [2025-03-04 02:09:52,637 INFO L158 Benchmark]: Witness Printer took 109.59ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:09:52,638 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.33ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 99.5MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.11ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 97.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.03ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 94.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 629.25ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 37.9MB in the end (delta: 56.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13932.54ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 37.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 272.5MB. Max. memory is 16.1GB. * Witness Printer took 109.59ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: 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: 821]: 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: 13.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 838 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2301 IncrementalHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 7 mSDtfsCounter, 2301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=6, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-04 02:09:52,655 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