./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix043.opt.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/mix043.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 17:18:51,207 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 17:18:51,267 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:51,270 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 17:18:51,270 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 17:18:51,290 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 17:18:51,290 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 17:18:51,290 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 17:18:51,290 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 17:18:51,291 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 17:18:51,291 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 17:18:51,291 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 17:18:51,291 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 17:18:51,292 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:18:51,292 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 17:18:51,292 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 17:18:51,292 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 -> 8b566ddb7b309d9ba7ea7e298fcc3be9218751e5387d333007519a12118bc5db
[2025-03-08 17:18:51,516 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 17:18:51,524 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 17:18:51,526 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 17:18:51,527 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 17:18:51,527 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 17:18:51,529 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix043.opt.i
[2025-03-08 17:18:52,667 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59aaa05d6/0d1e8aabed4a4f1e8aaba55c06d62e47/FLAG3187c6435
[2025-03-08 17:18:52,969 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 17:18:52,970 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix043.opt.i
[2025-03-08 17:18:52,985 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59aaa05d6/0d1e8aabed4a4f1e8aaba55c06d62e47/FLAG3187c6435
[2025-03-08 17:18:53,000 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59aaa05d6/0d1e8aabed4a4f1e8aaba55c06d62e47
[2025-03-08 17:18:53,002 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 17:18:53,003 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 17:18:53,005 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 17:18:53,005 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 17:18:53,008 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 17:18:53,009 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,009 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aae5a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53, skipping insertion in model container
[2025-03-08 17:18:53,011 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,046 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 17:18:53,148 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/mix043.opt.i[944,957]
[2025-03-08 17:18:53,262 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:18:53,274 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 17:18:53,281 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/mix043.opt.i[944,957]
[2025-03-08 17:18:53,312 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:18:53,338 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 17:18:53,339 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53 WrapperNode
[2025-03-08 17:18:53,339 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 17:18:53,340 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 17:18:53,340 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 17:18:53,340 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 17:18:53,344 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:18:53" (1/1) ...
[2025-03-08 17:18:53,352 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:18:53" (1/1) ...
[2025-03-08 17:18:53,369 INFO  L138                Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154
[2025-03-08 17:18:53,369 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 17:18:53,370 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 17:18:53,370 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 17:18:53,370 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 17:18:53,379 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,379 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,383 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,396 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:18:53,396 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,396 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,400 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,401 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,402 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,403 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,405 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 17:18:53,405 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 17:18:53,406 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 17:18:53,406 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 17:18:53,406 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (1/1) ...
[2025-03-08 17:18:53,410 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:18:53,422 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 17:18:53,434 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:18:53,436 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:18:53,456 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-03-08 17:18:53,456 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 17:18:53,456 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2025-03-08 17:18:53,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2025-03-08 17:18:53,456 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2025-03-08 17:18:53,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2025-03-08 17:18:53,457 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2025-03-08 17:18:53,457 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2025-03-08 17:18:53,457 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2025-03-08 17:18:53,457 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2025-03-08 17:18:53,457 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 17:18:53,457 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-03-08 17:18:53,457 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 17:18:53,457 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 17:18:53,458 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:18:53,576 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 17:18:53,577 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 17:18:53,816 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-08 17:18:53,817 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 17:18:53,970 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 17:18:53,970 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 17:18:53,970 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:18:53 BoogieIcfgContainer
[2025-03-08 17:18:53,970 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 17:18:53,972 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 17:18:53,972 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 17:18:53,976 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 17:18:53,976 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:18:53" (1/3) ...
[2025-03-08 17:18:53,977 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2df40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:18:53, skipping insertion in model container
[2025-03-08 17:18:53,978 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:18:53" (2/3) ...
[2025-03-08 17:18:53,978 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2df40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:18:53, skipping insertion in model container
[2025-03-08 17:18:53,978 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:18:53" (3/3) ...
[2025-03-08 17:18:53,979 INFO  L128   eAbstractionObserver]: Analyzing ICFG mix043.opt.i
[2025-03-08 17:18:53,992 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 17:18:53,993 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG mix043.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations.
[2025-03-08 17:18:53,993 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-08 17:18:54,041 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-03-08 17:18:54,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow
[2025-03-08 17:18:54,098 INFO  L124   PetriNetUnfolderBase]: 1/46 cut-off events.
[2025-03-08 17:18:54,100 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-08 17:18:54,106 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 5. Compared 100 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:18:54,107 INFO  L82        GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow
[2025-03-08 17:18:54,110 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow
[2025-03-08 17:18:54,120 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 17:18:54,131 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;@7e60a0cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 17:18:54,132 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2025-03-08 17:18:54,140 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-08 17:18:54,140 INFO  L124   PetriNetUnfolderBase]: 0/26 cut-off events.
[2025-03-08 17:18:54,140 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-08 17:18:54,140 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:18:54,141 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:18:54,141 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:18:54,145 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:18:54,145 INFO  L85        PathProgramCache]: Analyzing trace with hash -808397825, now seen corresponding path program 1 times
[2025-03-08 17:18:54,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:18:54,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646420736]
[2025-03-08 17:18:54,153 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:18:54,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:18:54,216 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes.
[2025-03-08 17:18:54,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements.
[2025-03-08 17:18:54,249 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:18:54,250 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:18:54,570 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:18:54,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:18:54,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646420736]
[2025-03-08 17:18:54,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646420736] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:18:54,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:18:54,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-03-08 17:18:54,574 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078157408]
[2025-03-08 17:18:54,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:18:54,580 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 17:18:54,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:18:54,614 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 17:18:54,614 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 17:18:54,615 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:18:54,618 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:18:54,618 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:18:54,618 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:18:54,619 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:18:58,338 INFO  L124   PetriNetUnfolderBase]: 46139/61167 cut-off events.
[2025-03-08 17:18:58,339 INFO  L125   PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES.
[2025-03-08 17:18:58,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 122171 conditions, 61167 events. 46139/61167 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 1752. Compared 351815 event pairs, 5315 based on Foata normal form. 1728/62613 useless extension candidates. Maximal degree in co-relation 122159. Up to 52921 conditions per place. 
[2025-03-08 17:18:58,673 INFO  L140   encePairwiseOnDemand]: 46/50 looper letters, 55 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2025-03-08 17:18:58,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 262 flow
[2025-03-08 17:18:58,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 17:18:58,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-08 17:18:58,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions.
[2025-03-08 17:18:58,683 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.6333333333333333
[2025-03-08 17:18:58,685 INFO  L175             Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 95 transitions.
[2025-03-08 17:18:58,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 262 flow
[2025-03-08 17:18:58,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 258 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-03-08 17:18:58,697 INFO  L231             Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow
[2025-03-08 17:18:58,700 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:18:58,703 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places.
[2025-03-08 17:18:58,705 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow
[2025-03-08 17:18:58,708 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 17:18:58,709 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:18:58,709 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:18:58,709 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 17:18:58,709 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:18:58,710 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:18:58,710 INFO  L85        PathProgramCache]: Analyzing trace with hash 627519341, now seen corresponding path program 1 times
[2025-03-08 17:18:58,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:18:58,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320431205]
[2025-03-08 17:18:58,710 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:18:58,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:18:58,729 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-03-08 17:18:58,811 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-03-08 17:18:58,814 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:18:58,814 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:18:59,069 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:18:59,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:18:59,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320431205]
[2025-03-08 17:18:59,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320431205] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:18:59,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:18:59,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 17:18:59,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519799574]
[2025-03-08 17:18:59,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:18:59,071 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 17:18:59,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:18:59,072 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 17:18:59,073 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 17:18:59,073 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:18:59,073 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:18:59,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:18:59,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:18:59,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:01,725 INFO  L124   PetriNetUnfolderBase]: 37115/53601 cut-off events.
[2025-03-08 17:19:01,725 INFO  L125   PetriNetUnfolderBase]: For 1408/1408 co-relation queries the response was YES.
[2025-03-08 17:19:01,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105067 conditions, 53601 events. 37115/53601 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 370010 event pairs, 5075 based on Foata normal form. 1728/53936 useless extension candidates. Maximal degree in co-relation 105057. Up to 28201 conditions per place. 
[2025-03-08 17:19:01,911 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 77 selfloop transitions, 6 changer transitions 1/91 dead transitions.
[2025-03-08 17:19:01,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 372 flow
[2025-03-08 17:19:01,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 17:19:01,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2025-03-08 17:19:01,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions.
[2025-03-08 17:19:01,912 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.65
[2025-03-08 17:19:01,912 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:01,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 372 flow
[2025-03-08 17:19:01,922 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:01,923 INFO  L231             Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow
[2025-03-08 17:19:01,924 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:01,924 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places.
[2025-03-08 17:19:01,924 INFO  L471      AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow
[2025-03-08 17:19:01,924 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:01,924 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:01,924 INFO  L206   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 17:19:01,924 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 17:19:01,925 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:01,927 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:01,927 INFO  L85        PathProgramCache]: Analyzing trace with hash -1806490468, now seen corresponding path program 1 times
[2025-03-08 17:19:01,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:01,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264909499]
[2025-03-08 17:19:01,927 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:01,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:01,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-03-08 17:19:01,958 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-03-08 17:19:01,959 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:01,959 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:02,108 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:02,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:02,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264909499]
[2025-03-08 17:19:02,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264909499] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:02,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:02,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 17:19:02,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186838982]
[2025-03-08 17:19:02,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:02,109 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 17:19:02,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:02,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 17:19:02,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 17:19:02,111 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:19:02,111 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:02,111 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:02,111 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:19:02,111 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:03,929 INFO  L124   PetriNetUnfolderBase]: 23963/34433 cut-off events.
[2025-03-08 17:19:03,929 INFO  L125   PetriNetUnfolderBase]: For 6758/6758 co-relation queries the response was YES.
[2025-03-08 17:19:04,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76593 conditions, 34433 events. 23963/34433 cut-off events. For 6758/6758 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 217564 event pairs, 2975 based on Foata normal form. 1344/35088 useless extension candidates. Maximal degree in co-relation 76581. Up to 12361 conditions per place. 
[2025-03-08 17:19:04,138 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 100 selfloop transitions, 10 changer transitions 1/118 dead transitions.
[2025-03-08 17:19:04,138 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 529 flow
[2025-03-08 17:19:04,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 17:19:04,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-03-08 17:19:04,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions.
[2025-03-08 17:19:04,140 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.672
[2025-03-08 17:19:04,140 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:04,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 529 flow
[2025-03-08 17:19:04,153 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:04,154 INFO  L231             Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow
[2025-03-08 17:19:04,155 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:04,155 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places.
[2025-03-08 17:19:04,155 INFO  L471      AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow
[2025-03-08 17:19:04,156 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:04,156 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:04,156 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:04,156 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 17:19:04,156 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:04,156 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:04,157 INFO  L85        PathProgramCache]: Analyzing trace with hash -1459543073, now seen corresponding path program 1 times
[2025-03-08 17:19:04,157 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:04,157 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885322301]
[2025-03-08 17:19:04,157 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:04,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:04,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-03-08 17:19:04,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-03-08 17:19:04,189 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:04,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:04,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:04,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:04,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885322301]
[2025-03-08 17:19:04,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885322301] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:04,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:04,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 17:19:04,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080368116]
[2025-03-08 17:19:04,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:04,369 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:19:04,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:04,369 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:19:04,369 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:19:04,370 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:19:04,370 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:04,370 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:04,370 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:19:04,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:05,598 INFO  L124   PetriNetUnfolderBase]: 14779/20705 cut-off events.
[2025-03-08 17:19:05,599 INFO  L125   PetriNetUnfolderBase]: For 12790/12790 co-relation queries the response was YES.
[2025-03-08 17:19:05,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50685 conditions, 20705 events. 14779/20705 cut-off events. For 12790/12790 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 114246 event pairs, 2591 based on Foata normal form. 640/21136 useless extension candidates. Maximal degree in co-relation 50671. Up to 6144 conditions per place. 
[2025-03-08 17:19:05,704 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 121 selfloop transitions, 14 changer transitions 1/143 dead transitions.
[2025-03-08 17:19:05,704 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 692 flow
[2025-03-08 17:19:05,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 17:19:05,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-08 17:19:05,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions.
[2025-03-08 17:19:05,706 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.68
[2025-03-08 17:19:05,706 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:05,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 692 flow
[2025-03-08 17:19:05,848 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:05,851 INFO  L231             Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow
[2025-03-08 17:19:05,851 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:05,851 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places.
[2025-03-08 17:19:05,852 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow
[2025-03-08 17:19:05,852 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:05,852 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:05,852 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:05,852 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 17:19:05,852 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:05,852 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:05,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -936155370, now seen corresponding path program 1 times
[2025-03-08 17:19:05,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:05,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511870756]
[2025-03-08 17:19:05,853 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:05,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:05,862 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-03-08 17:19:05,907 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-03-08 17:19:05,908 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:05,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:06,082 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:06,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:06,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511870756]
[2025-03-08 17:19:06,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511870756] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:06,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:06,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 17:19:06,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522989186]
[2025-03-08 17:19:06,083 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:06,083 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:06,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:06,084 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:06,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:06,084 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50
[2025-03-08 17:19:06,084 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:06,084 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:06,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50
[2025-03-08 17:19:06,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:06,802 INFO  L124   PetriNetUnfolderBase]: 11683/15977 cut-off events.
[2025-03-08 17:19:06,802 INFO  L125   PetriNetUnfolderBase]: For 12398/12398 co-relation queries the response was YES.
[2025-03-08 17:19:06,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40542 conditions, 15977 events. 11683/15977 cut-off events. For 12398/12398 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 83262 event pairs, 2399 based on Foata normal form. 160/16072 useless extension candidates. Maximal degree in co-relation 40527. Up to 6144 conditions per place. 
[2025-03-08 17:19:06,894 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 18 changer transitions 1/130 dead transitions.
[2025-03-08 17:19:06,894 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 650 flow
[2025-03-08 17:19:06,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 17:19:06,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-03-08 17:19:06,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions.
[2025-03-08 17:19:06,897 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.5771428571428572
[2025-03-08 17:19:06,897 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:06,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 650 flow
[2025-03-08 17:19:07,109 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:07,110 INFO  L231             Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow
[2025-03-08 17:19:07,111 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:07,111 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places.
[2025-03-08 17:19:07,111 INFO  L471      AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow
[2025-03-08 17:19:07,111 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:07,112 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:07,112 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:07,112 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 17:19:07,112 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:07,112 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:07,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -185434308, now seen corresponding path program 1 times
[2025-03-08 17:19:07,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:07,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327703677]
[2025-03-08 17:19:07,113 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:19:07,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:07,124 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:07,172 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-03-08 17:19:07,173 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:07,173 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:07,668 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:07,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:07,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327703677]
[2025-03-08 17:19:07,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327703677] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:07,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:07,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 17:19:07,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126651546]
[2025-03-08 17:19:07,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:07,670 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:07,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:07,671 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:07,671 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:07,680 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-03-08 17:19:07,680 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:07,681 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:07,681 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-03-08 17:19:07,681 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:09,059 INFO  L124   PetriNetUnfolderBase]: 17367/23735 cut-off events.
[2025-03-08 17:19:09,060 INFO  L125   PetriNetUnfolderBase]: For 18290/18290 co-relation queries the response was YES.
[2025-03-08 17:19:09,112 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60581 conditions, 23735 events. 17367/23735 cut-off events. For 18290/18290 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 129095 event pairs, 1111 based on Foata normal form. 16/23743 useless extension candidates. Maximal degree in co-relation 60565. Up to 12620 conditions per place. 
[2025-03-08 17:19:09,146 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 80 selfloop transitions, 5 changer transitions 60/151 dead transitions.
[2025-03-08 17:19:09,147 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 151 transitions, 922 flow
[2025-03-08 17:19:09,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:09,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:09,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions.
[2025-03-08 17:19:09,148 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.49
[2025-03-08 17:19:09,148 INFO  L175             Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 8 states and 196 transitions.
[2025-03-08 17:19:09,148 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 151 transitions, 922 flow
[2025-03-08 17:19:09,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 151 transitions, 697 flow, removed 34 selfloop flow, removed 10 redundant places.
[2025-03-08 17:19:09,362 INFO  L231             Difference]: Finished difference. Result has 70 places, 58 transitions, 195 flow
[2025-03-08 17:19:09,362 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=70, PETRI_TRANSITIONS=58}
[2025-03-08 17:19:09,363 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places.
[2025-03-08 17:19:09,363 INFO  L471      AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 195 flow
[2025-03-08 17:19:09,363 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:09,363 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:09,363 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:09,363 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 17:19:09,363 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:09,364 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:09,364 INFO  L85        PathProgramCache]: Analyzing trace with hash 833397596, now seen corresponding path program 2 times
[2025-03-08 17:19:09,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:09,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655596233]
[2025-03-08 17:19:09,364 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-08 17:19:09,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:09,373 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:09,415 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:09,416 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-08 17:19:09,416 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:09,768 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:09,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:09,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655596233]
[2025-03-08 17:19:09,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655596233] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:09,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:09,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 17:19:09,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444462984]
[2025-03-08 17:19:09,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:09,769 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:09,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:09,770 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:09,770 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:09,776 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-03-08 17:19:09,777 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 195 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:09,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:09,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-03-08 17:19:09,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:10,729 INFO  L124   PetriNetUnfolderBase]: 14451/20014 cut-off events.
[2025-03-08 17:19:10,730 INFO  L125   PetriNetUnfolderBase]: For 9235/9238 co-relation queries the response was YES.
[2025-03-08 17:19:10,803 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48873 conditions, 20014 events. 14451/20014 cut-off events. For 9235/9238 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 108788 event pairs, 4597 based on Foata normal form. 18/20028 useless extension candidates. Maximal degree in co-relation 48856. Up to 12406 conditions per place. 
[2025-03-08 17:19:10,830 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 73 selfloop transitions, 4 changer transitions 65/148 dead transitions.
[2025-03-08 17:19:10,830 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 148 transitions, 766 flow
[2025-03-08 17:19:10,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:10,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:10,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions.
[2025-03-08 17:19:10,831 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.4825
[2025-03-08 17:19:10,831 INFO  L175             Difference]: Start difference. First operand has 70 places, 58 transitions, 195 flow. Second operand 8 states and 193 transitions.
[2025-03-08 17:19:10,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 148 transitions, 766 flow
[2025-03-08 17:19:10,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 148 transitions, 756 flow, removed 5 selfloop flow, removed 3 redundant places.
[2025-03-08 17:19:10,837 INFO  L231             Difference]: Finished difference. Result has 74 places, 57 transitions, 201 flow
[2025-03-08 17:19:10,837 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=201, PETRI_PLACES=74, PETRI_TRANSITIONS=57}
[2025-03-08 17:19:10,838 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places.
[2025-03-08 17:19:10,838 INFO  L471      AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 201 flow
[2025-03-08 17:19:10,838 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:10,838 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:10,838 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:10,838 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 17:19:10,838 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:10,839 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:10,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 638370848, now seen corresponding path program 3 times
[2025-03-08 17:19:10,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:10,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477766065]
[2025-03-08 17:19:10,839 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-08 17:19:10,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:10,847 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:10,885 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:10,886 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2025-03-08 17:19:10,886 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:11,226 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,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:11,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477766065]
[2025-03-08 17:19:11,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477766065] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:11,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:11,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 17:19:11,226 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209078196]
[2025-03-08 17:19:11,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:11,226 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 17:19:11,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:11,227 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 17:19:11,227 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 17:19:11,238 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-03-08 17:19:11,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 201 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:11,239 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:11,239 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-03-08 17:19:11,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:12,304 INFO  L124   PetriNetUnfolderBase]: 13923/19494 cut-off events.
[2025-03-08 17:19:12,304 INFO  L125   PetriNetUnfolderBase]: For 9480/9480 co-relation queries the response was YES.
[2025-03-08 17:19:12,347 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47636 conditions, 19494 events. 13923/19494 cut-off events. For 9480/9480 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 110389 event pairs, 3946 based on Foata normal form. 16/19508 useless extension candidates. Maximal degree in co-relation 47616. Up to 9972 conditions per place. 
[2025-03-08 17:19:12,364 INFO  L140   encePairwiseOnDemand]: 42/50 looper letters, 56 selfloop transitions, 3 changer transitions 75/140 dead transitions.
[2025-03-08 17:19:12,364 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 736 flow
[2025-03-08 17:19:12,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 17:19:12,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2025-03-08 17:19:12,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions.
[2025-03-08 17:19:12,366 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.4625
[2025-03-08 17:19:12,366 INFO  L175             Difference]: Start difference. First operand has 74 places, 57 transitions, 201 flow. Second operand 8 states and 185 transitions.
[2025-03-08 17:19:12,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 736 flow
[2025-03-08 17:19:12,370 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 140 transitions, 722 flow, removed 5 selfloop flow, removed 4 redundant places.
[2025-03-08 17:19:12,372 INFO  L231             Difference]: Finished difference. Result has 77 places, 55 transitions, 195 flow
[2025-03-08 17:19:12,373 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=77, PETRI_TRANSITIONS=55}
[2025-03-08 17:19:12,374 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places.
[2025-03-08 17:19:12,375 INFO  L471      AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 195 flow
[2025-03-08 17:19:12,375 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:12,375 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:12,375 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:12,375 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 17:19:12,375 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:12,376 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:12,376 INFO  L85        PathProgramCache]: Analyzing trace with hash 37786960, now seen corresponding path program 4 times
[2025-03-08 17:19:12,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:12,376 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565392541]
[2025-03-08 17:19:12,376 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-03-08 17:19:12,376 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:12,383 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes.
[2025-03-08 17:19:12,411 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:12,412 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-03-08 17:19:12,412 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:19:13,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 17:19:13,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:19:13,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565392541]
[2025-03-08 17:19:13,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565392541] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:19:13,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:19:13,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 17:19:13,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688085155]
[2025-03-08 17:19:13,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:19:13,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 17:19:13,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:19:13,042 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 17:19:13,042 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-03-08 17:19:13,052 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50
[2025-03-08 17:19:13,052 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 55 transitions, 195 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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,052 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-08 17:19:13,052 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50
[2025-03-08 17:19:13,052 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-08 17:19:13,724 INFO  L124   PetriNetUnfolderBase]: 9762/13887 cut-off events.
[2025-03-08 17:19:13,724 INFO  L125   PetriNetUnfolderBase]: For 8136/8136 co-relation queries the response was YES.
[2025-03-08 17:19:13,763 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33738 conditions, 13887 events. 9762/13887 cut-off events. For 8136/8136 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 77546 event pairs, 3946 based on Foata normal form. 16/13902 useless extension candidates. Maximal degree in co-relation 33716. Up to 8834 conditions per place. 
[2025-03-08 17:19:13,776 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 63 selfloop transitions, 3 changer transitions 27/99 dead transitions.
[2025-03-08 17:19:13,776 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 529 flow
[2025-03-08 17:19:13,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 17:19:13,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2025-03-08 17:19:13,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2025-03-08 17:19:13,777 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.4
[2025-03-08 17:19:13,777 INFO  L175             Difference]: Start difference. First operand has 77 places, 55 transitions, 195 flow. Second operand 7 states and 140 transitions.
[2025-03-08 17:19:13,777 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 529 flow
[2025-03-08 17:19:13,782 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 511 flow, removed 7 selfloop flow, removed 5 redundant places.
[2025-03-08 17:19:13,782 INFO  L231             Difference]: Finished difference. Result has 78 places, 55 transitions, 200 flow
[2025-03-08 17:19:13,782 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=78, PETRI_TRANSITIONS=55}
[2025-03-08 17:19:13,783 INFO  L279   CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places.
[2025-03-08 17:19:13,783 INFO  L471      AbstractCegarLoop]: Abstraction has has 78 places, 55 transitions, 200 flow
[2025-03-08 17:19:13,783 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 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,783 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-08 17:19:13,783 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:13,783 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 17:19:13,783 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2025-03-08 17:19:13,783 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:19:13,784 INFO  L85        PathProgramCache]: Analyzing trace with hash 1443009528, now seen corresponding path program 5 times
[2025-03-08 17:19:13,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:19:13,784 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326281607]
[2025-03-08 17:19:13,784 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-03-08 17:19:13,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:19:13,792 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:13,827 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:13,828 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-08 17:19:13,828 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 17:19:13,828 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 17:19:13,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes.
[2025-03-08 17:19:13,863 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements.
[2025-03-08 17:19:13,863 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:19:13,863 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 17:19:13,892 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 17:19:13,892 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 17:19:13,893 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2025-03-08 17:19:13,894 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2025-03-08 17:19:13,894 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2025-03-08 17:19:13,895 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2025-03-08 17:19:13,895 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2025-03-08 17:19:13,895 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2025-03-08 17:19:13,895 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2025-03-08 17:19:13,895 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 17:19:13,895 INFO  L422         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1]
[2025-03-08 17:19:13,974 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-03-08 17:19:13,974 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 17:19:13,977 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:19:13 BasicIcfg
[2025-03-08 17:19:13,978 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 17:19:13,978 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 17:19:13,978 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 17:19:13,978 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 17:19:13,979 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:18:53" (3/4) ...
[2025-03-08 17:19:13,979 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-03-08 17:19:14,062 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 9.
[2025-03-08 17:19:14,099 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 17:19:14,099 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 17:19:14,099 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 17:19:14,100 INFO  L158              Benchmark]: Toolchain (without parser) took 21096.63ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 104.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB.
[2025-03-08 17:19:14,100 INFO  L158              Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:19:14,100 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 334.35ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 80.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 17:19:14,101 INFO  L158              Benchmark]: Boogie Procedure Inliner took 29.73ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 78.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:19:14,101 INFO  L158              Benchmark]: Boogie Preprocessor took 35.14ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 75.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:19:14,101 INFO  L158              Benchmark]: IcfgBuilder took 565.11ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 88.7MB in the end (delta: -14.1MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB.
[2025-03-08 17:19:14,101 INFO  L158              Benchmark]: TraceAbstraction took 20005.41ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 88.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB.
[2025-03-08 17:19:14,101 INFO  L158              Benchmark]: Witness Printer took 120.91ms. Allocated memory is still 3.0GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 17:19:14,104 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 334.35ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 80.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 29.73ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 78.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 35.14ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 75.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 565.11ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 88.7MB in the end (delta: -14.1MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 20005.41ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 88.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB.
 * Witness Printer took 120.91ms. Allocated memory is still 3.0GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 25.2MB). 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_p0_EAX = 0;
[L714]               0  int __unbuffered_p1_EAX = 0;
[L716]               0  int __unbuffered_p3_EAX = 0;
[L718]               0  int __unbuffered_p3_EBX = 0;
[L720]               0  int a = 0;
[L722]               0  int b = 0;
[L723]               0  _Bool main$tmp_guard0;
[L724]               0  _Bool main$tmp_guard1;
[L726]               0  int x = 0;
[L728]               0  int y = 0;
[L730]               0  int z = 0;
[L731]               0  _Bool z$flush_delayed;
[L732]               0  int z$mem_tmp;
[L733]               0  _Bool z$r_buff0_thd0;
[L734]               0  _Bool z$r_buff0_thd1;
[L735]               0  _Bool z$r_buff0_thd2;
[L736]               0  _Bool z$r_buff0_thd3;
[L737]               0  _Bool z$r_buff0_thd4;
[L738]               0  _Bool z$r_buff1_thd0;
[L739]               0  _Bool z$r_buff1_thd1;
[L740]               0  _Bool z$r_buff1_thd2;
[L741]               0  _Bool z$r_buff1_thd3;
[L742]               0  _Bool z$r_buff1_thd4;
[L743]               0  _Bool z$read_delayed;
[L744]               0  int *z$read_delayed_var;
[L745]               0  int z$w_buff0;
[L746]               0  _Bool z$w_buff0_used;
[L747]               0  int z$w_buff1;
[L748]               0  _Bool z$w_buff1_used;
[L749]               0  _Bool weak$$choice0;
[L750]               0  _Bool weak$$choice2;
[L848]               0  pthread_t t1133;
[L849]  FCALL, FORK  0  pthread_create(&t1133, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1133=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L850]               0  pthread_t t1134;
[L851]  FCALL, FORK  0  pthread_create(&t1134, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1133=-3, t1134=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L852]               0  pthread_t t1135;
[L853]  FCALL, FORK  0  pthread_create(&t1135, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1133=-3, t1134=-2, t1135=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L854]               0  pthread_t t1136;
[L855]  FCALL, FORK  0  pthread_create(&t1136, ((void *)0), P3, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1133=-3, t1134=-2, t1135=-1, t1136=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L804]               4  z$w_buff1 = z$w_buff0
[L805]               4  z$w_buff0 = 2
[L806]               4  z$w_buff1_used = z$w_buff0_used
[L807]               4  z$w_buff0_used = (_Bool)1
[L808]  CALL         4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   4  !(!expression)
[L808]  RET          4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L809]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L810]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L811]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L812]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L813]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L814]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L817]               4  a = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L820]               4  __unbuffered_p3_EAX = a
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L823]               4  __unbuffered_p3_EBX = b
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754]               1  b = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L757]               1  __unbuffered_p0_EAX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L769]               2  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L772]               2  __unbuffered_p1_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L784]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L787]               3  z = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L790]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L791]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L792]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L793]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L794]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L762]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L777]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L826]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L827]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L828]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L829]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L830]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L833]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L857]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, main$tmp_guard1=0, t1133=-3, t1134=-2, t1135=-1, t1136=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L859]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L859]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L861]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L862]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L863]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L864]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L865]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, main$tmp_guard1=0, t1133=-3, t1134=-2, t1135=-1, t1136=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L868]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L869]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L870]               0  z$flush_delayed = weak$$choice2
[L871]               0  z$mem_tmp = z
[L872]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L873]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L874]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L875]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L876]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L878]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L879]               0  main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L880]               0  z = z$flush_delayed ? z$mem_tmp : z
[L881]               0  z$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, main$tmp_guard1=0, t1133=-3, t1134=-2, t1135=-1, t1136=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2]
[L883]  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_p0_EAX=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, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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_p0_EAX=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, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 851]: 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: 855]: 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: 853]: 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: 19.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 951 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 941 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1822 IncrementalHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 8 mSDtfsCounter, 1822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=5, InterpolantAutomatonStates: 56, 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.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389 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:14,122 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