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


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


Checking for ERROR reachability
Using default analysis
Version c3fed411
Calling Ultimate with: /usr/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3
--- Real Ultimate output ---
This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41
[2021-12-17 22:21:34,517 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-12-17 22:21:34,519 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-17 22:21:34,551 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-17 22:21:34,552 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-17 22:21:34,555 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-17 22:21:34,556 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-17 22:21:34,558 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-17 22:21:34,559 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-17 22:21:34,562 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-17 22:21:34,563 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-12-17 22:21:34,564 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-17 22:21:34,564 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-17 22:21:34,566 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-17 22:21:34,567 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-17 22:21:34,570 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-17 22:21:34,571 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-17 22:21:34,571 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-17 22:21:34,573 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-17 22:21:34,577 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-17 22:21:34,578 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-17 22:21:34,579 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-17 22:21:34,580 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-12-17 22:21:34,580 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-17 22:21:34,585 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-17 22:21:34,585 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-17 22:21:34,586 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-17 22:21:34,587 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-17 22:21:34,587 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-17 22:21:34,588 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-17 22:21:34,588 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-17 22:21:34,589 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-17 22:21:34,590 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-17 22:21:34,591 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-17 22:21:34,592 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-17 22:21:34,592 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-17 22:21:34,593 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-17 22:21:34,593 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-17 22:21:34,593 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-17 22:21:34,594 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-17 22:21:34,594 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-12-17 22:21:34,596 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-12-17 22:21:34,622 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-12-17 22:21:34,622 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-17 22:21:34,622 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-17 22:21:34,622 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-17 22:21:34,623 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-12-17 22:21:34,623 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-12-17 22:21:34,624 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-17 22:21:34,624 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-12-17 22:21:34,624 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-12-17 22:21:34,625 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-17 22:21:34,625 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-12-17 22:21:34,625 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-12-17 22:21:34,625 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-12-17 22:21:34,626 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-12-17 22:21:34,626 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-12-17 22:21:34,626 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-12-17 22:21:34,626 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-12-17 22:21:34,626 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-12-17 22:21:34,626 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-12-17 22:21:34,626 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-12-17 22:21:34,627 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-12-17 22:21:34,627 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-17 22:21:34,627 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-12-17 22:21:34,627 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-12-17 22:21:34,627 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-17 22:21:34,627 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-17 22:21:34,627 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-12-17 22:21:34,628 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-12-17 22:21:34,628 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-12-17 22:21:34,629 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-12-17 22:21:34,629 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-12-17 22:21:34,629 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-12-17 22:21:34,629 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-12-17 22:21:34,629 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-12-17 22:21:34,629 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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.graphml
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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3
[2021-12-17 22:21:34,833 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-17 22:21:34,868 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-17 22:21:34,870 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-17 22:21:34,871 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-12-17 22:21:34,871 INFO  L275        PluginConnector]: CDTParser initialized
[2021-12-17 22:21:34,872 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2021-12-17 22:21:34,954 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81eb43454/1751152e99bb423b9b4573951bfb97c6/FLAG44888d4d3
[2021-12-17 22:21:35,330 INFO  L306              CDTParser]: Found 1 translation units.
[2021-12-17 22:21:35,331 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2021-12-17 22:21:35,347 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81eb43454/1751152e99bb423b9b4573951bfb97c6/FLAG44888d4d3
[2021-12-17 22:21:35,720 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81eb43454/1751152e99bb423b9b4573951bfb97c6
[2021-12-17 22:21:35,722 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-17 22:21:35,723 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-17 22:21:35,732 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-17 22:21:35,732 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-17 22:21:35,735 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-17 22:21:35,735 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:21:35" (1/1) ...
[2021-12-17 22:21:35,736 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49aad019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:35, skipping insertion in model container
[2021-12-17 22:21:35,736 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:21:35" (1/1) ...
[2021-12-17 22:21:35,741 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-12-17 22:21:35,777 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-12-17 22:21:35,941 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983]
[2021-12-17 22:21:36,127 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-17 22:21:36,133 INFO  L203         MainTranslator]: Completed pre-run
[2021-12-17 22:21:36,146 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983]
[2021-12-17 22:21:36,188 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-17 22:21:36,216 INFO  L208         MainTranslator]: Completed translation
[2021-12-17 22:21:36,216 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36 WrapperNode
[2021-12-17 22:21:36,217 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-17 22:21:36,217 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-12-17 22:21:36,218 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-12-17 22:21:36,218 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-12-17 22:21:36,223 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,252 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,275 INFO  L137                Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274
[2021-12-17 22:21:36,276 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-12-17 22:21:36,276 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-12-17 22:21:36,276 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-12-17 22:21:36,276 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-12-17 22:21:36,286 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,286 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,297 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,298 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,309 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,320 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,322 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,336 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-12-17 22:21:36,337 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-12-17 22:21:36,337 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-12-17 22:21:36,337 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-12-17 22:21:36,338 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (1/1) ...
[2021-12-17 22:21:36,350 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-17 22:21:36,359 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-17 22:21:36,405 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-12-17 22:21:36,421 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-12-17 22:21:36,451 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-12-17 22:21:36,451 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-12-17 22:21:36,451 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2021-12-17 22:21:36,451 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-12-17 22:21:36,452 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-12-17 22:21:36,452 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-12-17 22:21:36,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-12-17 22:21:36,452 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-12-17 22:21:36,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-12-17 22:21:36,452 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-12-17 22:21:36,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-12-17 22:21:36,452 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-12-17 22:21:36,452 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-12-17 22:21:36,452 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-12-17 22:21:36,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-12-17 22:21:36,454 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-12-17 22:21:36,663 INFO  L236             CfgBuilder]: Building ICFG
[2021-12-17 22:21:36,664 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2021-12-17 22:21:37,264 INFO  L277             CfgBuilder]: Performing block encoding
[2021-12-17 22:21:37,596 INFO  L296             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-12-17 22:21:37,597 INFO  L301             CfgBuilder]: Removed 0 assume(true) statements.
[2021-12-17 22:21:37,598 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:21:37 BoogieIcfgContainer
[2021-12-17 22:21:37,599 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-12-17 22:21:37,600 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-12-17 22:21:37,600 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-12-17 22:21:37,602 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-12-17 22:21:37,602 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:21:35" (1/3) ...
[2021-12-17 22:21:37,603 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118421d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:21:37, skipping insertion in model container
[2021-12-17 22:21:37,603 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:21:36" (2/3) ...
[2021-12-17 22:21:37,603 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118421d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:21:37, skipping insertion in model container
[2021-12-17 22:21:37,603 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:21:37" (3/3) ...
[2021-12-17 22:21:37,605 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i
[2021-12-17 22:21:37,608 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-12-17 22:21:37,609 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-12-17 22:21:37,609 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-12-17 22:21:37,609 INFO  L513   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-12-17 22:21:37,657 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,657 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,657 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,657 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,658 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,658 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,658 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,658 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,658 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,659 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,659 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,659 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,659 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,659 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,659 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,659 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,659 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,660 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,660 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,660 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,660 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,661 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,661 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,661 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,661 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,662 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,662 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,662 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,662 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,662 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,663 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,663 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,664 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,665 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,665 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,665 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,665 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,665 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,665 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,665 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,666 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,667 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,667 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,667 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,667 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,667 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,667 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,667 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,668 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,669 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,669 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,669 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,671 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,672 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,672 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,672 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,673 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,673 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,673 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,673 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,673 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,678 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,678 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,678 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,678 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,678 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,678 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,678 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,681 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,683 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,684 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,685 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,685 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,685 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,685 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,685 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,685 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,686 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,686 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,686 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,686 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,687 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,687 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,687 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,687 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,687 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,688 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,688 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,689 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,690 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,690 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,690 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,690 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,690 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,690 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,690 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,690 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,691 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,691 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,691 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,691 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,691 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,691 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,691 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,691 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,692 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,692 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,692 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,692 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,692 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,692 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,692 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,692 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,711 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,711 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,712 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,712 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,712 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,712 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,713 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,713 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,714 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,717 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,717 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,717 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,717 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,717 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,717 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,717 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,718 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,718 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,719 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,719 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,719 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,719 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,721 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,721 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,721 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,721 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,721 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,721 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,721 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,722 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,722 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,722 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,722 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,722 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,722 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,722 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,723 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,730 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,731 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,731 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,733 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,734 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,734 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,734 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,734 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,734 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,734 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,734 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,734 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,735 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,736 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,736 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,736 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,737 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,737 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,737 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,737 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,737 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,737 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,737 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,738 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,739 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,739 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,739 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,739 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,739 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,739 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,739 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,740 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,740 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,740 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,740 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,740 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,740 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,740 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,740 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,741 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,742 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,742 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,742 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,742 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,742 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,742 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,742 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,742 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,743 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,743 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,743 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,743 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,743 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,744 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,744 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,744 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,744 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,744 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,744 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,744 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,744 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,745 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,745 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,745 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,745 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-17 22:21:37,745 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-12-17 22:21:37,786 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-12-17 22:21:37,794 INFO  L339      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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR
[2021-12-17 22:21:37,794 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-12-17 22:21:37,805 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow
[2021-12-17 22:21:37,845 INFO  L129       PetriNetUnfolder]: 2/111 cut-off events.
[2021-12-17 22:21:37,845 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-17 22:21:37,848 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. 
[2021-12-17 22:21:37,848 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow
[2021-12-17 22:21:37,851 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow
[2021-12-17 22:21:37,856 INFO  L129       PetriNetUnfolder]: 0/46 cut-off events.
[2021-12-17 22:21:37,856 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-17 22:21:37,857 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:37,857 INFO  L254   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, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:37,858 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:37,861 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:37,861 INFO  L85        PathProgramCache]: Analyzing trace with hash 1877201928, now seen corresponding path program 1 times
[2021-12-17 22:21:37,867 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:37,867 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270472301]
[2021-12-17 22:21:37,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:37,868 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:37,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:38,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:38,067 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:38,067 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270472301]
[2021-12-17 22:21:38,068 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270472301] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:38,068 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:38,068 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-17 22:21:38,069 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772946279]
[2021-12-17 22:21:38,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:38,075 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-17 22:21:38,075 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:38,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-17 22:21:38,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-17 22:21:38,126 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114
[2021-12-17 22:21:38,129 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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)
[2021-12-17 22:21:38,129 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:38,129 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114
[2021-12-17 22:21:38,131 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:38,306 INFO  L129       PetriNetUnfolder]: 124/549 cut-off events.
[2021-12-17 22:21:38,307 INFO  L130       PetriNetUnfolder]: For 10/10 co-relation queries the response was YES.
[2021-12-17 22:21:38,309 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 780 conditions, 549 events. 124/549 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2968 event pairs, 24 based on Foata normal form. 23/541 useless extension candidates. Maximal degree in co-relation 729. Up to 155 conditions per place. 
[2021-12-17 22:21:38,312 INFO  L132   encePairwiseOnDemand]: 109/114 looper letters, 18 selfloop transitions, 2 changer transitions 0/115 dead transitions.
[2021-12-17 22:21:38,312 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 285 flow
[2021-12-17 22:21:38,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-12-17 22:21:38,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-12-17 22:21:38,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions.
[2021-12-17 22:21:38,322 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9327485380116959
[2021-12-17 22:21:38,323 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 319 transitions.
[2021-12-17 22:21:38,323 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions.
[2021-12-17 22:21:38,324 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:38,326 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions.
[2021-12-17 22:21:38,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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)
[2021-12-17 22:21:38,332 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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)
[2021-12-17 22:21:38,333 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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)
[2021-12-17 22:21:38,334 INFO  L186             Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 319 transitions.
[2021-12-17 22:21:38,335 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 285 flow
[2021-12-17 22:21:38,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-12-17 22:21:38,340 INFO  L242             Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow
[2021-12-17 22:21:38,341 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107}
[2021-12-17 22:21:38,344 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places.
[2021-12-17 22:21:38,344 INFO  L470      AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow
[2021-12-17 22:21:38,344 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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)
[2021-12-17 22:21:38,344 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:38,345 INFO  L254   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, 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]
[2021-12-17 22:21:38,345 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-12-17 22:21:38,345 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:38,345 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:38,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 185903545, now seen corresponding path program 1 times
[2021-12-17 22:21:38,346 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:38,346 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120401483]
[2021-12-17 22:21:38,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:38,346 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:38,405 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:38,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:38,494 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:38,494 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120401483]
[2021-12-17 22:21:38,494 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120401483] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:38,494 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:38,494 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-17 22:21:38,495 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998617673]
[2021-12-17 22:21:38,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:38,496 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-17 22:21:38,496 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:38,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-17 22:21:38,496 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-17 22:21:38,497 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114
[2021-12-17 22:21:38,498 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand  has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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)
[2021-12-17 22:21:38,498 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:38,498 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114
[2021-12-17 22:21:38,498 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:38,906 INFO  L129       PetriNetUnfolder]: 416/1213 cut-off events.
[2021-12-17 22:21:38,906 INFO  L130       PetriNetUnfolder]: For 83/83 co-relation queries the response was YES.
[2021-12-17 22:21:38,909 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1213 events. 416/1213 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8218 event pairs, 74 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1936. Up to 257 conditions per place. 
[2021-12-17 22:21:38,911 INFO  L132   encePairwiseOnDemand]: 108/114 looper letters, 19 selfloop transitions, 2 changer transitions 48/147 dead transitions.
[2021-12-17 22:21:38,911 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 147 transitions, 434 flow
[2021-12-17 22:21:38,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-17 22:21:38,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-17 22:21:38,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions.
[2021-12-17 22:21:38,916 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8654970760233918
[2021-12-17 22:21:38,916 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 888 transitions.
[2021-12-17 22:21:38,916 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions.
[2021-12-17 22:21:38,916 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:38,916 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions.
[2021-12-17 22:21:38,918 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 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)
[2021-12-17 22:21:38,920 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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)
[2021-12-17 22:21:38,921 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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)
[2021-12-17 22:21:38,921 INFO  L186             Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 888 transitions.
[2021-12-17 22:21:38,921 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 147 transitions, 434 flow
[2021-12-17 22:21:38,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 147 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-12-17 22:21:38,924 INFO  L242             Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow
[2021-12-17 22:21:38,924 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95}
[2021-12-17 22:21:38,924 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places.
[2021-12-17 22:21:38,925 INFO  L470      AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow
[2021-12-17 22:21:38,925 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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)
[2021-12-17 22:21:38,925 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:38,925 INFO  L254   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, 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]
[2021-12-17 22:21:38,925 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-12-17 22:21:38,925 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:38,926 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:38,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 1408729484, now seen corresponding path program 1 times
[2021-12-17 22:21:38,926 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:38,926 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825106814]
[2021-12-17 22:21:38,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:38,926 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:39,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:39,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:39,171 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:39,172 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825106814]
[2021-12-17 22:21:39,172 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825106814] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:39,172 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:39,172 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-17 22:21:39,172 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841768226]
[2021-12-17 22:21:39,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:39,173 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-17 22:21:39,173 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:39,173 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-17 22:21:39,173 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-17 22:21:39,174 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114
[2021-12-17 22:21:39,175 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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)
[2021-12-17 22:21:39,175 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:39,175 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114
[2021-12-17 22:21:39,175 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:39,488 INFO  L129       PetriNetUnfolder]: 525/1182 cut-off events.
[2021-12-17 22:21:39,488 INFO  L130       PetriNetUnfolder]: For 257/257 co-relation queries the response was YES.
[2021-12-17 22:21:39,491 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2350 conditions, 1182 events. 525/1182 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6737 event pairs, 264 based on Foata normal form. 24/1144 useless extension candidates. Maximal degree in co-relation 2292. Up to 540 conditions per place. 
[2021-12-17 22:21:39,495 INFO  L132   encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 37/141 dead transitions.
[2021-12-17 22:21:39,495 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 141 transitions, 463 flow
[2021-12-17 22:21:39,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-17 22:21:39,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-17 22:21:39,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions.
[2021-12-17 22:21:39,498 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.854775828460039
[2021-12-17 22:21:39,498 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 877 transitions.
[2021-12-17 22:21:39,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions.
[2021-12-17 22:21:39,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:39,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions.
[2021-12-17 22:21:39,500 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 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)
[2021-12-17 22:21:39,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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)
[2021-12-17 22:21:39,502 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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)
[2021-12-17 22:21:39,502 INFO  L186             Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 9 states and 877 transitions.
[2021-12-17 22:21:39,502 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 141 transitions, 463 flow
[2021-12-17 22:21:39,506 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 141 transitions, 429 flow, removed 14 selfloop flow, removed 8 redundant places.
[2021-12-17 22:21:39,508 INFO  L242             Difference]: Finished difference. Result has 118 places, 97 transitions, 243 flow
[2021-12-17 22:21:39,508 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=118, PETRI_TRANSITIONS=97}
[2021-12-17 22:21:39,509 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, -1 predicate places.
[2021-12-17 22:21:39,509 INFO  L470      AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 243 flow
[2021-12-17 22:21:39,509 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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)
[2021-12-17 22:21:39,509 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:39,509 INFO  L254   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, 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, 1, 1]
[2021-12-17 22:21:39,510 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-12-17 22:21:39,510 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:39,510 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:39,510 INFO  L85        PathProgramCache]: Analyzing trace with hash -930553965, now seen corresponding path program 1 times
[2021-12-17 22:21:39,511 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:39,511 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619055694]
[2021-12-17 22:21:39,511 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:39,511 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:39,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:39,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:39,706 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:39,707 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619055694]
[2021-12-17 22:21:39,707 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619055694] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:39,707 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:39,707 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-17 22:21:39,707 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029324608]
[2021-12-17 22:21:39,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:39,708 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-17 22:21:39,708 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:39,709 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-17 22:21:39,711 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2021-12-17 22:21:39,712 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114
[2021-12-17 22:21:39,723 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 243 flow. Second operand  has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 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)
[2021-12-17 22:21:39,723 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:39,723 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114
[2021-12-17 22:21:39,724 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:40,376 INFO  L129       PetriNetUnfolder]: 678/1514 cut-off events.
[2021-12-17 22:21:40,376 INFO  L130       PetriNetUnfolder]: For 947/956 co-relation queries the response was YES.
[2021-12-17 22:21:40,381 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 1514 events. 678/1514 cut-off events. For 947/956 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9262 event pairs, 128 based on Foata normal form. 31/1439 useless extension candidates. Maximal degree in co-relation 3281. Up to 468 conditions per place. 
[2021-12-17 22:21:40,385 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 27 selfloop transitions, 11 changer transitions 52/165 dead transitions.
[2021-12-17 22:21:40,385 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 165 transitions, 606 flow
[2021-12-17 22:21:40,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-12-17 22:21:40,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-12-17 22:21:40,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1485 transitions.
[2021-12-17 22:21:40,388 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8141447368421053
[2021-12-17 22:21:40,388 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1485 transitions.
[2021-12-17 22:21:40,388 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1485 transitions.
[2021-12-17 22:21:40,389 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:40,389 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1485 transitions.
[2021-12-17 22:21:40,391 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 92.8125) internal successors, (1485), 16 states have internal predecessors, (1485), 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)
[2021-12-17 22:21:40,393 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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)
[2021-12-17 22:21:40,393 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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)
[2021-12-17 22:21:40,393 INFO  L186             Difference]: Start difference. First operand has 118 places, 97 transitions, 243 flow. Second operand 16 states and 1485 transitions.
[2021-12-17 22:21:40,393 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 165 transitions, 606 flow
[2021-12-17 22:21:40,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 165 transitions, 585 flow, removed 9 selfloop flow, removed 4 redundant places.
[2021-12-17 22:21:40,399 INFO  L242             Difference]: Finished difference. Result has 135 places, 102 transitions, 355 flow
[2021-12-17 22:21:40,399 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=355, PETRI_PLACES=135, PETRI_TRANSITIONS=102}
[2021-12-17 22:21:40,399 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places.
[2021-12-17 22:21:40,400 INFO  L470      AbstractCegarLoop]: Abstraction has has 135 places, 102 transitions, 355 flow
[2021-12-17 22:21:40,400 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 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)
[2021-12-17 22:21:40,400 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:40,400 INFO  L254   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, 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, 1, 1, 1]
[2021-12-17 22:21:40,400 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-12-17 22:21:40,400 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:40,401 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:40,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -97161754, now seen corresponding path program 1 times
[2021-12-17 22:21:40,401 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:40,401 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674652365]
[2021-12-17 22:21:40,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:40,401 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:40,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:40,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:40,509 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:40,509 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674652365]
[2021-12-17 22:21:40,509 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674652365] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:40,509 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:40,509 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-17 22:21:40,509 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805203467]
[2021-12-17 22:21:40,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:40,510 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-17 22:21:40,510 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:40,510 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-17 22:21:40,510 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-17 22:21:40,511 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114
[2021-12-17 22:21:40,511 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 102 transitions, 355 flow. Second operand  has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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)
[2021-12-17 22:21:40,511 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:40,511 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114
[2021-12-17 22:21:40,511 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:40,911 INFO  L129       PetriNetUnfolder]: 723/1594 cut-off events.
[2021-12-17 22:21:40,911 INFO  L130       PetriNetUnfolder]: For 9721/9736 co-relation queries the response was YES.
[2021-12-17 22:21:40,916 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7125 conditions, 1594 events. 723/1594 cut-off events. For 9721/9736 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9710 event pairs, 224 based on Foata normal form. 31/1553 useless extension candidates. Maximal degree in co-relation 7050. Up to 545 conditions per place. 
[2021-12-17 22:21:40,923 INFO  L132   encePairwiseOnDemand]: 108/114 looper letters, 35 selfloop transitions, 3 changer transitions 28/144 dead transitions.
[2021-12-17 22:21:40,923 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 144 transitions, 846 flow
[2021-12-17 22:21:40,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-17 22:21:40,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-17 22:21:40,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions.
[2021-12-17 22:21:40,926 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8499025341130604
[2021-12-17 22:21:40,926 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 872 transitions.
[2021-12-17 22:21:40,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions.
[2021-12-17 22:21:40,926 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:40,926 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions.
[2021-12-17 22:21:40,927 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 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)
[2021-12-17 22:21:40,929 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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)
[2021-12-17 22:21:40,929 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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)
[2021-12-17 22:21:40,929 INFO  L186             Difference]: Start difference. First operand has 135 places, 102 transitions, 355 flow. Second operand 9 states and 872 transitions.
[2021-12-17 22:21:40,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 144 transitions, 846 flow
[2021-12-17 22:21:40,938 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 144 transitions, 809 flow, removed 14 selfloop flow, removed 6 redundant places.
[2021-12-17 22:21:40,939 INFO  L242             Difference]: Finished difference. Result has 135 places, 102 transitions, 363 flow
[2021-12-17 22:21:40,939 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=363, PETRI_PLACES=135, PETRI_TRANSITIONS=102}
[2021-12-17 22:21:40,940 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places.
[2021-12-17 22:21:40,940 INFO  L470      AbstractCegarLoop]: Abstraction has has 135 places, 102 transitions, 363 flow
[2021-12-17 22:21:40,940 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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)
[2021-12-17 22:21:40,940 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:40,940 INFO  L254   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, 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, 1, 1, 1]
[2021-12-17 22:21:40,940 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-12-17 22:21:40,941 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:40,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:40,941 INFO  L85        PathProgramCache]: Analyzing trace with hash 1570877810, now seen corresponding path program 1 times
[2021-12-17 22:21:40,941 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:40,941 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017076950]
[2021-12-17 22:21:40,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:40,941 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:40,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:41,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:41,312 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:41,312 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017076950]
[2021-12-17 22:21:41,312 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017076950] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:41,312 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:41,312 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-12-17 22:21:41,312 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977976706]
[2021-12-17 22:21:41,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:41,313 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-12-17 22:21:41,313 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:41,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-12-17 22:21:41,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182
[2021-12-17 22:21:41,314 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114
[2021-12-17 22:21:41,315 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 102 transitions, 363 flow. Second operand  has 14 states, 14 states have (on average 85.5) internal successors, (1197), 14 states have internal predecessors, (1197), 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)
[2021-12-17 22:21:41,315 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:41,315 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114
[2021-12-17 22:21:41,315 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:41,864 INFO  L129       PetriNetUnfolder]: 554/1277 cut-off events.
[2021-12-17 22:21:41,864 INFO  L130       PetriNetUnfolder]: For 8689/8711 co-relation queries the response was YES.
[2021-12-17 22:21:41,868 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5776 conditions, 1277 events. 554/1277 cut-off events. For 8689/8711 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7374 event pairs, 260 based on Foata normal form. 16/1200 useless extension candidates. Maximal degree in co-relation 5692. Up to 642 conditions per place. 
[2021-12-17 22:21:41,874 INFO  L132   encePairwiseOnDemand]: 100/114 looper letters, 38 selfloop transitions, 15 changer transitions 26/151 dead transitions.
[2021-12-17 22:21:41,874 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 151 transitions, 949 flow
[2021-12-17 22:21:41,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-12-17 22:21:41,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2021-12-17 22:21:41,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1337 transitions.
[2021-12-17 22:21:41,877 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7818713450292397
[2021-12-17 22:21:41,877 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1337 transitions.
[2021-12-17 22:21:41,877 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1337 transitions.
[2021-12-17 22:21:41,878 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:41,878 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1337 transitions.
[2021-12-17 22:21:41,880 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 89.13333333333334) internal successors, (1337), 15 states have internal predecessors, (1337), 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)
[2021-12-17 22:21:41,882 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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)
[2021-12-17 22:21:41,882 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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)
[2021-12-17 22:21:41,882 INFO  L186             Difference]: Start difference. First operand has 135 places, 102 transitions, 363 flow. Second operand 15 states and 1337 transitions.
[2021-12-17 22:21:41,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 151 transitions, 949 flow
[2021-12-17 22:21:41,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 151 transitions, 900 flow, removed 23 selfloop flow, removed 7 redundant places.
[2021-12-17 22:21:41,891 INFO  L242             Difference]: Finished difference. Result has 145 places, 109 transitions, 448 flow
[2021-12-17 22:21:41,891 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=448, PETRI_PLACES=145, PETRI_TRANSITIONS=109}
[2021-12-17 22:21:41,892 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 26 predicate places.
[2021-12-17 22:21:41,892 INFO  L470      AbstractCegarLoop]: Abstraction has has 145 places, 109 transitions, 448 flow
[2021-12-17 22:21:41,892 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 85.5) internal successors, (1197), 14 states have internal predecessors, (1197), 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)
[2021-12-17 22:21:41,892 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:41,892 INFO  L254   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, 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, 1, 1, 1]
[2021-12-17 22:21:41,893 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-12-17 22:21:41,893 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:41,893 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:41,893 INFO  L85        PathProgramCache]: Analyzing trace with hash -1356525356, now seen corresponding path program 2 times
[2021-12-17 22:21:41,893 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:41,893 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102648300]
[2021-12-17 22:21:41,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:41,893 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:41,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:42,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:42,044 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:42,044 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102648300]
[2021-12-17 22:21:42,044 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102648300] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:42,044 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:42,044 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-12-17 22:21:42,044 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644871575]
[2021-12-17 22:21:42,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:42,044 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2021-12-17 22:21:42,045 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:42,045 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-12-17 22:21:42,045 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2021-12-17 22:21:42,045 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114
[2021-12-17 22:21:42,046 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 109 transitions, 448 flow. Second operand  has 10 states, 10 states have (on average 88.8) internal successors, (888), 10 states have internal predecessors, (888), 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)
[2021-12-17 22:21:42,046 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:42,046 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114
[2021-12-17 22:21:42,046 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:42,553 INFO  L129       PetriNetUnfolder]: 550/1292 cut-off events.
[2021-12-17 22:21:42,553 INFO  L130       PetriNetUnfolder]: For 9701/10200 co-relation queries the response was YES.
[2021-12-17 22:21:42,558 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 1292 events. 550/1292 cut-off events. For 9701/10200 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7736 event pairs, 266 based on Foata normal form. 22/1210 useless extension candidates. Maximal degree in co-relation 6342. Up to 641 conditions per place. 
[2021-12-17 22:21:42,564 INFO  L132   encePairwiseOnDemand]: 102/114 looper letters, 40 selfloop transitions, 18 changer transitions 51/184 dead transitions.
[2021-12-17 22:21:42,564 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 184 transitions, 1464 flow
[2021-12-17 22:21:42,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2021-12-17 22:21:42,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2021-12-17 22:21:42,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1750 transitions.
[2021-12-17 22:21:42,567 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8079409048938134
[2021-12-17 22:21:42,567 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1750 transitions.
[2021-12-17 22:21:42,567 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1750 transitions.
[2021-12-17 22:21:42,568 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:42,568 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1750 transitions.
[2021-12-17 22:21:42,570 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 92.10526315789474) internal successors, (1750), 19 states have internal predecessors, (1750), 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)
[2021-12-17 22:21:42,573 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 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)
[2021-12-17 22:21:42,573 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 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)
[2021-12-17 22:21:42,573 INFO  L186             Difference]: Start difference. First operand has 145 places, 109 transitions, 448 flow. Second operand 19 states and 1750 transitions.
[2021-12-17 22:21:42,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 184 transitions, 1464 flow
[2021-12-17 22:21:42,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 184 transitions, 1386 flow, removed 28 selfloop flow, removed 11 redundant places.
[2021-12-17 22:21:42,582 INFO  L242             Difference]: Finished difference. Result has 161 places, 119 transitions, 661 flow
[2021-12-17 22:21:42,583 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=661, PETRI_PLACES=161, PETRI_TRANSITIONS=119}
[2021-12-17 22:21:42,583 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places.
[2021-12-17 22:21:42,583 INFO  L470      AbstractCegarLoop]: Abstraction has has 161 places, 119 transitions, 661 flow
[2021-12-17 22:21:42,584 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 88.8) internal successors, (888), 10 states have internal predecessors, (888), 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)
[2021-12-17 22:21:42,584 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:42,584 INFO  L254   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, 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, 1, 1, 1, 1]
[2021-12-17 22:21:42,584 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-12-17 22:21:42,584 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:42,584 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:42,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 1936737965, now seen corresponding path program 1 times
[2021-12-17 22:21:42,584 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:42,584 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068609328]
[2021-12-17 22:21:42,584 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:42,585 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:42,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:42,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:42,751 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:42,751 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068609328]
[2021-12-17 22:21:42,751 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068609328] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:42,751 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:42,751 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-17 22:21:42,751 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497905977]
[2021-12-17 22:21:42,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:42,752 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-17 22:21:42,752 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:42,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-17 22:21:42,752 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2021-12-17 22:21:42,753 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114
[2021-12-17 22:21:42,754 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 119 transitions, 661 flow. Second operand  has 11 states, 11 states have (on average 87.72727272727273) internal successors, (965), 11 states have internal predecessors, (965), 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)
[2021-12-17 22:21:42,754 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:42,754 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114
[2021-12-17 22:21:42,754 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:43,315 INFO  L129       PetriNetUnfolder]: 701/1715 cut-off events.
[2021-12-17 22:21:43,315 INFO  L130       PetriNetUnfolder]: For 34043/34395 co-relation queries the response was YES.
[2021-12-17 22:21:43,322 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 12088 conditions, 1715 events. 701/1715 cut-off events. For 34043/34395 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11612 event pairs, 165 based on Foata normal form. 41/1639 useless extension candidates. Maximal degree in co-relation 11990. Up to 613 conditions per place. 
[2021-12-17 22:21:43,332 INFO  L132   encePairwiseOnDemand]: 100/114 looper letters, 51 selfloop transitions, 12 changer transitions 36/173 dead transitions.
[2021-12-17 22:21:43,332 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 173 transitions, 1752 flow
[2021-12-17 22:21:43,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-17 22:21:43,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-17 22:21:43,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1278 transitions.
[2021-12-17 22:21:43,334 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8007518796992481
[2021-12-17 22:21:43,334 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1278 transitions.
[2021-12-17 22:21:43,335 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1278 transitions.
[2021-12-17 22:21:43,335 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:43,335 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1278 transitions.
[2021-12-17 22:21:43,337 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 91.28571428571429) internal successors, (1278), 14 states have internal predecessors, (1278), 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)
[2021-12-17 22:21:43,339 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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)
[2021-12-17 22:21:43,339 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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)
[2021-12-17 22:21:43,339 INFO  L186             Difference]: Start difference. First operand has 161 places, 119 transitions, 661 flow. Second operand 14 states and 1278 transitions.
[2021-12-17 22:21:43,339 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 173 transitions, 1752 flow
[2021-12-17 22:21:43,359 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 173 transitions, 1556 flow, removed 91 selfloop flow, removed 12 redundant places.
[2021-12-17 22:21:43,360 INFO  L242             Difference]: Finished difference. Result has 159 places, 124 transitions, 683 flow
[2021-12-17 22:21:43,361 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=683, PETRI_PLACES=159, PETRI_TRANSITIONS=124}
[2021-12-17 22:21:43,361 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places.
[2021-12-17 22:21:43,361 INFO  L470      AbstractCegarLoop]: Abstraction has has 159 places, 124 transitions, 683 flow
[2021-12-17 22:21:43,362 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 87.72727272727273) internal successors, (965), 11 states have internal predecessors, (965), 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)
[2021-12-17 22:21:43,362 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:43,362 INFO  L254   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, 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, 1, 1, 1, 1]
[2021-12-17 22:21:43,362 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-12-17 22:21:43,362 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:43,362 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:43,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -1477459403, now seen corresponding path program 2 times
[2021-12-17 22:21:43,362 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:43,363 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194280353]
[2021-12-17 22:21:43,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:43,363 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:43,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:43,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:43,513 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:43,513 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194280353]
[2021-12-17 22:21:43,513 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194280353] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:43,513 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:43,513 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-12-17 22:21:43,513 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163707987]
[2021-12-17 22:21:43,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:43,513 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-12-17 22:21:43,513 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:43,514 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-12-17 22:21:43,514 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2021-12-17 22:21:43,515 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 114
[2021-12-17 22:21:43,515 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 124 transitions, 683 flow. Second operand  has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 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)
[2021-12-17 22:21:43,515 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:43,515 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 114
[2021-12-17 22:21:43,515 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:44,007 INFO  L129       PetriNetUnfolder]: 552/1342 cut-off events.
[2021-12-17 22:21:44,008 INFO  L130       PetriNetUnfolder]: For 27877/29744 co-relation queries the response was YES.
[2021-12-17 22:21:44,013 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 9801 conditions, 1342 events. 552/1342 cut-off events. For 27877/29744 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8419 event pairs, 91 based on Foata normal form. 46/1319 useless extension candidates. Maximal degree in co-relation 9699. Up to 496 conditions per place. 
[2021-12-17 22:21:44,020 INFO  L132   encePairwiseOnDemand]: 101/114 looper letters, 47 selfloop transitions, 13 changer transitions 36/170 dead transitions.
[2021-12-17 22:21:44,020 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 170 transitions, 1775 flow
[2021-12-17 22:21:44,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-17 22:21:44,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-17 22:21:44,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1274 transitions.
[2021-12-17 22:21:44,023 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7982456140350878
[2021-12-17 22:21:44,023 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1274 transitions.
[2021-12-17 22:21:44,023 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1274 transitions.
[2021-12-17 22:21:44,024 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:44,024 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1274 transitions.
[2021-12-17 22:21:44,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 91.0) internal successors, (1274), 14 states have internal predecessors, (1274), 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)
[2021-12-17 22:21:44,028 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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)
[2021-12-17 22:21:44,028 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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)
[2021-12-17 22:21:44,028 INFO  L186             Difference]: Start difference. First operand has 159 places, 124 transitions, 683 flow. Second operand 14 states and 1274 transitions.
[2021-12-17 22:21:44,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 170 transitions, 1775 flow
[2021-12-17 22:21:44,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 170 transitions, 1545 flow, removed 106 selfloop flow, removed 11 redundant places.
[2021-12-17 22:21:44,045 INFO  L242             Difference]: Finished difference. Result has 163 places, 123 transitions, 681 flow
[2021-12-17 22:21:44,046 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=681, PETRI_PLACES=163, PETRI_TRANSITIONS=123}
[2021-12-17 22:21:44,046 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places.
[2021-12-17 22:21:44,046 INFO  L470      AbstractCegarLoop]: Abstraction has has 163 places, 123 transitions, 681 flow
[2021-12-17 22:21:44,047 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 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)
[2021-12-17 22:21:44,047 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:44,047 INFO  L254   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, 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, 1, 1, 1, 1]
[2021-12-17 22:21:44,047 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-12-17 22:21:44,047 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:44,047 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:44,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 1010530073, now seen corresponding path program 1 times
[2021-12-17 22:21:44,047 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:44,047 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710135407]
[2021-12-17 22:21:44,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:44,048 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:44,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:44,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:44,667 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:44,667 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710135407]
[2021-12-17 22:21:44,667 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710135407] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:44,669 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:44,669 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2021-12-17 22:21:44,669 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912824097]
[2021-12-17 22:21:44,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:44,670 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2021-12-17 22:21:44,670 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:44,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2021-12-17 22:21:44,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272
[2021-12-17 22:21:44,672 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114
[2021-12-17 22:21:44,673 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 123 transitions, 681 flow. Second operand  has 17 states, 17 states have (on average 83.41176470588235) internal successors, (1418), 17 states have internal predecessors, (1418), 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)
[2021-12-17 22:21:44,673 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:44,673 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114
[2021-12-17 22:21:44,673 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:45,279 INFO  L129       PetriNetUnfolder]: 383/971 cut-off events.
[2021-12-17 22:21:45,279 INFO  L130       PetriNetUnfolder]: For 17674/19340 co-relation queries the response was YES.
[2021-12-17 22:21:45,285 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6510 conditions, 971 events. 383/971 cut-off events. For 17674/19340 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5464 event pairs, 211 based on Foata normal form. 29/950 useless extension candidates. Maximal degree in co-relation 6400. Up to 500 conditions per place. 
[2021-12-17 22:21:45,307 INFO  L132   encePairwiseOnDemand]: 98/114 looper letters, 44 selfloop transitions, 22 changer transitions 25/161 dead transitions.
[2021-12-17 22:21:45,308 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 161 transitions, 1463 flow
[2021-12-17 22:21:45,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-12-17 22:21:45,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2021-12-17 22:21:45,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1544 transitions.
[2021-12-17 22:21:45,311 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7524366471734892
[2021-12-17 22:21:45,312 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1544 transitions.
[2021-12-17 22:21:45,312 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1544 transitions.
[2021-12-17 22:21:45,313 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:45,313 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1544 transitions.
[2021-12-17 22:21:45,317 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 85.77777777777777) internal successors, (1544), 18 states have internal predecessors, (1544), 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)
[2021-12-17 22:21:45,321 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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)
[2021-12-17 22:21:45,323 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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)
[2021-12-17 22:21:45,323 INFO  L186             Difference]: Start difference. First operand has 163 places, 123 transitions, 681 flow. Second operand 18 states and 1544 transitions.
[2021-12-17 22:21:45,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 161 transitions, 1463 flow
[2021-12-17 22:21:45,336 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 161 transitions, 1362 flow, removed 31 selfloop flow, removed 14 redundant places.
[2021-12-17 22:21:45,338 INFO  L242             Difference]: Finished difference. Result has 168 places, 126 transitions, 716 flow
[2021-12-17 22:21:45,339 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=716, PETRI_PLACES=168, PETRI_TRANSITIONS=126}
[2021-12-17 22:21:45,342 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 49 predicate places.
[2021-12-17 22:21:45,342 INFO  L470      AbstractCegarLoop]: Abstraction has has 168 places, 126 transitions, 716 flow
[2021-12-17 22:21:45,342 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 83.41176470588235) internal successors, (1418), 17 states have internal predecessors, (1418), 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)
[2021-12-17 22:21:45,342 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:45,343 INFO  L254   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, 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, 1, 1, 1, 1, 1]
[2021-12-17 22:21:45,343 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-12-17 22:21:45,343 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:45,343 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:45,343 INFO  L85        PathProgramCache]: Analyzing trace with hash -1701454670, now seen corresponding path program 1 times
[2021-12-17 22:21:45,343 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:45,344 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839283269]
[2021-12-17 22:21:45,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:45,344 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:45,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:45,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:45,637 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:45,638 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839283269]
[2021-12-17 22:21:45,638 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839283269] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:45,638 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:45,638 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-17 22:21:45,638 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062214902]
[2021-12-17 22:21:45,638 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:45,638 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-17 22:21:45,639 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:45,639 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-17 22:21:45,639 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2021-12-17 22:21:45,640 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-17 22:21:45,641 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 126 transitions, 716 flow. Second operand  has 13 states, 13 states have (on average 86.61538461538461) internal successors, (1126), 13 states have internal predecessors, (1126), 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)
[2021-12-17 22:21:45,641 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:45,641 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-17 22:21:45,641 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:46,216 INFO  L129       PetriNetUnfolder]: 463/1186 cut-off events.
[2021-12-17 22:21:46,216 INFO  L130       PetriNetUnfolder]: For 17939/18518 co-relation queries the response was YES.
[2021-12-17 22:21:46,222 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 7551 conditions, 1186 events. 463/1186 cut-off events. For 17939/18518 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7148 event pairs, 150 based on Foata normal form. 26/1119 useless extension candidates. Maximal degree in co-relation 7441. Up to 463 conditions per place. 
[2021-12-17 22:21:46,228 INFO  L132   encePairwiseOnDemand]: 103/114 looper letters, 51 selfloop transitions, 18 changer transitions 25/167 dead transitions.
[2021-12-17 22:21:46,228 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 1569 flow
[2021-12-17 22:21:46,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-12-17 22:21:46,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-12-17 22:21:46,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1175 transitions.
[2021-12-17 22:21:46,231 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7928475033738192
[2021-12-17 22:21:46,231 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1175 transitions.
[2021-12-17 22:21:46,231 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1175 transitions.
[2021-12-17 22:21:46,231 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:46,231 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1175 transitions.
[2021-12-17 22:21:46,233 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 90.38461538461539) internal successors, (1175), 13 states have internal predecessors, (1175), 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)
[2021-12-17 22:21:46,234 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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)
[2021-12-17 22:21:46,235 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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)
[2021-12-17 22:21:46,235 INFO  L186             Difference]: Start difference. First operand has 168 places, 126 transitions, 716 flow. Second operand 13 states and 1175 transitions.
[2021-12-17 22:21:46,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 1569 flow
[2021-12-17 22:21:46,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 167 transitions, 1489 flow, removed 24 selfloop flow, removed 15 redundant places.
[2021-12-17 22:21:46,280 INFO  L242             Difference]: Finished difference. Result has 166 places, 128 transitions, 771 flow
[2021-12-17 22:21:46,281 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=771, PETRI_PLACES=166, PETRI_TRANSITIONS=128}
[2021-12-17 22:21:46,281 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 47 predicate places.
[2021-12-17 22:21:46,281 INFO  L470      AbstractCegarLoop]: Abstraction has has 166 places, 128 transitions, 771 flow
[2021-12-17 22:21:46,282 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 86.61538461538461) internal successors, (1126), 13 states have internal predecessors, (1126), 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)
[2021-12-17 22:21:46,282 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:46,282 INFO  L254   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, 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, 1, 1, 1, 1, 1]
[2021-12-17 22:21:46,282 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-12-17 22:21:46,282 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:46,282 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:46,282 INFO  L85        PathProgramCache]: Analyzing trace with hash 2132111704, now seen corresponding path program 2 times
[2021-12-17 22:21:46,282 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:46,282 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845228227]
[2021-12-17 22:21:46,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:46,283 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:46,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:46,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:46,470 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:46,470 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845228227]
[2021-12-17 22:21:46,470 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845228227] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:46,470 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:46,470 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-17 22:21:46,470 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350188590]
[2021-12-17 22:21:46,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:46,470 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-17 22:21:46,470 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:46,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-17 22:21:46,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2021-12-17 22:21:46,471 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-17 22:21:46,472 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 128 transitions, 771 flow. Second operand  has 11 states, 11 states have (on average 86.9090909090909) internal successors, (956), 11 states have internal predecessors, (956), 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)
[2021-12-17 22:21:46,472 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:46,472 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-17 22:21:46,472 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:47,010 INFO  L129       PetriNetUnfolder]: 464/1257 cut-off events.
[2021-12-17 22:21:47,010 INFO  L130       PetriNetUnfolder]: For 24134/27256 co-relation queries the response was YES.
[2021-12-17 22:21:47,017 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 8621 conditions, 1257 events. 464/1257 cut-off events. For 24134/27256 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8274 event pairs, 74 based on Foata normal form. 42/1221 useless extension candidates. Maximal degree in co-relation 8516. Up to 471 conditions per place. 
[2021-12-17 22:21:47,022 INFO  L132   encePairwiseOnDemand]: 101/114 looper letters, 48 selfloop transitions, 26 changer transitions 34/181 dead transitions.
[2021-12-17 22:21:47,022 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 181 transitions, 2105 flow
[2021-12-17 22:21:47,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-12-17 22:21:47,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-12-17 22:21:47,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1180 transitions.
[2021-12-17 22:21:47,024 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.796221322537112
[2021-12-17 22:21:47,024 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1180 transitions.
[2021-12-17 22:21:47,024 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1180 transitions.
[2021-12-17 22:21:47,024 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:47,024 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1180 transitions.
[2021-12-17 22:21:47,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 90.76923076923077) internal successors, (1180), 13 states have internal predecessors, (1180), 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)
[2021-12-17 22:21:47,028 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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)
[2021-12-17 22:21:47,028 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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)
[2021-12-17 22:21:47,028 INFO  L186             Difference]: Start difference. First operand has 166 places, 128 transitions, 771 flow. Second operand 13 states and 1180 transitions.
[2021-12-17 22:21:47,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 181 transitions, 2105 flow
[2021-12-17 22:21:47,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 181 transitions, 1941 flow, removed 74 selfloop flow, removed 10 redundant places.
[2021-12-17 22:21:47,071 INFO  L242             Difference]: Finished difference. Result has 170 places, 140 transitions, 1079 flow
[2021-12-17 22:21:47,072 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1079, PETRI_PLACES=170, PETRI_TRANSITIONS=140}
[2021-12-17 22:21:47,072 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 51 predicate places.
[2021-12-17 22:21:47,072 INFO  L470      AbstractCegarLoop]: Abstraction has has 170 places, 140 transitions, 1079 flow
[2021-12-17 22:21:47,073 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 86.9090909090909) internal successors, (956), 11 states have internal predecessors, (956), 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)
[2021-12-17 22:21:47,073 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:47,073 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:47,073 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-12-17 22:21:47,073 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:47,074 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:47,074 INFO  L85        PathProgramCache]: Analyzing trace with hash -1905450348, now seen corresponding path program 1 times
[2021-12-17 22:21:47,074 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:47,074 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764797246]
[2021-12-17 22:21:47,074 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:47,074 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:47,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:47,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:47,346 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:47,346 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764797246]
[2021-12-17 22:21:47,346 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764797246] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:47,346 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:47,346 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-12-17 22:21:47,346 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998906629]
[2021-12-17 22:21:47,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:47,346 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-12-17 22:21:47,346 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:47,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-12-17 22:21:47,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2021-12-17 22:21:47,347 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114
[2021-12-17 22:21:47,348 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 140 transitions, 1079 flow. Second operand  has 15 states, 15 states have (on average 84.6) internal successors, (1269), 15 states have internal predecessors, (1269), 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)
[2021-12-17 22:21:47,348 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:47,348 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114
[2021-12-17 22:21:47,348 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:48,094 INFO  L129       PetriNetUnfolder]: 446/1376 cut-off events.
[2021-12-17 22:21:48,094 INFO  L130       PetriNetUnfolder]: For 26011/30569 co-relation queries the response was YES.
[2021-12-17 22:21:48,100 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 1376 events. 446/1376 cut-off events. For 26011/30569 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10330 event pairs, 89 based on Foata normal form. 41/1332 useless extension candidates. Maximal degree in co-relation 9241. Up to 393 conditions per place. 
[2021-12-17 22:21:48,103 INFO  L132   encePairwiseOnDemand]: 102/114 looper letters, 49 selfloop transitions, 18 changer transitions 60/198 dead transitions.
[2021-12-17 22:21:48,104 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 198 transitions, 2645 flow
[2021-12-17 22:21:48,104 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-12-17 22:21:48,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2021-12-17 22:21:48,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1581 transitions.
[2021-12-17 22:21:48,106 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.77046783625731
[2021-12-17 22:21:48,106 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1581 transitions.
[2021-12-17 22:21:48,106 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1581 transitions.
[2021-12-17 22:21:48,107 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:48,107 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1581 transitions.
[2021-12-17 22:21:48,109 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 87.83333333333333) internal successors, (1581), 18 states have internal predecessors, (1581), 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)
[2021-12-17 22:21:48,110 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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)
[2021-12-17 22:21:48,111 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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)
[2021-12-17 22:21:48,111 INFO  L186             Difference]: Start difference. First operand has 170 places, 140 transitions, 1079 flow. Second operand 18 states and 1581 transitions.
[2021-12-17 22:21:48,111 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 198 transitions, 2645 flow
[2021-12-17 22:21:48,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 198 transitions, 2188 flow, removed 212 selfloop flow, removed 11 redundant places.
[2021-12-17 22:21:48,151 INFO  L242             Difference]: Finished difference. Result has 182 places, 130 transitions, 849 flow
[2021-12-17 22:21:48,151 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=849, PETRI_PLACES=182, PETRI_TRANSITIONS=130}
[2021-12-17 22:21:48,152 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 63 predicate places.
[2021-12-17 22:21:48,152 INFO  L470      AbstractCegarLoop]: Abstraction has has 182 places, 130 transitions, 849 flow
[2021-12-17 22:21:48,152 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 84.6) internal successors, (1269), 15 states have internal predecessors, (1269), 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)
[2021-12-17 22:21:48,152 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:48,152 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:48,153 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-12-17 22:21:48,153 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:48,153 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:48,153 INFO  L85        PathProgramCache]: Analyzing trace with hash -382634995, now seen corresponding path program 1 times
[2021-12-17 22:21:48,153 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:48,153 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862042598]
[2021-12-17 22:21:48,154 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:48,154 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:48,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:48,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:48,370 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:48,370 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862042598]
[2021-12-17 22:21:48,370 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862042598] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:48,370 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:48,370 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-12-17 22:21:48,370 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238223453]
[2021-12-17 22:21:48,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:48,371 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2021-12-17 22:21:48,371 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:48,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-12-17 22:21:48,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156
[2021-12-17 22:21:48,372 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-17 22:21:48,373 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 130 transitions, 849 flow. Second operand  has 13 states, 13 states have (on average 86.6923076923077) internal successors, (1127), 13 states have internal predecessors, (1127), 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)
[2021-12-17 22:21:48,373 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:48,373 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-17 22:21:48,373 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:48,943 INFO  L129       PetriNetUnfolder]: 270/890 cut-off events.
[2021-12-17 22:21:48,943 INFO  L130       PetriNetUnfolder]: For 20446/22127 co-relation queries the response was YES.
[2021-12-17 22:21:48,947 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5768 conditions, 890 events. 270/890 cut-off events. For 20446/22127 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5756 event pairs, 74 based on Foata normal form. 24/860 useless extension candidates. Maximal degree in co-relation 5656. Up to 377 conditions per place. 
[2021-12-17 22:21:48,951 INFO  L132   encePairwiseOnDemand]: 101/114 looper letters, 48 selfloop transitions, 37 changer transitions 32/190 dead transitions.
[2021-12-17 22:21:48,951 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 190 transitions, 2233 flow
[2021-12-17 22:21:48,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-12-17 22:21:48,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2021-12-17 22:21:48,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1607 transitions.
[2021-12-17 22:21:48,954 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7831384015594542
[2021-12-17 22:21:48,954 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1607 transitions.
[2021-12-17 22:21:48,954 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1607 transitions.
[2021-12-17 22:21:48,955 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:48,955 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1607 transitions.
[2021-12-17 22:21:48,957 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 89.27777777777777) internal successors, (1607), 18 states have internal predecessors, (1607), 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)
[2021-12-17 22:21:48,959 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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)
[2021-12-17 22:21:48,959 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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)
[2021-12-17 22:21:48,959 INFO  L186             Difference]: Start difference. First operand has 182 places, 130 transitions, 849 flow. Second operand 18 states and 1607 transitions.
[2021-12-17 22:21:48,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 190 transitions, 2233 flow
[2021-12-17 22:21:48,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 190 transitions, 1770 flow, removed 209 selfloop flow, removed 20 redundant places.
[2021-12-17 22:21:48,981 INFO  L242             Difference]: Finished difference. Result has 183 places, 148 transitions, 1143 flow
[2021-12-17 22:21:48,982 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1143, PETRI_PLACES=183, PETRI_TRANSITIONS=148}
[2021-12-17 22:21:48,982 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 64 predicate places.
[2021-12-17 22:21:48,982 INFO  L470      AbstractCegarLoop]: Abstraction has has 183 places, 148 transitions, 1143 flow
[2021-12-17 22:21:48,983 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 86.6923076923077) internal successors, (1127), 13 states have internal predecessors, (1127), 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)
[2021-12-17 22:21:48,983 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:48,983 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:48,983 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-12-17 22:21:48,983 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:48,984 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:48,984 INFO  L85        PathProgramCache]: Analyzing trace with hash -558585681, now seen corresponding path program 2 times
[2021-12-17 22:21:48,984 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:48,984 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969841076]
[2021-12-17 22:21:48,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:48,984 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:49,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:49,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:49,352 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:49,352 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969841076]
[2021-12-17 22:21:49,352 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969841076] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:49,352 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:49,352 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-12-17 22:21:49,352 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248496677]
[2021-12-17 22:21:49,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:49,353 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-12-17 22:21:49,353 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:49,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-12-17 22:21:49,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2021-12-17 22:21:49,354 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114
[2021-12-17 22:21:49,355 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 148 transitions, 1143 flow. Second operand  has 16 states, 16 states have (on average 84.5) internal successors, (1352), 16 states have internal predecessors, (1352), 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)
[2021-12-17 22:21:49,356 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:49,356 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114
[2021-12-17 22:21:49,356 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:49,830 INFO  L129       PetriNetUnfolder]: 248/895 cut-off events.
[2021-12-17 22:21:49,830 INFO  L130       PetriNetUnfolder]: For 15187/17867 co-relation queries the response was YES.
[2021-12-17 22:21:49,834 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 895 events. 248/895 cut-off events. For 15187/17867 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5801 event pairs, 68 based on Foata normal form. 25/847 useless extension candidates. Maximal degree in co-relation 5038. Up to 382 conditions per place. 
[2021-12-17 22:21:49,838 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 63 selfloop transitions, 32 changer transitions 23/189 dead transitions.
[2021-12-17 22:21:49,838 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 189 transitions, 2171 flow
[2021-12-17 22:21:49,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-12-17 22:21:49,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-12-17 22:21:49,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1395 transitions.
[2021-12-17 22:21:49,840 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7648026315789473
[2021-12-17 22:21:49,840 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1395 transitions.
[2021-12-17 22:21:49,840 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1395 transitions.
[2021-12-17 22:21:49,840 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:49,841 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1395 transitions.
[2021-12-17 22:21:49,842 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 87.1875) internal successors, (1395), 16 states have internal predecessors, (1395), 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)
[2021-12-17 22:21:49,844 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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)
[2021-12-17 22:21:49,844 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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)
[2021-12-17 22:21:49,844 INFO  L186             Difference]: Start difference. First operand has 183 places, 148 transitions, 1143 flow. Second operand 16 states and 1395 transitions.
[2021-12-17 22:21:49,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 189 transitions, 2171 flow
[2021-12-17 22:21:49,865 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 189 transitions, 1944 flow, removed 111 selfloop flow, removed 12 redundant places.
[2021-12-17 22:21:49,867 INFO  L242             Difference]: Finished difference. Result has 185 places, 157 transitions, 1291 flow
[2021-12-17 22:21:49,867 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1291, PETRI_PLACES=185, PETRI_TRANSITIONS=157}
[2021-12-17 22:21:49,868 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 66 predicate places.
[2021-12-17 22:21:49,868 INFO  L470      AbstractCegarLoop]: Abstraction has has 185 places, 157 transitions, 1291 flow
[2021-12-17 22:21:49,868 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 84.5) internal successors, (1352), 16 states have internal predecessors, (1352), 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)
[2021-12-17 22:21:49,868 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:49,868 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:49,869 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-12-17 22:21:49,869 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:49,869 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:49,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 1977507928, now seen corresponding path program 2 times
[2021-12-17 22:21:49,869 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:49,869 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868512801]
[2021-12-17 22:21:49,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:49,870 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:49,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:50,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:50,130 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:50,130 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868512801]
[2021-12-17 22:21:50,130 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868512801] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:50,130 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:50,130 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-12-17 22:21:50,130 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229688658]
[2021-12-17 22:21:50,130 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:50,130 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-12-17 22:21:50,131 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:50,131 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-12-17 22:21:50,131 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2021-12-17 22:21:50,132 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-17 22:21:50,132 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 157 transitions, 1291 flow. Second operand  has 15 states, 15 states have (on average 86.46666666666667) internal successors, (1297), 15 states have internal predecessors, (1297), 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)
[2021-12-17 22:21:50,132 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:50,132 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-17 22:21:50,132 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:50,600 INFO  L129       PetriNetUnfolder]: 263/942 cut-off events.
[2021-12-17 22:21:50,601 INFO  L130       PetriNetUnfolder]: For 15313/17314 co-relation queries the response was YES.
[2021-12-17 22:21:50,605 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5466 conditions, 942 events. 263/942 cut-off events. For 15313/17314 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6308 event pairs, 70 based on Foata normal form. 34/903 useless extension candidates. Maximal degree in co-relation 5353. Up to 386 conditions per place. 
[2021-12-17 22:21:50,609 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 70 selfloop transitions, 36 changer transitions 29/208 dead transitions.
[2021-12-17 22:21:50,609 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 208 transitions, 2454 flow
[2021-12-17 22:21:50,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-12-17 22:21:50,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-12-17 22:21:50,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1431 transitions.
[2021-12-17 22:21:50,611 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7845394736842105
[2021-12-17 22:21:50,611 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1431 transitions.
[2021-12-17 22:21:50,611 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1431 transitions.
[2021-12-17 22:21:50,612 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:50,612 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1431 transitions.
[2021-12-17 22:21:50,613 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 89.4375) internal successors, (1431), 16 states have internal predecessors, (1431), 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)
[2021-12-17 22:21:50,615 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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)
[2021-12-17 22:21:50,615 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 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)
[2021-12-17 22:21:50,616 INFO  L186             Difference]: Start difference. First operand has 185 places, 157 transitions, 1291 flow. Second operand 16 states and 1431 transitions.
[2021-12-17 22:21:50,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 208 transitions, 2454 flow
[2021-12-17 22:21:50,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 208 transitions, 2267 flow, removed 90 selfloop flow, removed 10 redundant places.
[2021-12-17 22:21:50,641 INFO  L242             Difference]: Finished difference. Result has 193 places, 169 transitions, 1504 flow
[2021-12-17 22:21:50,641 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1504, PETRI_PLACES=193, PETRI_TRANSITIONS=169}
[2021-12-17 22:21:50,642 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 74 predicate places.
[2021-12-17 22:21:50,642 INFO  L470      AbstractCegarLoop]: Abstraction has has 193 places, 169 transitions, 1504 flow
[2021-12-17 22:21:50,642 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 86.46666666666667) internal successors, (1297), 15 states have internal predecessors, (1297), 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)
[2021-12-17 22:21:50,642 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:50,642 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:50,643 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-12-17 22:21:50,643 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:50,643 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:50,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 608573432, now seen corresponding path program 3 times
[2021-12-17 22:21:50,643 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:50,644 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093136791]
[2021-12-17 22:21:50,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:50,644 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:50,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:50,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:50,868 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:50,868 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093136791]
[2021-12-17 22:21:50,868 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093136791] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:50,868 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:50,868 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-12-17 22:21:50,868 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119190821]
[2021-12-17 22:21:50,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:50,869 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-12-17 22:21:50,869 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:50,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-12-17 22:21:50,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2021-12-17 22:21:50,870 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114
[2021-12-17 22:21:50,870 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 169 transitions, 1504 flow. Second operand  has 15 states, 15 states have (on average 84.6) internal successors, (1269), 15 states have internal predecessors, (1269), 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)
[2021-12-17 22:21:50,870 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:50,870 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114
[2021-12-17 22:21:50,870 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:51,363 INFO  L129       PetriNetUnfolder]: 231/877 cut-off events.
[2021-12-17 22:21:51,364 INFO  L130       PetriNetUnfolder]: For 15431/17300 co-relation queries the response was YES.
[2021-12-17 22:21:51,368 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5165 conditions, 877 events. 231/877 cut-off events. For 15431/17300 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5683 event pairs, 43 based on Foata normal form. 35/845 useless extension candidates. Maximal degree in co-relation 5046. Up to 322 conditions per place. 
[2021-12-17 22:21:51,371 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 69 selfloop transitions, 27 changer transitions 34/201 dead transitions.
[2021-12-17 22:21:51,372 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 201 transitions, 2431 flow
[2021-12-17 22:21:51,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-12-17 22:21:51,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2021-12-17 22:21:51,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1312 transitions.
[2021-12-17 22:21:51,373 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7672514619883041
[2021-12-17 22:21:51,374 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1312 transitions.
[2021-12-17 22:21:51,374 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1312 transitions.
[2021-12-17 22:21:51,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:51,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1312 transitions.
[2021-12-17 22:21:51,376 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 87.46666666666667) internal successors, (1312), 15 states have internal predecessors, (1312), 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)
[2021-12-17 22:21:51,377 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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)
[2021-12-17 22:21:51,378 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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)
[2021-12-17 22:21:51,378 INFO  L186             Difference]: Start difference. First operand has 193 places, 169 transitions, 1504 flow. Second operand 15 states and 1312 transitions.
[2021-12-17 22:21:51,378 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 201 transitions, 2431 flow
[2021-12-17 22:21:51,430 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 201 transitions, 2259 flow, removed 75 selfloop flow, removed 10 redundant places.
[2021-12-17 22:21:51,432 INFO  L242             Difference]: Finished difference. Result has 199 places, 161 transitions, 1429 flow
[2021-12-17 22:21:51,433 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1429, PETRI_PLACES=199, PETRI_TRANSITIONS=161}
[2021-12-17 22:21:51,433 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 80 predicate places.
[2021-12-17 22:21:51,434 INFO  L470      AbstractCegarLoop]: Abstraction has has 199 places, 161 transitions, 1429 flow
[2021-12-17 22:21:51,434 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 84.6) internal successors, (1269), 15 states have internal predecessors, (1269), 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)
[2021-12-17 22:21:51,434 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:51,434 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:51,434 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-12-17 22:21:51,435 INFO  L402      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:51,435 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:51,435 INFO  L85        PathProgramCache]: Analyzing trace with hash -201509573, now seen corresponding path program 3 times
[2021-12-17 22:21:51,435 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:51,435 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79479227]
[2021-12-17 22:21:51,436 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:51,436 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:51,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:51,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:51,896 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:51,896 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79479227]
[2021-12-17 22:21:51,896 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79479227] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:51,896 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:51,896 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2021-12-17 22:21:51,896 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077109365]
[2021-12-17 22:21:51,896 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:51,896 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2021-12-17 22:21:51,896 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:51,897 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2021-12-17 22:21:51,897 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272
[2021-12-17 22:21:51,897 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114
[2021-12-17 22:21:51,898 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 161 transitions, 1429 flow. Second operand  has 17 states, 17 states have (on average 84.41176470588235) internal successors, (1435), 17 states have internal predecessors, (1435), 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)
[2021-12-17 22:21:51,898 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:51,898 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114
[2021-12-17 22:21:51,898 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:52,497 INFO  L129       PetriNetUnfolder]: 181/762 cut-off events.
[2021-12-17 22:21:52,498 INFO  L130       PetriNetUnfolder]: For 13304/15209 co-relation queries the response was YES.
[2021-12-17 22:21:52,501 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 4375 conditions, 762 events. 181/762 cut-off events. For 13304/15209 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5043 event pairs, 49 based on Foata normal form. 40/742 useless extension candidates. Maximal degree in co-relation 4253. Up to 290 conditions per place. 
[2021-12-17 22:21:52,504 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 62 selfloop transitions, 26 changer transitions 30/189 dead transitions.
[2021-12-17 22:21:52,504 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 189 transitions, 2279 flow
[2021-12-17 22:21:52,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-12-17 22:21:52,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2021-12-17 22:21:52,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1477 transitions.
[2021-12-17 22:21:52,506 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.762125902992776
[2021-12-17 22:21:52,506 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1477 transitions.
[2021-12-17 22:21:52,506 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1477 transitions.
[2021-12-17 22:21:52,507 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:52,507 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1477 transitions.
[2021-12-17 22:21:52,508 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 86.88235294117646) internal successors, (1477), 17 states have internal predecessors, (1477), 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)
[2021-12-17 22:21:52,510 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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)
[2021-12-17 22:21:52,510 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 114.0) internal successors, (2052), 18 states have internal predecessors, (2052), 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)
[2021-12-17 22:21:52,510 INFO  L186             Difference]: Start difference. First operand has 199 places, 161 transitions, 1429 flow. Second operand 17 states and 1477 transitions.
[2021-12-17 22:21:52,511 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 189 transitions, 2279 flow
[2021-12-17 22:21:52,534 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 189 transitions, 2069 flow, removed 81 selfloop flow, removed 14 redundant places.
[2021-12-17 22:21:52,536 INFO  L242             Difference]: Finished difference. Result has 203 places, 154 transitions, 1341 flow
[2021-12-17 22:21:52,536 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1341, PETRI_PLACES=203, PETRI_TRANSITIONS=154}
[2021-12-17 22:21:52,537 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 84 predicate places.
[2021-12-17 22:21:52,537 INFO  L470      AbstractCegarLoop]: Abstraction has has 203 places, 154 transitions, 1341 flow
[2021-12-17 22:21:52,537 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 84.41176470588235) internal successors, (1435), 17 states have internal predecessors, (1435), 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)
[2021-12-17 22:21:52,537 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:52,538 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:52,538 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-12-17 22:21:52,538 INFO  L402      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:52,538 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:52,538 INFO  L85        PathProgramCache]: Analyzing trace with hash 1486804359, now seen corresponding path program 1 times
[2021-12-17 22:21:52,538 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:52,538 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431588417]
[2021-12-17 22:21:52,539 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:52,539 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:52,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:52,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:52,608 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:52,608 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431588417]
[2021-12-17 22:21:52,608 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431588417] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:52,608 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:52,608 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-17 22:21:52,608 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657672512]
[2021-12-17 22:21:52,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:52,609 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-17 22:21:52,609 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:52,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-17 22:21:52,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-17 22:21:52,610 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-17 22:21:52,610 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 154 transitions, 1341 flow. Second operand  has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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)
[2021-12-17 22:21:52,610 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:52,610 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-17 22:21:52,610 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:53,407 INFO  L129       PetriNetUnfolder]: 2163/4423 cut-off events.
[2021-12-17 22:21:53,407 INFO  L130       PetriNetUnfolder]: For 72664/72799 co-relation queries the response was YES.
[2021-12-17 22:21:53,424 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 21096 conditions, 4423 events. 2163/4423 cut-off events. For 72664/72799 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 33249 event pairs, 73 based on Foata normal form. 38/4362 useless extension candidates. Maximal degree in co-relation 20979. Up to 1310 conditions per place. 
[2021-12-17 22:21:53,431 INFO  L132   encePairwiseOnDemand]: 104/114 looper letters, 80 selfloop transitions, 6 changer transitions 133/295 dead transitions.
[2021-12-17 22:21:53,431 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 295 transitions, 3701 flow
[2021-12-17 22:21:53,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-17 22:21:53,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-17 22:21:53,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions.
[2021-12-17 22:21:53,433 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8570175438596491
[2021-12-17 22:21:53,433 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 977 transitions.
[2021-12-17 22:21:53,433 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 977 transitions.
[2021-12-17 22:21:53,434 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:53,434 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 977 transitions.
[2021-12-17 22:21:53,435 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 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)
[2021-12-17 22:21:53,436 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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)
[2021-12-17 22:21:53,436 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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)
[2021-12-17 22:21:53,436 INFO  L186             Difference]: Start difference. First operand has 203 places, 154 transitions, 1341 flow. Second operand 10 states and 977 transitions.
[2021-12-17 22:21:53,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 295 transitions, 3701 flow
[2021-12-17 22:21:53,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 295 transitions, 3206 flow, removed 102 selfloop flow, removed 36 redundant places.
[2021-12-17 22:21:53,478 INFO  L242             Difference]: Finished difference. Result has 173 places, 128 transitions, 796 flow
[2021-12-17 22:21:53,478 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=796, PETRI_PLACES=173, PETRI_TRANSITIONS=128}
[2021-12-17 22:21:53,478 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 54 predicate places.
[2021-12-17 22:21:53,478 INFO  L470      AbstractCegarLoop]: Abstraction has has 173 places, 128 transitions, 796 flow
[2021-12-17 22:21:53,479 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 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)
[2021-12-17 22:21:53,479 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:53,479 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:53,479 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-12-17 22:21:53,479 INFO  L402      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:53,479 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:53,479 INFO  L85        PathProgramCache]: Analyzing trace with hash 121697737, now seen corresponding path program 1 times
[2021-12-17 22:21:53,480 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:53,480 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237804513]
[2021-12-17 22:21:53,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:53,480 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:53,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:53,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:53,563 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:53,564 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237804513]
[2021-12-17 22:21:53,564 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237804513] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:53,564 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:53,564 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-17 22:21:53,564 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715900382]
[2021-12-17 22:21:53,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:53,565 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-17 22:21:53,565 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:53,565 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-17 22:21:53,565 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-12-17 22:21:53,566 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-17 22:21:53,566 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 128 transitions, 796 flow. Second operand  has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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)
[2021-12-17 22:21:53,566 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:53,566 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-17 22:21:53,567 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:53,980 INFO  L129       PetriNetUnfolder]: 707/1814 cut-off events.
[2021-12-17 22:21:53,981 INFO  L130       PetriNetUnfolder]: For 24250/24309 co-relation queries the response was YES.
[2021-12-17 22:21:53,990 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 9222 conditions, 1814 events. 707/1814 cut-off events. For 24250/24309 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12879 event pairs, 12 based on Foata normal form. 91/1898 useless extension candidates. Maximal degree in co-relation 9123. Up to 479 conditions per place. 
[2021-12-17 22:21:53,994 INFO  L132   encePairwiseOnDemand]: 105/114 looper letters, 69 selfloop transitions, 9 changer transitions 73/227 dead transitions.
[2021-12-17 22:21:53,995 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 227 transitions, 2516 flow
[2021-12-17 22:21:53,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-17 22:21:53,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-17 22:21:53,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 971 transitions.
[2021-12-17 22:21:53,999 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8517543859649123
[2021-12-17 22:21:53,999 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 971 transitions.
[2021-12-17 22:21:53,999 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 971 transitions.
[2021-12-17 22:21:54,000 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:54,000 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 971 transitions.
[2021-12-17 22:21:54,001 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.1) internal successors, (971), 10 states have internal predecessors, (971), 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)
[2021-12-17 22:21:54,002 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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)
[2021-12-17 22:21:54,003 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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)
[2021-12-17 22:21:54,003 INFO  L186             Difference]: Start difference. First operand has 173 places, 128 transitions, 796 flow. Second operand 10 states and 971 transitions.
[2021-12-17 22:21:54,003 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 227 transitions, 2516 flow
[2021-12-17 22:21:54,022 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 227 transitions, 2412 flow, removed 31 selfloop flow, removed 8 redundant places.
[2021-12-17 22:21:54,024 INFO  L242             Difference]: Finished difference. Result has 174 places, 127 transitions, 785 flow
[2021-12-17 22:21:54,024 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=785, PETRI_PLACES=174, PETRI_TRANSITIONS=127}
[2021-12-17 22:21:54,025 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places.
[2021-12-17 22:21:54,025 INFO  L470      AbstractCegarLoop]: Abstraction has has 174 places, 127 transitions, 785 flow
[2021-12-17 22:21:54,025 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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)
[2021-12-17 22:21:54,025 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:54,025 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:54,025 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-12-17 22:21:54,026 INFO  L402      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:54,026 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:54,026 INFO  L85        PathProgramCache]: Analyzing trace with hash 310442648, now seen corresponding path program 1 times
[2021-12-17 22:21:54,026 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:54,026 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43594562]
[2021-12-17 22:21:54,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:54,060 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:54,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:54,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:54,569 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:54,569 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43594562]
[2021-12-17 22:21:54,569 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43594562] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:54,569 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:54,569 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2021-12-17 22:21:54,569 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350177280]
[2021-12-17 22:21:54,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:54,570 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2021-12-17 22:21:54,570 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:54,571 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2021-12-17 22:21:54,571 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342
[2021-12-17 22:21:54,572 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 114
[2021-12-17 22:21:54,573 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 127 transitions, 785 flow. Second operand  has 19 states, 19 states have (on average 83.36842105263158) internal successors, (1584), 19 states have internal predecessors, (1584), 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)
[2021-12-17 22:21:54,573 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:54,573 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 114
[2021-12-17 22:21:54,573 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:55,090 INFO  L129       PetriNetUnfolder]: 97/613 cut-off events.
[2021-12-17 22:21:55,090 INFO  L130       PetriNetUnfolder]: For 4556/4595 co-relation queries the response was YES.
[2021-12-17 22:21:55,097 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2556 conditions, 613 events. 97/613 cut-off events. For 4556/4595 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3797 event pairs, 10 based on Foata normal form. 27/628 useless extension candidates. Maximal degree in co-relation 2446. Up to 119 conditions per place. 
[2021-12-17 22:21:55,099 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 30 selfloop transitions, 16 changer transitions 27/148 dead transitions.
[2021-12-17 22:21:55,100 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 148 transitions, 1189 flow
[2021-12-17 22:21:55,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2021-12-17 22:21:55,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2021-12-17 22:21:55,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1535 transitions.
[2021-12-17 22:21:55,102 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7480506822612085
[2021-12-17 22:21:55,102 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1535 transitions.
[2021-12-17 22:21:55,103 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1535 transitions.
[2021-12-17 22:21:55,103 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:55,103 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1535 transitions.
[2021-12-17 22:21:55,105 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 85.27777777777777) internal successors, (1535), 18 states have internal predecessors, (1535), 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)
[2021-12-17 22:21:55,110 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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)
[2021-12-17 22:21:55,110 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 114.0) internal successors, (2166), 19 states have internal predecessors, (2166), 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)
[2021-12-17 22:21:55,110 INFO  L186             Difference]: Start difference. First operand has 174 places, 127 transitions, 785 flow. Second operand 18 states and 1535 transitions.
[2021-12-17 22:21:55,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 148 transitions, 1189 flow
[2021-12-17 22:21:55,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 148 transitions, 1131 flow, removed 21 selfloop flow, removed 9 redundant places.
[2021-12-17 22:21:55,125 INFO  L242             Difference]: Finished difference. Result has 186 places, 117 transitions, 674 flow
[2021-12-17 22:21:55,126 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=674, PETRI_PLACES=186, PETRI_TRANSITIONS=117}
[2021-12-17 22:21:55,126 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 67 predicate places.
[2021-12-17 22:21:55,126 INFO  L470      AbstractCegarLoop]: Abstraction has has 186 places, 117 transitions, 674 flow
[2021-12-17 22:21:55,127 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 83.36842105263158) internal successors, (1584), 19 states have internal predecessors, (1584), 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)
[2021-12-17 22:21:55,127 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:55,127 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:55,127 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-12-17 22:21:55,128 INFO  L402      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:55,128 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:55,128 INFO  L85        PathProgramCache]: Analyzing trace with hash 913737746, now seen corresponding path program 1 times
[2021-12-17 22:21:55,128 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:55,128 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761648111]
[2021-12-17 22:21:55,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:55,129 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:55,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-17 22:21:55,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-17 22:21:55,226 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-17 22:21:55,226 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761648111]
[2021-12-17 22:21:55,226 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761648111] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-17 22:21:55,226 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-17 22:21:55,226 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-17 22:21:55,226 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581517202]
[2021-12-17 22:21:55,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-17 22:21:55,227 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-17 22:21:55,227 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-17 22:21:55,228 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-17 22:21:55,228 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-12-17 22:21:55,228 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-17 22:21:55,229 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 117 transitions, 674 flow. Second operand  has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 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)
[2021-12-17 22:21:55,229 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-17 22:21:55,229 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-17 22:21:55,229 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-17 22:21:55,483 INFO  L129       PetriNetUnfolder]: 176/671 cut-off events.
[2021-12-17 22:21:55,483 INFO  L130       PetriNetUnfolder]: For 6768/6774 co-relation queries the response was YES.
[2021-12-17 22:21:55,486 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2890 conditions, 671 events. 176/671 cut-off events. For 6768/6774 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4103 event pairs, 6 based on Foata normal form. 28/696 useless extension candidates. Maximal degree in co-relation 2844. Up to 109 conditions per place. 
[2021-12-17 22:21:55,488 INFO  L132   encePairwiseOnDemand]: 105/114 looper letters, 43 selfloop transitions, 12 changer transitions 25/155 dead transitions.
[2021-12-17 22:21:55,488 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 155 transitions, 1357 flow
[2021-12-17 22:21:55,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-17 22:21:55,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-17 22:21:55,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1029 transitions.
[2021-12-17 22:21:55,490 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8205741626794258
[2021-12-17 22:21:55,490 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1029 transitions.
[2021-12-17 22:21:55,490 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1029 transitions.
[2021-12-17 22:21:55,491 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-17 22:21:55,491 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1029 transitions.
[2021-12-17 22:21:55,492 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 93.54545454545455) internal successors, (1029), 11 states have internal predecessors, (1029), 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)
[2021-12-17 22:21:55,493 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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)
[2021-12-17 22:21:55,493 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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)
[2021-12-17 22:21:55,493 INFO  L186             Difference]: Start difference. First operand has 186 places, 117 transitions, 674 flow. Second operand 11 states and 1029 transitions.
[2021-12-17 22:21:55,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 155 transitions, 1357 flow
[2021-12-17 22:21:55,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 155 transitions, 1059 flow, removed 96 selfloop flow, removed 36 redundant places.
[2021-12-17 22:21:55,502 INFO  L242             Difference]: Finished difference. Result has 151 places, 114 transitions, 519 flow
[2021-12-17 22:21:55,502 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=519, PETRI_PLACES=151, PETRI_TRANSITIONS=114}
[2021-12-17 22:21:55,502 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places.
[2021-12-17 22:21:55,502 INFO  L470      AbstractCegarLoop]: Abstraction has has 151 places, 114 transitions, 519 flow
[2021-12-17 22:21:55,503 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 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)
[2021-12-17 22:21:55,503 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-17 22:21:55,503 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:55,503 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-12-17 22:21:55,503 INFO  L402      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-17 22:21:55,503 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-17 22:21:55,504 INFO  L85        PathProgramCache]: Analyzing trace with hash 1242017887, now seen corresponding path program 1 times
[2021-12-17 22:21:55,504 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-17 22:21:55,504 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240495810]
[2021-12-17 22:21:55,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-17 22:21:55,504 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-17 22:21:55,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-17 22:21:55,553 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-17 22:21:55,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-17 22:21:55,685 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-17 22:21:55,686 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2021-12-17 22:21:55,688 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2021-12-17 22:21:55,689 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2021-12-17 22:21:55,690 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining)
[2021-12-17 22:21:55,690 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining)
[2021-12-17 22:21:55,690 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining)
[2021-12-17 22:21:55,690 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2021-12-17 22:21:55,690 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2021-12-17 22:21:55,694 INFO  L732         BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-17 22:21:55,698 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-12-17 22:21:55,698 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-12-17 22:21:55,806 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:21:55 BasicIcfg
[2021-12-17 22:21:55,807 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-12-17 22:21:55,807 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-12-17 22:21:55,807 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-12-17 22:21:55,807 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-12-17 22:21:55,808 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:21:37" (3/4) ...
[2021-12-17 22:21:55,809 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-12-17 22:21:55,937 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2021-12-17 22:21:55,937 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-12-17 22:21:55,938 INFO  L158              Benchmark]: Toolchain (without parser) took 20214.96ms. Allocated memory was 117.4MB in the beginning and 719.3MB in the end (delta: 601.9MB). Free memory was 80.8MB in the beginning and 600.0MB in the end (delta: -519.3MB). Peak memory consumption was 472.2MB. Max. memory is 16.1GB.
[2021-12-17 22:21:55,938 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 88.7MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2021-12-17 22:21:55,938 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 484.86ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 76.4MB in the end (delta: 4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2021-12-17 22:21:55,939 INFO  L158              Benchmark]: Boogie Procedure Inliner took 58.26ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 73.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2021-12-17 22:21:55,939 INFO  L158              Benchmark]: Boogie Preprocessor took 60.33ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 70.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2021-12-17 22:21:55,939 INFO  L158              Benchmark]: RCFGBuilder took 1261.60ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 70.1MB in the beginning and 74.3MB in the end (delta: -4.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB.
[2021-12-17 22:21:55,939 INFO  L158              Benchmark]: TraceAbstraction took 18207.25ms. Allocated memory was 159.4MB in the beginning and 719.3MB in the end (delta: 559.9MB). Free memory was 74.3MB in the beginning and 221.5MB in the end (delta: -147.2MB). Peak memory consumption was 411.7MB. Max. memory is 16.1GB.
[2021-12-17 22:21:55,939 INFO  L158              Benchmark]: Witness Printer took 130.16ms. Allocated memory is still 719.3MB. Free memory was 220.5MB in the beginning and 600.0MB in the end (delta: -379.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2021-12-17 22:21:55,942 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory was 88.7MB in the beginning and 88.7MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 484.86ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 76.4MB in the end (delta: 4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 58.26ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 73.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 60.33ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 70.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1261.60ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 70.1MB in the beginning and 74.3MB in the end (delta: -4.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 18207.25ms. Allocated memory was 159.4MB in the beginning and 719.3MB in the end (delta: 559.9MB). Free memory was 74.3MB in the beginning and 221.5MB in the end (delta: -147.2MB). Peak memory consumption was 411.7MB. Max. memory is 16.1GB.
 * Witness Printer took 130.16ms. Allocated memory is still 719.3MB. Free memory was 220.5MB in the beginning and 600.0MB in the end (delta: -379.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L711]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0]
[L713]               0  int __unbuffered_p2_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L714]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L715]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L717]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L719]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L720]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L721]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L722]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L723]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L724]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L725]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L726]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L727]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L728]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L729]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L730]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L731]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L732]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L733]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L734]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L735]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L736]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L737]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L844]               0  pthread_t t1873;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L845]  FCALL, FORK  0  pthread_create(&t1873, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-2, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L846]               0  pthread_t t1874;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L847]  FCALL, FORK  0  pthread_create(&t1874, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-1, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L848]               0  pthread_t t1875;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L849]  FCALL, FORK  0  pthread_create(&t1875, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L741]               1  y$w_buff1 = y$w_buff0
[L742]               1  y$w_buff0 = 2
[L743]               1  y$w_buff1_used = y$w_buff0_used
[L744]               1  y$w_buff0_used = (_Bool)1
[L745]  CALL         1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L745]  RET          1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L746]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L747]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L748]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L749]               1  y$r_buff1_thd3 = y$r_buff0_thd3
[L750]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L753]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L770]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L773]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L776]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L776]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L776]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L776]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L777]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L777]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L778]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L778]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L779]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L779]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L780]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L780]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L790]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               3  y$flush_delayed = weak$$choice2
[L793]               3  y$mem_tmp = y
[L794]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L794]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L795]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L795]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L795]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L795]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L796]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L796]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L796]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L796]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L797]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L797]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L797]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L797]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L798]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L798]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L798]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L798]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L799]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L799]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L799]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L800]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L800]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L800]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L800]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  __unbuffered_p2_EAX = y
[L802]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L802]               3  y = y$flush_delayed ? y$mem_tmp : y
[L803]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L806]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L807]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L808]               3  y$flush_delayed = weak$$choice2
[L809]               3  y$mem_tmp = y
[L810]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L810]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L811]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L811]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L811]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L811]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L812]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L812]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L812]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L812]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L813]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L813]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L813]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L813]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L814]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L814]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L815]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L815]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L815]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L815]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L816]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L816]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]               3  __unbuffered_p2_EBX = y
[L818]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L818]               3  y = y$flush_delayed ? y$mem_tmp : y
[L819]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L822]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L822]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L822]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L822]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L823]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L823]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L824]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L824]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L825]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L825]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L826]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L826]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L756]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L756]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L757]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L757]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L758]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L758]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L759]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L759]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L760]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L760]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L763]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L829]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L851]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L853]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L853]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L855]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L855]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L855]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L855]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L856]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L856]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L857]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L857]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L858]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L858]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L859]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L862]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L863]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L864]               0  y$flush_delayed = weak$$choice2
[L865]               0  y$mem_tmp = y
[L866]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L866]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L867]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L867]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L867]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L867]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L868]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L868]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L868]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L868]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L869]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L869]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L869]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L869]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L870]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L870]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L871]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L871]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L871]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L871]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L872]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L872]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L874]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L874]               0  y = y$flush_delayed ? y$mem_tmp : y
[L875]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L877]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L18]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable
    Unable to prove that call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1372 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1372 mSDsluCounter, 1476 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2187 mSDsCounter, 825 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4326 IncrementalHoareTripleChecker+Invalid, 5151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 825 mSolverCounterUnsat, 243 mSDtfsCounter, 4326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1504occurred in iteration=16, InterpolantAutomatonStates: 301, 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1828 NumberOfCodeBlocks, 1828 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1718 ConstructedInterpolants, 0 QuantifiedInterpolants, 14734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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
RESULT: Ultimate proved your program to be incorrect!
[2021-12-17 22:21:55,995 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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