./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.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 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 17:18:59,295 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 17:18:59,350 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 17:18:59,354 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 17:18:59,355 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 17:18:59,375 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 17:18:59,376 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 17:18:59,376 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 17:18:59,377 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 17:18:59,377 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 17:18:59,378 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 17:18:59,378 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 17:18:59,378 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 17:18:59,378 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 17:18:59,378 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 17:18:59,379 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 17:18:59,379 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 17:18:59,379 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:18:59,380 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 17:18:59,380 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 17:18:59,380 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 -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1
[2025-03-08 17:18:59,676 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 17:18:59,681 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 17:18:59,683 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 17:18:59,683 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 17:18:59,684 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 17:18:59,684 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i
[2025-03-08 17:19:00,858 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90750d3ec/c9eabdb94d7a4a75b6ad06f7fd88262a/FLAGed9408050
[2025-03-08 17:19:01,132 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 17:19:01,133 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i
[2025-03-08 17:19:01,143 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90750d3ec/c9eabdb94d7a4a75b6ad06f7fd88262a/FLAGed9408050
[2025-03-08 17:19:01,442 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90750d3ec/c9eabdb94d7a4a75b6ad06f7fd88262a
[2025-03-08 17:19:01,444 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 17:19:01,445 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 17:19:01,445 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 17:19:01,445 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 17:19:01,448 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 17:19:01,448 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,449 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dcbc3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01, skipping insertion in model container
[2025-03-08 17:19:01,449 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,470 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 17:19:01,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/mix044_tso.oepc.i[949,962]
[2025-03-08 17:19:01,779 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:19:01,788 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 17:19:01,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/mix044_tso.oepc.i[949,962]
[2025-03-08 17:19:01,827 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:19:01,854 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 17:19:01,854 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01 WrapperNode
[2025-03-08 17:19:01,855 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 17:19:01,855 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 17:19:01,856 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 17:19:01,856 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 17:19:01,860 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,874 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,892 INFO  L138                Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147
[2025-03-08 17:19:01,893 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 17:19:01,894 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 17:19:01,894 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 17:19:01,894 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 17:19:01,900 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,900 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,903 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,921 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-08 17:19:01,921 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,921 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,930 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,931 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,932 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,933 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,935 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 17:19:01,935 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 17:19:01,935 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 17:19:01,935 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 17:19:01,936 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (1/1) ...
[2025-03-08 17:19:01,940 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:19:01,952 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 17:19:01,965 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 17:19:01,968 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 17:19:01,991 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-03-08 17:19:01,991 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 17:19:01,991 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2025-03-08 17:19:01,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2025-03-08 17:19:01,991 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2025-03-08 17:19:01,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2025-03-08 17:19:01,991 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2025-03-08 17:19:01,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2025-03-08 17:19:01,992 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2025-03-08 17:19:01,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2025-03-08 17:19:01,992 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 17:19:01,992 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-03-08 17:19:01,992 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 17:19:01,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 17:19:01,993 WARN  L225             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-03-08 17:19:02,103 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 17:19:02,105 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 17:19:02,372 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-08 17:19:02,372 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 17:19:02,559 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 17:19:02,560 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 17:19:02,561 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:02 BoogieIcfgContainer
[2025-03-08 17:19:02,561 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 17:19:02,563 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 17:19:02,563 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 17:19:02,566 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 17:19:02,567 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:19:01" (1/3) ...
[2025-03-08 17:19:02,567 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c3b28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:19:02, skipping insertion in model container
[2025-03-08 17:19:02,568 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:19:01" (2/3) ...
[2025-03-08 17:19:02,568 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c3b28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:19:02, skipping insertion in model container
[2025-03-08 17:19:02,569 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:02" (3/3) ...
[2025-03-08 17:19:02,570 INFO  L128   eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i
[2025-03-08 17:19:02,579 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 17:19:02,582 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG mix044_tso.oepc.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2025-03-08 17:19:02,582 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-08 17:19:02,619 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-03-08 17:19:02,645 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow
[2025-03-08 17:19:02,675 INFO  L124   PetriNetUnfolderBase]: 1/46 cut-off events.
[2025-03-08 17:19:02,678 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-08 17:19:02,681 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. 
[2025-03-08 17:19:02,681 INFO  L82        GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow
[2025-03-08 17:19:02,687 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow
[2025-03-08 17:19:02,695 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 17:19:02,706 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;@4d789daf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 17:19:02,707 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2025-03-08 17:19:02,713 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-08 17:19:02,714 INFO  L124   PetriNetUnfolderBase]: 0/10 cut-off events.
[2025-03-08 17:19:02,714 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-08 17:19:02,714 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:02,714 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:02,715 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:02,718 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:02,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -154655250, now seen corresponding path program 1 times
[2025-03-08 17:19:02,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:02,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872138576]
[2025-03-08 17:19:02,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:02,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:02,792 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes.
[2025-03-08 17:19:02,824 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements.
[2025-03-08 17:19:02,824 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:02,824 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:03,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:03,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:03,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872138576]
[2025-03-08 17:19:03,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872138576] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:03,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:03,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-03-08 17:19:03,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166306797]
[2025-03-08 17:19:03,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:03,099 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 17:19:03,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:03,116 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 17:19:03,117 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 17:19:03,118 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:19:03,120 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:03,120 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:03,121 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:19:03,121 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:07,253 INFO  L124   PetriNetUnfolderBase]: 46139/61039 cut-off events.
[2025-03-08 17:19:07,254 INFO  L125   PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES.
[2025-03-08 17:19:07,424 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 122043 conditions, 61039 events. 46139/61039 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 1787. Compared 366500 event pairs, 5709 based on Foata normal form. 1692/62495 useless extension candidates. Maximal degree in co-relation 122031. Up to 52371 conditions per place. 
[2025-03-08 17:19:07,697 INFO  L140   encePairwiseOnDemand]: 46/50 looper letters, 61 selfloop transitions, 2 changer transitions 2/72 dead transitions.
[2025-03-08 17:19:07,697 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 292 flow
[2025-03-08 17:19:07,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 17:19:07,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-08 17:19:07,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions.
[2025-03-08 17:19:07,707 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6733333333333333
[2025-03-08 17:19:07,708 INFO  L175             Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 101 transitions.
[2025-03-08 17:19:07,709 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 292 flow
[2025-03-08 17:19:07,716 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-03-08 17:19:07,719 INFO  L231             Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow
[2025-03-08 17:19:07,721 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43}
[2025-03-08 17:19:07,725 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places.
[2025-03-08 17:19:07,726 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow
[2025-03-08 17:19:07,726 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:07,726 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:07,726 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:07,726 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 17:19:07,727 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:07,727 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:07,727 INFO  L85        PathProgramCache]: Analyzing trace with hash -954912937, now seen corresponding path program 1 times
[2025-03-08 17:19:07,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:07,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526088732]
[2025-03-08 17:19:07,728 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:07,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:07,744 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-03-08 17:19:07,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-03-08 17:19:07,803 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:07,803 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:08,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:08,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:08,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526088732]
[2025-03-08 17:19:08,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526088732] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:08,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:08,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 17:19:08,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367816089]
[2025-03-08 17:19:08,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:08,031 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 17:19:08,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:08,032 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 17:19:08,032 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 17:19:08,032 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:19:08,032 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-08 17:19:08,032 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:08,032 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:19:08,032 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:10,991 INFO  L124   PetriNetUnfolderBase]: 37115/53611 cut-off events.
[2025-03-08 17:19:10,992 INFO  L125   PetriNetUnfolderBase]: For 1908/1908 co-relation queries the response was YES.
[2025-03-08 17:19:11,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105577 conditions, 53611 events. 37115/53611 cut-off events. For 1908/1908 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 371678 event pairs, 5075 based on Foata normal form. 1728/53940 useless extension candidates. Maximal degree in co-relation 105567. Up to 28201 conditions per place. 
[2025-03-08 17:19:11,350 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 77 selfloop transitions, 6 changer transitions 1/91 dead transitions.
[2025-03-08 17:19:11,350 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 372 flow
[2025-03-08 17:19:11,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 17:19:11,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2025-03-08 17:19:11,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions.
[2025-03-08 17:19:11,354 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.65
[2025-03-08 17:19:11,354 INFO  L175             Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 130 transitions.
[2025-03-08 17:19:11,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 372 flow
[2025-03-08 17:19:11,357 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-08 17:19:11,359 INFO  L231             Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow
[2025-03-08 17:19:11,359 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47}
[2025-03-08 17:19:11,359 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places.
[2025-03-08 17:19:11,359 INFO  L471      AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow
[2025-03-08 17:19:11,360 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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-08 17:19:11,360 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:11,360 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:11,360 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 17:19:11,360 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:11,360 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:11,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -1762711548, now seen corresponding path program 1 times
[2025-03-08 17:19:11,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:11,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371704174]
[2025-03-08 17:19:11,362 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:11,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:11,375 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-03-08 17:19:11,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-03-08 17:19:11,432 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:11,432 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:11,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:11,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:11,618 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371704174]
[2025-03-08 17:19:11,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371704174] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:11,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:11,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 17:19:11,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838031344]
[2025-03-08 17:19:11,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:11,619 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 17:19:11,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:11,619 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 17:19:11,620 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 17:19:11,620 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:19:11,620 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand  has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:11,620 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:11,620 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:19:11,620 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:13,552 INFO  L124   PetriNetUnfolderBase]: 23963/34443 cut-off events.
[2025-03-08 17:19:13,552 INFO  L125   PetriNetUnfolderBase]: For 6798/6798 co-relation queries the response was YES.
[2025-03-08 17:19:13,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76603 conditions, 34443 events. 23963/34443 cut-off events. For 6798/6798 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 218668 event pairs, 2975 based on Foata normal form. 1344/35092 useless extension candidates. Maximal degree in co-relation 76591. Up to 12361 conditions per place. 
[2025-03-08 17:19:13,729 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 100 selfloop transitions, 10 changer transitions 1/118 dead transitions.
[2025-03-08 17:19:13,729 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 529 flow
[2025-03-08 17:19:13,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 17:19:13,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-03-08 17:19:13,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions.
[2025-03-08 17:19:13,731 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.672
[2025-03-08 17:19:13,731 INFO  L175             Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 168 transitions.
[2025-03-08 17:19:13,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 529 flow
[2025-03-08 17:19:13,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 518 flow, removed 1 selfloop flow, removed 2 redundant places.
[2025-03-08 17:19:13,740 INFO  L231             Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow
[2025-03-08 17:19:13,740 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51}
[2025-03-08 17:19:13,741 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places.
[2025-03-08 17:19:13,741 INFO  L471      AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow
[2025-03-08 17:19:13,741 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:13,742 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:13,742 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-08 17:19:13,742 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 17:19:13,742 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:13,743 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:13,743 INFO  L85        PathProgramCache]: Analyzing trace with hash -1934320005, now seen corresponding path program 1 times
[2025-03-08 17:19:13,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:13,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366001779]
[2025-03-08 17:19:13,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:13,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:13,755 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-03-08 17:19:13,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-03-08 17:19:13,830 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:13,830 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:14,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:14,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:14,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366001779]
[2025-03-08 17:19:14,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366001779] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:14,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:14,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 17:19:14,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768781208]
[2025-03-08 17:19:14,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:14,112 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:19:14,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:14,112 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:19:14,113 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:19:14,113 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:19:14,113 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:14,113 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:14,114 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:19:14,114 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:15,171 INFO  L124   PetriNetUnfolderBase]: 14779/20715 cut-off events.
[2025-03-08 17:19:15,172 INFO  L125   PetriNetUnfolderBase]: For 12850/12850 co-relation queries the response was YES.
[2025-03-08 17:19:15,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50695 conditions, 20715 events. 14779/20715 cut-off events. For 12850/12850 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 114952 event pairs, 2591 based on Foata normal form. 640/21140 useless extension candidates. Maximal degree in co-relation 50681. Up to 6144 conditions per place. 
[2025-03-08 17:19:15,287 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 121 selfloop transitions, 14 changer transitions 1/143 dead transitions.
[2025-03-08 17:19:15,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 692 flow
[2025-03-08 17:19:15,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 17:19:15,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-08 17:19:15,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions.
[2025-03-08 17:19:15,288 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.68
[2025-03-08 17:19:15,288 INFO  L175             Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 204 transitions.
[2025-03-08 17:19:15,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 692 flow
[2025-03-08 17:19:15,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 143 transitions, 662 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-03-08 17:19:15,452 INFO  L231             Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow
[2025-03-08 17:19:15,452 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55}
[2025-03-08 17:19:15,453 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places.
[2025-03-08 17:19:15,453 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow
[2025-03-08 17:19:15,453 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:15,453 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:15,453 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, 1, 1]
[2025-03-08 17:19:15,453 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 17:19:15,453 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:15,454 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:15,454 INFO  L85        PathProgramCache]: Analyzing trace with hash -10208635, now seen corresponding path program 1 times
[2025-03-08 17:19:15,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:15,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565882463]
[2025-03-08 17:19:15,454 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:15,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:15,461 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-08 17:19:15,499 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-08 17:19:15,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:15,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:15,683 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:15,683 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:15,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565882463]
[2025-03-08 17:19:15,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565882463] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:15,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:15,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 17:19:15,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871891054]
[2025-03-08 17:19:15,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:15,684 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:15,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:15,684 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:15,684 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:15,685 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:19:15,685 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:15,685 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:15,685 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:19:15,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:16,518 INFO  L124   PetriNetUnfolderBase]: 11683/15987 cut-off events.
[2025-03-08 17:19:16,518 INFO  L125   PetriNetUnfolderBase]: For 12458/12458 co-relation queries the response was YES.
[2025-03-08 17:19:16,556 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40552 conditions, 15987 events. 11683/15987 cut-off events. For 12458/12458 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 83810 event pairs, 2399 based on Foata normal form. 160/16076 useless extension candidates. Maximal degree in co-relation 40537. Up to 6144 conditions per place. 
[2025-03-08 17:19:16,593 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 18 changer transitions 1/130 dead transitions.
[2025-03-08 17:19:16,593 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 650 flow
[2025-03-08 17:19:16,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 17:19:16,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-03-08 17:19:16,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions.
[2025-03-08 17:19:16,595 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5771428571428572
[2025-03-08 17:19:16,596 INFO  L175             Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 202 transitions.
[2025-03-08 17:19:16,596 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 650 flow
[2025-03-08 17:19:16,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 604 flow, removed 9 selfloop flow, removed 5 redundant places.
[2025-03-08 17:19:16,788 INFO  L231             Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow
[2025-03-08 17:19:16,788 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55}
[2025-03-08 17:19:16,789 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places.
[2025-03-08 17:19:16,789 INFO  L471      AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow
[2025-03-08 17:19:16,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:16,789 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:16,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:16,790 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 17:19:16,790 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:16,790 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:16,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -1501935078, now seen corresponding path program 1 times
[2025-03-08 17:19:16,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:16,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217594846]
[2025-03-08 17:19:16,790 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:16,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:16,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:16,884 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-03-08 17:19:16,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:16,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:17,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:17,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:17,333 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217594846]
[2025-03-08 17:19:17,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217594846] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:17,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:17,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 17:19:17,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492499405]
[2025-03-08 17:19:17,333 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:17,333 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:17,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:17,334 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:17,334 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:17,342 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-03-08 17:19:17,342 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:17,342 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:17,342 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-03-08 17:19:17,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:18,821 INFO  L124   PetriNetUnfolderBase]: 17316/23599 cut-off events.
[2025-03-08 17:19:18,821 INFO  L125   PetriNetUnfolderBase]: For 17312/17312 co-relation queries the response was YES.
[2025-03-08 17:19:18,859 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59668 conditions, 23599 events. 17316/23599 cut-off events. For 17312/17312 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 127482 event pairs, 2355 based on Foata normal form. 16/23607 useless extension candidates. Maximal degree in co-relation 59652. Up to 13546 conditions per place. 
[2025-03-08 17:19:18,892 INFO  L140   encePairwiseOnDemand]: 35/50 looper letters, 93 selfloop transitions, 19 changer transitions 65/183 dead transitions.
[2025-03-08 17:19:18,892 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 183 transitions, 1132 flow
[2025-03-08 17:19:18,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:18,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:18,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions.
[2025-03-08 17:19:18,894 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.55
[2025-03-08 17:19:18,894 INFO  L175             Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 8 states and 220 transitions.
[2025-03-08 17:19:18,894 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 183 transitions, 1132 flow
[2025-03-08 17:19:19,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 183 transitions, 855 flow, removed 34 selfloop flow, removed 10 redundant places.
[2025-03-08 17:19:19,105 INFO  L231             Difference]: Finished difference. Result has 70 places, 72 transitions, 295 flow
[2025-03-08 17:19:19,105 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=295, PETRI_PLACES=70, PETRI_TRANSITIONS=72}
[2025-03-08 17:19:19,106 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places.
[2025-03-08 17:19:19,106 INFO  L471      AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 295 flow
[2025-03-08 17:19:19,106 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:19,106 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:19,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:19,106 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 17:19:19,106 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:19,106 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:19,106 INFO  L85        PathProgramCache]: Analyzing trace with hash -129258844, now seen corresponding path program 2 times
[2025-03-08 17:19:19,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:19,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452560960]
[2025-03-08 17:19:19,107 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-08 17:19:19,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:19,115 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:19,182 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-03-08 17:19:19,182 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-08 17:19:19,182 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:19,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:19,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:19,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452560960]
[2025-03-08 17:19:19,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452560960] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:19,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:19,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 17:19:19,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874087562]
[2025-03-08 17:19:19,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:19,554 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:19,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:19,554 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:19,554 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:19,564 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-03-08 17:19:19,564 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 295 flow. Second operand  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:19,564 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:19,564 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-03-08 17:19:19,564 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:21,448 INFO  L124   PetriNetUnfolderBase]: 19617/27039 cut-off events.
[2025-03-08 17:19:21,449 INFO  L125   PetriNetUnfolderBase]: For 18878/18880 co-relation queries the response was YES.
[2025-03-08 17:19:21,545 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79020 conditions, 27039 events. 19617/27039 cut-off events. For 18878/18880 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 152353 event pairs, 1204 based on Foata normal form. 17/27054 useless extension candidates. Maximal degree in co-relation 79003. Up to 12705 conditions per place. 
[2025-03-08 17:19:21,581 INFO  L140   encePairwiseOnDemand]: 35/50 looper letters, 93 selfloop transitions, 16 changer transitions 73/188 dead transitions.
[2025-03-08 17:19:21,581 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 188 transitions, 1105 flow
[2025-03-08 17:19:21,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:21,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:21,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions.
[2025-03-08 17:19:21,582 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.52
[2025-03-08 17:19:21,583 INFO  L175             Difference]: Start difference. First operand has 70 places, 72 transitions, 295 flow. Second operand 8 states and 208 transitions.
[2025-03-08 17:19:21,583 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 188 transitions, 1105 flow
[2025-03-08 17:19:21,593 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 188 transitions, 1095 flow, removed 5 selfloop flow, removed 3 redundant places.
[2025-03-08 17:19:21,595 INFO  L231             Difference]: Finished difference. Result has 75 places, 69 transitions, 326 flow
[2025-03-08 17:19:21,595 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=75, PETRI_TRANSITIONS=69}
[2025-03-08 17:19:21,596 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places.
[2025-03-08 17:19:21,596 INFO  L471      AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 326 flow
[2025-03-08 17:19:21,596 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:21,596 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:21,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:21,596 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 17:19:21,596 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:21,597 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:21,597 INFO  L85        PathProgramCache]: Analyzing trace with hash -2022789258, now seen corresponding path program 3 times
[2025-03-08 17:19:21,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:21,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630502149]
[2025-03-08 17:19:21,597 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-08 17:19:21,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:21,607 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:21,667 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-03-08 17:19:21,667 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-03-08 17:19:21,668 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:22,197 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:22,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:22,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630502149]
[2025-03-08 17:19:22,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630502149] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:22,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:22,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 17:19:22,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361824540]
[2025-03-08 17:19:22,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:22,198 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 17:19:22,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:22,199 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 17:19:22,199 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-08 17:19:22,206 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-03-08 17:19:22,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 326 flow. Second operand  has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:22,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:22,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-03-08 17:19:22,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:24,956 INFO  L124   PetriNetUnfolderBase]: 23948/33778 cut-off events.
[2025-03-08 17:19:24,957 INFO  L125   PetriNetUnfolderBase]: For 33894/33894 co-relation queries the response was YES.
[2025-03-08 17:19:25,161 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99941 conditions, 33778 events. 23948/33778 cut-off events. For 33894/33894 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 204856 event pairs, 2958 based on Foata normal form. 16/33793 useless extension candidates. Maximal degree in co-relation 99921. Up to 11090 conditions per place. 
[2025-03-08 17:19:25,210 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 85 selfloop transitions, 9 changer transitions 142/242 dead transitions.
[2025-03-08 17:19:25,210 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 242 transitions, 1541 flow
[2025-03-08 17:19:25,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 17:19:25,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2025-03-08 17:19:25,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions.
[2025-03-08 17:19:25,211 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.508
[2025-03-08 17:19:25,211 INFO  L175             Difference]: Start difference. First operand has 75 places, 69 transitions, 326 flow. Second operand 10 states and 254 transitions.
[2025-03-08 17:19:25,211 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 242 transitions, 1541 flow
[2025-03-08 17:19:25,236 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 242 transitions, 1497 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-03-08 17:19:25,238 INFO  L231             Difference]: Finished difference. Result has 84 places, 62 transitions, 306 flow
[2025-03-08 17:19:25,239 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=306, PETRI_PLACES=84, PETRI_TRANSITIONS=62}
[2025-03-08 17:19:25,239 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places.
[2025-03-08 17:19:25,239 INFO  L471      AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 306 flow
[2025-03-08 17:19:25,239 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:25,240 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:25,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:25,240 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 17:19:25,240 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:25,240 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:25,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 1906562850, now seen corresponding path program 4 times
[2025-03-08 17:19:25,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:25,240 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534744869]
[2025-03-08 17:19:25,241 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-03-08 17:19:25,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:25,254 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes.
[2025-03-08 17:19:25,302 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements.
[2025-03-08 17:19:25,302 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-03-08 17:19:25,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:27,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:27,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:27,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534744869]
[2025-03-08 17:19:27,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534744869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:27,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:27,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 17:19:27,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118983332]
[2025-03-08 17:19:27,231 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:27,231 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 17:19:27,231 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:27,231 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 17:19:27,231 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2025-03-08 17:19:27,243 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-03-08 17:19:27,244 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 62 transitions, 306 flow. Second operand  has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:27,244 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:27,244 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-03-08 17:19:27,244 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:28,504 INFO  L124   PetriNetUnfolderBase]: 12103/17436 cut-off events.
[2025-03-08 17:19:28,505 INFO  L125   PetriNetUnfolderBase]: For 26404/26404 co-relation queries the response was YES.
[2025-03-08 17:19:28,594 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52568 conditions, 17436 events. 12103/17436 cut-off events. For 26404/26404 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 101170 event pairs, 3814 based on Foata normal form. 16/17452 useless extension candidates. Maximal degree in co-relation 52542. Up to 10564 conditions per place. 
[2025-03-08 17:19:28,618 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 71 selfloop transitions, 4 changer transitions 48/129 dead transitions.
[2025-03-08 17:19:28,618 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 129 transitions, 824 flow
[2025-03-08 17:19:28,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:28,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:28,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions.
[2025-03-08 17:19:28,619 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.425
[2025-03-08 17:19:28,619 INFO  L175             Difference]: Start difference. First operand has 84 places, 62 transitions, 306 flow. Second operand 8 states and 170 transitions.
[2025-03-08 17:19:28,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 129 transitions, 824 flow
[2025-03-08 17:19:28,657 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 776 flow, removed 14 selfloop flow, removed 9 redundant places.
[2025-03-08 17:19:28,658 INFO  L231             Difference]: Finished difference. Result has 82 places, 60 transitions, 291 flow
[2025-03-08 17:19:28,658 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=291, PETRI_PLACES=82, PETRI_TRANSITIONS=60}
[2025-03-08 17:19:28,659 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places.
[2025-03-08 17:19:28,659 INFO  L471      AbstractCegarLoop]: Abstraction has has 82 places, 60 transitions, 291 flow
[2025-03-08 17:19:28,659 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:19:28,659 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:28,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:28,659 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 17:19:28,659 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:28,660 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:28,660 INFO  L85        PathProgramCache]: Analyzing trace with hash -339374256, now seen corresponding path program 5 times
[2025-03-08 17:19:28,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:28,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432564948]
[2025-03-08 17:19:28,660 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-03-08 17:19:28,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:28,668 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:28,711 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-03-08 17:19:28,711 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-08 17:19:28,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 17:19:28,711 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 17:19:28,717 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:28,760 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-03-08 17:19:28,760 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:28,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 17:19:28,788 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 17:19:28,788 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 17:19:28,789 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2025-03-08 17:19:28,790 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2025-03-08 17:19:28,790 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2025-03-08 17:19:28,790 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2025-03-08 17:19:28,790 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2025-03-08 17:19:28,790 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2025-03-08 17:19:28,790 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2025-03-08 17:19:28,790 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 17:19:28,791 INFO  L422         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2025-03-08 17:19:28,876 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-03-08 17:19:28,876 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 17:19:28,881 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:19:28 BasicIcfg
[2025-03-08 17:19:28,881 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 17:19:28,881 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 17:19:28,881 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 17:19:28,881 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 17:19:28,882 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:19:02" (3/4) ...
[2025-03-08 17:19:28,882 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-03-08 17:19:28,968 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 9.
[2025-03-08 17:19:29,001 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 17:19:29,002 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 17:19:29,002 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 17:19:29,003 INFO  L158              Benchmark]: Toolchain (without parser) took 27557.69ms. Allocated memory was 142.6MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 110.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB.
[2025-03-08 17:19:29,003 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:19:29,003 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 409.63ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 86.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 17:19:29,004 INFO  L158              Benchmark]: Boogie Procedure Inliner took 37.89ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:19:29,005 INFO  L158              Benchmark]: Boogie Preprocessor took 41.10ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 80.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 17:19:29,006 INFO  L158              Benchmark]: IcfgBuilder took 625.54ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 86.9MB in the end (delta: -6.7MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB.
[2025-03-08 17:19:29,006 INFO  L158              Benchmark]: TraceAbstraction took 26318.15ms. Allocated memory was 142.6MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 86.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB.
[2025-03-08 17:19:29,006 INFO  L158              Benchmark]: Witness Printer took 120.60ms. Allocated memory is still 4.5GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 17:19:29,007 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.13ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 409.63ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 86.1MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 37.89ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 41.10ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 80.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 625.54ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 86.9MB in the end (delta: -6.7MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 26318.15ms. Allocated memory was 142.6MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 86.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB.
 * Witness Printer took 120.60ms. Allocated memory is still 4.5GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. 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: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p1_EAX = 0;
[L714]               0  int __unbuffered_p3_EAX = 0;
[L716]               0  int __unbuffered_p3_EBX = 0;
[L718]               0  int a = 0;
[L720]               0  int b = 0;
[L721]               0  _Bool main$tmp_guard0;
[L722]               0  _Bool main$tmp_guard1;
[L724]               0  int x = 0;
[L725]               0  _Bool x$flush_delayed;
[L726]               0  int x$mem_tmp;
[L727]               0  _Bool x$r_buff0_thd0;
[L728]               0  _Bool x$r_buff0_thd1;
[L729]               0  _Bool x$r_buff0_thd2;
[L730]               0  _Bool x$r_buff0_thd3;
[L731]               0  _Bool x$r_buff0_thd4;
[L732]               0  _Bool x$r_buff1_thd0;
[L733]               0  _Bool x$r_buff1_thd1;
[L734]               0  _Bool x$r_buff1_thd2;
[L735]               0  _Bool x$r_buff1_thd3;
[L736]               0  _Bool x$r_buff1_thd4;
[L737]               0  _Bool x$read_delayed;
[L738]               0  int *x$read_delayed_var;
[L739]               0  int x$w_buff0;
[L740]               0  _Bool x$w_buff0_used;
[L741]               0  int x$w_buff1;
[L742]               0  _Bool x$w_buff1_used;
[L744]               0  int y = 0;
[L746]               0  int z = 0;
[L747]               0  _Bool weak$$choice0;
[L748]               0  _Bool weak$$choice2;
[L856]               0  pthread_t t1185;
[L857]  FCALL, FORK  0  pthread_create(&t1185, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0]
[L858]               0  pthread_t t1186;
[L859]  FCALL, FORK  0  pthread_create(&t1186, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185=-2, t1186=-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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0]
[L860]               0  pthread_t t1187;
[L861]  FCALL, FORK  0  pthread_create(&t1187, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185=-2, t1186=-1, t1187=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0]
[L862]               0  pthread_t t1188;
[L863]  FCALL, FORK  0  pthread_create(&t1188, ((void *)0), P3, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185=-2, t1186=-1, t1187=0, t1188=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0]
[L772]               2  x$w_buff1 = x$w_buff0
[L773]               2  x$w_buff0 = 2
[L774]               2  x$w_buff1_used = x$w_buff0_used
[L775]               2  x$w_buff0_used = (_Bool)1
[L776]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18]   COND FALSE   2  !(!expression)
[L776]  RET          2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L777]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L778]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L779]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L780]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L781]               2  x$r_buff1_thd4 = x$r_buff0_thd4
[L782]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0]
[L785]               2  __unbuffered_p1_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0]
[L802]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0]
[L805]               3  z = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1]
[L808]               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)
[L809]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L810]               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
[L811]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L812]               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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1]
[L822]               4  z = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2]
[L825]               4  a = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2]
[L828]               4  __unbuffered_p3_EAX = a
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2]
[L831]               4  __unbuffered_p3_EBX = b
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2]
[L752]               1  b = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=2]
[L755]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L758]               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)
[L759]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L760]               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
[L761]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L762]               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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L834]               4  x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L835]               4  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L836]               4  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L837]               4  x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L838]               4  x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L788]               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)
[L789]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L790]               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
[L791]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L792]               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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L795]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L815]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L765]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L841]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L865]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185=-2, t1186=-1, t1187=0, t1188=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L867]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L867]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L869]               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)
[L870]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L871]               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
[L872]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L873]               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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185=-2, t1186=-1, t1187=0, t1188=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L876]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L877]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L878]               0  x$flush_delayed = weak$$choice2
[L879]               0  x$mem_tmp = x
[L880]               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)
[L881]               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))
[L882]               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))
[L883]               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))
[L884]               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))
[L885]               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))
[L886]               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))
[L887]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L888]               0  x = x$flush_delayed ? x$mem_tmp : x
[L889]               0  x$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185=-2, t1186=-1, t1187=0, t1188=1, weak$$choice0=1, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L891]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L18]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=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: 863]: 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: 859]: 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: 861]: 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: 857]: 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 9 procedures, 85 locations, 81 edges, 7 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: 26.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1089 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1079 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2158 IncrementalHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 8 mSDtfsCounter, 2158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=7, InterpolantAutomatonStates: 59, 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.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 2031 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-08 17:19:29,025 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