/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 18:17:12,522 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 18:17:12,524 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 18:17:12,549 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 18:17:12,550 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 18:17:12,551 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 18:17:12,552 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 18:17:12,554 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 18:17:12,556 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 18:17:12,557 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 18:17:12,557 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 18:17:12,559 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 18:17:12,559 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 18:17:12,560 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 18:17:12,561 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 18:17:12,562 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 18:17:12,563 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 18:17:12,564 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 18:17:12,566 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 18:17:12,568 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 18:17:12,569 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 18:17:12,570 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 18:17:12,571 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 18:17:12,572 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 18:17:12,575 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 18:17:12,575 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 18:17:12,575 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 18:17:12,576 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 18:17:12,576 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 18:17:12,577 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 18:17:12,577 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 18:17:12,578 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 18:17:12,579 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 18:17:12,580 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 18:17:12,581 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 18:17:12,581 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 18:17:12,582 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 18:17:12,582 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 18:17:12,582 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 18:17:12,583 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 18:17:12,583 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 18:17:12,584 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf
[2020-10-11 18:17:12,607 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 18:17:12,608 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 18:17:12,609 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 18:17:12,609 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 18:17:12,609 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 18:17:12,609 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 18:17:12,610 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 18:17:12,610 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 18:17:12,610 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 18:17:12,610 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 18:17:12,610 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 18:17:12,611 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 18:17:12,611 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 18:17:12,611 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 18:17:12,611 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 18:17:12,611 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 18:17:12,612 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 18:17:12,612 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 18:17:12,612 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 18:17:12,612 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 18:17:12,612 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 18:17:12,613 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 18:17:12,613 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 18:17:12,613 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 18:17:12,613 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 18:17:12,613 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 18:17:12,613 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 18:17:12,614 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2020-10-11 18:17:12,614 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-11 18:17:12,614 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 18:17:12,903 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 18:17:12,920 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 18:17:12,925 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 18:17:12,927 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 18:17:12,929 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 18:17:12,930 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i
[2020-10-11 18:17:12,995 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4c6cb45/c841d12b9ba14c8daecf1f72460037a3/FLAGfb6a64d39
[2020-10-11 18:17:13,489 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 18:17:13,490 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_rmo.opt.i
[2020-10-11 18:17:13,508 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4c6cb45/c841d12b9ba14c8daecf1f72460037a3/FLAGfb6a64d39
[2020-10-11 18:17:13,778 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4c6cb45/c841d12b9ba14c8daecf1f72460037a3
[2020-10-11 18:17:13,786 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 18:17:13,788 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 18:17:13,789 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 18:17:13,789 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 18:17:13,793 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 18:17:13,795 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:13" (1/1) ...
[2020-10-11 18:17:13,798 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7d1152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:13, skipping insertion in model container
[2020-10-11 18:17:13,798 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:17:13" (1/1) ...
[2020-10-11 18:17:13,806 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 18:17:13,878 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 18:17:14,404 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 18:17:14,416 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 18:17:14,495 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 18:17:14,571 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 18:17:14,571 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14 WrapperNode
[2020-10-11 18:17:14,572 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 18:17:14,573 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 18:17:14,573 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 18:17:14,573 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 18:17:14,582 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,604 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,641 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 18:17:14,642 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 18:17:14,642 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 18:17:14,642 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 18:17:14,653 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,654 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,659 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,660 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,670 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,675 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,679 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
[2020-10-11 18:17:14,685 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 18:17:14,685 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 18:17:14,685 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 18:17:14,686 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 18:17:14,686 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 18:17:14,757 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 18:17:14,758 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 18:17:14,758 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 18:17:14,758 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 18:17:14,758 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 18:17:14,758 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 18:17:14,759 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 18:17:14,759 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 18:17:14,759 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 18:17:14,759 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 18:17:14,759 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-11 18:17:14,759 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-11 18:17:14,760 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 18:17:14,760 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 18:17:14,760 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 18:17:14,762 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-11 18:17:16,896 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 18:17:16,896 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 18:17:16,899 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:16 BoogieIcfgContainer
[2020-10-11 18:17:16,899 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 18:17:16,901 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 18:17:16,901 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 18:17:16,905 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 18:17:16,905 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:17:13" (1/3) ...
[2020-10-11 18:17:16,906 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994ecba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:16, skipping insertion in model container
[2020-10-11 18:17:16,906 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:17:14" (2/3) ...
[2020-10-11 18:17:16,907 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994ecba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:17:16, skipping insertion in model container
[2020-10-11 18:17:16,907 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:17:16" (3/3) ...
[2020-10-11 18:17:16,909 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix030_rmo.opt.i
[2020-10-11 18:17:16,922 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 18:17:16,930 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 18:17:16,931 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 18:17:16,964 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,965 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,965 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,965 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,966 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,966 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,967 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,967 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,967 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,967 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,968 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,969 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,969 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,969 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,970 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,970 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,971 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,971 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,971 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,971 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,972 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,972 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,972 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,973 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,974 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,974 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,974 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,975 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,975 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,975 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,976 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,976 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,976 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,976 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,977 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,978 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,979 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,983 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,983 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,983 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,984 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,984 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,984 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,984 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,985 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,985 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,985 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,987 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,988 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,988 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,988 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,990 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,990 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,990 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,991 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,991 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,991 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,991 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,992 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,992 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,992 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,997 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,998 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,998 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,998 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,999 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,999 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,999 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,999 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:16,999 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:17,000 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:17,000 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:17,000 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 18:17:17,018 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-11 18:17:17,040 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 18:17:17,041 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-11 18:17:17,041 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 18:17:17,041 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 18:17:17,041 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 18:17:17,041 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 18:17:17,041 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 18:17:17,041 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 18:17:17,056 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow
[2020-10-11 18:17:17,112 INFO  L129       PetriNetUnfolder]: 2/106 cut-off events.
[2020-10-11 18:17:17,113 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:17:17,118 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-11 18:17:17,119 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 240 flow
[2020-10-11 18:17:17,129 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 117 places, 106 transitions, 224 flow
[2020-10-11 18:17:17,184 INFO  L129       PetriNetUnfolder]: 0/59 cut-off events.
[2020-10-11 18:17:17,185 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:17:17,185 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:17,186 INFO  L255   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]
[2020-10-11 18:17:17,187 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:17,196 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:17,196 INFO  L82        PathProgramCache]: Analyzing trace with hash 891038332, now seen corresponding path program 1 times
[2020-10-11 18:17:17,209 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:17,209 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145826245]
[2020-10-11 18:17:17,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:17,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:17,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:17,557 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145826245]
[2020-10-11 18:17:17,558 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:17,559 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 18:17:17,560 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844165015]
[2020-10-11 18:17:17,571 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 18:17:17,572 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:17,587 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 18:17:17,589 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 18:17:17,691 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 110
[2020-10-11 18:17:17,693 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 106 transitions, 224 flow. Second operand 3 states.
[2020-10-11 18:17:17,694 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:17,694 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 110
[2020-10-11 18:17:17,696 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:17,731 INFO  L129       PetriNetUnfolder]: 0/103 cut-off events.
[2020-10-11 18:17:17,731 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:17:17,731 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 119 conditions, 103 events. 0/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 4/105 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. 
[2020-10-11 18:17:17,733 INFO  L132   encePairwiseOnDemand]: 105/110 looper letters, 0 selfloop transitions, 2 changer transitions 13/103 dead transitions.
[2020-10-11 18:17:17,733 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 103 transitions, 222 flow
[2020-10-11 18:17:17,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 18:17:17,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-11 18:17:17,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions.
[2020-10-11 18:17:17,751 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9757575757575757
[2020-10-11 18:17:17,752 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 322 transitions.
[2020-10-11 18:17:17,753 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions.
[2020-10-11 18:17:17,755 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:17,758 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions.
[2020-10-11 18:17:17,761 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-11 18:17:17,768 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-11 18:17:17,769 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-11 18:17:17,771 INFO  L185             Difference]: Start difference. First operand has 117 places, 106 transitions, 224 flow. Second operand 3 states and 322 transitions.
[2020-10-11 18:17:17,772 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 103 transitions, 222 flow
[2020-10-11 18:17:17,777 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 103 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places.
[2020-10-11 18:17:17,781 INFO  L241             Difference]: Finished difference. Result has 114 places, 90 transitions, 192 flow
[2020-10-11 18:17:17,784 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=114, PETRI_TRANSITIONS=90}
[2020-10-11 18:17:17,785 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places.
[2020-10-11 18:17:17,786 INFO  L481      AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 192 flow
[2020-10-11 18:17:17,786 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 18:17:17,786 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:17,786 INFO  L255   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]
[2020-10-11 18:17:17,787 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 18:17:17,787 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:17,787 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:17,787 INFO  L82        PathProgramCache]: Analyzing trace with hash -400508577, now seen corresponding path program 1 times
[2020-10-11 18:17:17,788 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:17,788 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361589268]
[2020-10-11 18:17:17,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:17,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:18,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:18,062 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361589268]
[2020-10-11 18:17:18,063 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:18,063 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:17:18,063 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191416681]
[2020-10-11 18:17:18,065 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:17:18,066 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:18,066 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:17:18,066 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:17:18,237 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110
[2020-10-11 18:17:18,238 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 192 flow. Second operand 6 states.
[2020-10-11 18:17:18,238 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:18,238 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110
[2020-10-11 18:17:18,239 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:18,372 INFO  L129       PetriNetUnfolder]: 3/116 cut-off events.
[2020-10-11 18:17:18,372 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 18:17:18,373 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 2/118 useless extension candidates. Maximal degree in co-relation 108. Up to 7 conditions per place. 
[2020-10-11 18:17:18,374 INFO  L132   encePairwiseOnDemand]: 104/110 looper letters, 6 selfloop transitions, 2 changer transitions 10/100 dead transitions.
[2020-10-11 18:17:18,374 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 248 flow
[2020-10-11 18:17:18,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:17:18,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:17:18,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 920 transitions.
[2020-10-11 18:17:18,381 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9292929292929293
[2020-10-11 18:17:18,381 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 920 transitions.
[2020-10-11 18:17:18,381 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 920 transitions.
[2020-10-11 18:17:18,382 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:18,383 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 920 transitions.
[2020-10-11 18:17:18,386 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:17:18,390 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:17:18,390 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:17:18,391 INFO  L185             Difference]: Start difference. First operand has 114 places, 90 transitions, 192 flow. Second operand 9 states and 920 transitions.
[2020-10-11 18:17:18,391 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 248 flow
[2020-10-11 18:17:18,392 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-11 18:17:18,395 INFO  L241             Difference]: Finished difference. Result has 114 places, 90 transitions, 208 flow
[2020-10-11 18:17:18,396 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=208, PETRI_PLACES=114, PETRI_TRANSITIONS=90}
[2020-10-11 18:17:18,396 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places.
[2020-10-11 18:17:18,397 INFO  L481      AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 208 flow
[2020-10-11 18:17:18,397 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:17:18,397 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:18,397 INFO  L255   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]
[2020-10-11 18:17:18,397 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 18:17:18,398 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:18,398 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:18,398 INFO  L82        PathProgramCache]: Analyzing trace with hash 1350427789, now seen corresponding path program 1 times
[2020-10-11 18:17:18,398 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:18,399 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559704151]
[2020-10-11 18:17:18,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:18,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:18,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:18,644 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559704151]
[2020-10-11 18:17:18,645 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:18,645 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:17:18,645 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156310104]
[2020-10-11 18:17:18,646 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:17:18,646 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:18,646 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:17:18,646 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:17:18,814 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110
[2020-10-11 18:17:18,814 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 208 flow. Second operand 6 states.
[2020-10-11 18:17:18,815 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:18,815 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110
[2020-10-11 18:17:18,815 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:19,031 INFO  L129       PetriNetUnfolder]: 24/192 cut-off events.
[2020-10-11 18:17:19,032 INFO  L130       PetriNetUnfolder]: For 40/40 co-relation queries the response was YES.
[2020-10-11 18:17:19,037 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 192 events. 24/192 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 628 event pairs, 5 based on Foata normal form. 4/194 useless extension candidates. Maximal degree in co-relation 282. Up to 31 conditions per place. 
[2020-10-11 18:17:19,039 INFO  L132   encePairwiseOnDemand]: 103/110 looper letters, 8 selfloop transitions, 3 changer transitions 19/111 dead transitions.
[2020-10-11 18:17:19,040 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 328 flow
[2020-10-11 18:17:19,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:17:19,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:17:19,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions.
[2020-10-11 18:17:19,046 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9323232323232323
[2020-10-11 18:17:19,047 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 923 transitions.
[2020-10-11 18:17:19,047 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions.
[2020-10-11 18:17:19,048 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:19,048 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions.
[2020-10-11 18:17:19,055 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:17:19,059 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:17:19,060 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:17:19,060 INFO  L185             Difference]: Start difference. First operand has 114 places, 90 transitions, 208 flow. Second operand 9 states and 923 transitions.
[2020-10-11 18:17:19,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 328 flow
[2020-10-11 18:17:19,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 296 flow, removed 14 selfloop flow, removed 8 redundant places.
[2020-10-11 18:17:19,067 INFO  L241             Difference]: Finished difference. Result has 115 places, 92 transitions, 235 flow
[2020-10-11 18:17:19,068 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=115, PETRI_TRANSITIONS=92}
[2020-10-11 18:17:19,068 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places.
[2020-10-11 18:17:19,068 INFO  L481      AbstractCegarLoop]: Abstraction has has 115 places, 92 transitions, 235 flow
[2020-10-11 18:17:19,069 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:17:19,069 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:19,070 INFO  L255   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]
[2020-10-11 18:17:19,071 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 18:17:19,071 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:19,071 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:19,071 INFO  L82        PathProgramCache]: Analyzing trace with hash -896488980, now seen corresponding path program 1 times
[2020-10-11 18:17:19,072 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:19,072 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718048237]
[2020-10-11 18:17:19,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:19,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:19,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:19,333 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718048237]
[2020-10-11 18:17:19,333 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:19,333 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-11 18:17:19,334 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71933575]
[2020-10-11 18:17:19,334 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 18:17:19,334 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:19,335 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 18:17:19,335 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-10-11 18:17:19,771 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 110
[2020-10-11 18:17:19,771 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 92 transitions, 235 flow. Second operand 9 states.
[2020-10-11 18:17:19,772 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:19,772 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 110
[2020-10-11 18:17:19,772 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:20,513 INFO  L129       PetriNetUnfolder]: 755/1480 cut-off events.
[2020-10-11 18:17:20,513 INFO  L130       PetriNetUnfolder]: For 1253/1257 co-relation queries the response was YES.
[2020-10-11 18:17:20,526 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 1480 events. 755/1480 cut-off events. For 1253/1257 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9360 event pairs, 328 based on Foata normal form. 42/1467 useless extension candidates. Maximal degree in co-relation 3491. Up to 608 conditions per place. 
[2020-10-11 18:17:20,537 INFO  L132   encePairwiseOnDemand]: 98/110 looper letters, 14 selfloop transitions, 10 changer transitions 44/144 dead transitions.
[2020-10-11 18:17:20,537 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 144 transitions, 507 flow
[2020-10-11 18:17:20,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:17:20,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:17:20,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1436 transitions.
[2020-10-11 18:17:20,542 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8703030303030304
[2020-10-11 18:17:20,542 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1436 transitions.
[2020-10-11 18:17:20,543 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1436 transitions.
[2020-10-11 18:17:20,544 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:20,544 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1436 transitions.
[2020-10-11 18:17:20,547 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:17:20,550 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:17:20,550 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:17:20,551 INFO  L185             Difference]: Start difference. First operand has 115 places, 92 transitions, 235 flow. Second operand 15 states and 1436 transitions.
[2020-10-11 18:17:20,551 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 144 transitions, 507 flow
[2020-10-11 18:17:20,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 144 transitions, 486 flow, removed 9 selfloop flow, removed 4 redundant places.
[2020-10-11 18:17:20,565 INFO  L241             Difference]: Finished difference. Result has 130 places, 98 transitions, 310 flow
[2020-10-11 18:17:20,566 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=310, PETRI_PLACES=130, PETRI_TRANSITIONS=98}
[2020-10-11 18:17:20,566 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 13 predicate places.
[2020-10-11 18:17:20,566 INFO  L481      AbstractCegarLoop]: Abstraction has has 130 places, 98 transitions, 310 flow
[2020-10-11 18:17:20,567 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 18:17:20,567 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:20,567 INFO  L255   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]
[2020-10-11 18:17:20,567 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 18:17:20,568 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:20,568 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:20,568 INFO  L82        PathProgramCache]: Analyzing trace with hash 97544830, now seen corresponding path program 1 times
[2020-10-11 18:17:20,568 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:20,569 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508425551]
[2020-10-11 18:17:20,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:20,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:20,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:20,790 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508425551]
[2020-10-11 18:17:20,790 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:20,790 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-11 18:17:20,791 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673821657]
[2020-10-11 18:17:20,791 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 18:17:20,791 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:20,792 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 18:17:20,792 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-10-11 18:17:21,361 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 110
[2020-10-11 18:17:21,362 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 98 transitions, 310 flow. Second operand 8 states.
[2020-10-11 18:17:21,363 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:21,363 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 110
[2020-10-11 18:17:21,363 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:21,957 INFO  L129       PetriNetUnfolder]: 619/1271 cut-off events.
[2020-10-11 18:17:21,958 INFO  L130       PetriNetUnfolder]: For 4313/4653 co-relation queries the response was YES.
[2020-10-11 18:17:21,968 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 1271 events. 619/1271 cut-off events. For 4313/4653 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8008 event pairs, 143 based on Foata normal form. 35/1267 useless extension candidates. Maximal degree in co-relation 4490. Up to 463 conditions per place. 
[2020-10-11 18:17:21,980 INFO  L132   encePairwiseOnDemand]: 100/110 looper letters, 20 selfloop transitions, 8 changer transitions 31/137 dead transitions.
[2020-10-11 18:17:21,980 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 137 transitions, 696 flow
[2020-10-11 18:17:21,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-11 18:17:21,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-10-11 18:17:21,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1089 transitions.
[2020-10-11 18:17:21,985 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9
[2020-10-11 18:17:21,985 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1089 transitions.
[2020-10-11 18:17:21,985 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1089 transitions.
[2020-10-11 18:17:21,986 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:21,986 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1089 transitions.
[2020-10-11 18:17:21,989 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 12 states.
[2020-10-11 18:17:21,992 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states.
[2020-10-11 18:17:21,993 INFO  L81            ComplementDD]: Finished complementDD. Result 12 states.
[2020-10-11 18:17:21,993 INFO  L185             Difference]: Start difference. First operand has 130 places, 98 transitions, 310 flow. Second operand 11 states and 1089 transitions.
[2020-10-11 18:17:21,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 137 transitions, 696 flow
[2020-10-11 18:17:22,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 672 flow, removed 10 selfloop flow, removed 5 redundant places.
[2020-10-11 18:17:22,004 INFO  L241             Difference]: Finished difference. Result has 133 places, 101 transitions, 376 flow
[2020-10-11 18:17:22,004 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=133, PETRI_TRANSITIONS=101}
[2020-10-11 18:17:22,005 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 16 predicate places.
[2020-10-11 18:17:22,005 INFO  L481      AbstractCegarLoop]: Abstraction has has 133 places, 101 transitions, 376 flow
[2020-10-11 18:17:22,005 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 18:17:22,005 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:22,005 INFO  L255   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]
[2020-10-11 18:17:22,006 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 18:17:22,006 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:22,006 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:22,006 INFO  L82        PathProgramCache]: Analyzing trace with hash 1787157613, now seen corresponding path program 1 times
[2020-10-11 18:17:22,006 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:22,007 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577192990]
[2020-10-11 18:17:22,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:22,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:22,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:22,279 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577192990]
[2020-10-11 18:17:22,279 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:22,279 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-10-11 18:17:22,279 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602539805]
[2020-10-11 18:17:22,280 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-11 18:17:22,280 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:22,280 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-11 18:17:22,281 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2020-10-11 18:17:23,259 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 110
[2020-10-11 18:17:23,260 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 101 transitions, 376 flow. Second operand 10 states.
[2020-10-11 18:17:23,261 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:23,261 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 110
[2020-10-11 18:17:23,261 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:24,022 INFO  L129       PetriNetUnfolder]: 604/1305 cut-off events.
[2020-10-11 18:17:24,022 INFO  L130       PetriNetUnfolder]: For 8879/9181 co-relation queries the response was YES.
[2020-10-11 18:17:24,037 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6215 conditions, 1305 events. 604/1305 cut-off events. For 8879/9181 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8292 event pairs, 90 based on Foata normal form. 35/1297 useless extension candidates. Maximal degree in co-relation 6141. Up to 544 conditions per place. 
[2020-10-11 18:17:24,052 INFO  L132   encePairwiseOnDemand]: 97/110 looper letters, 43 selfloop transitions, 18 changer transitions 38/175 dead transitions.
[2020-10-11 18:17:24,052 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 175 transitions, 1322 flow
[2020-10-11 18:17:24,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2020-10-11 18:17:24,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2020-10-11 18:17:24,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1636 transitions.
[2020-10-11 18:17:24,059 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8748663101604278
[2020-10-11 18:17:24,059 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1636 transitions.
[2020-10-11 18:17:24,059 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1636 transitions.
[2020-10-11 18:17:24,060 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:24,061 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1636 transitions.
[2020-10-11 18:17:24,064 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 18 states.
[2020-10-11 18:17:24,068 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states.
[2020-10-11 18:17:24,068 INFO  L81            ComplementDD]: Finished complementDD. Result 18 states.
[2020-10-11 18:17:24,068 INFO  L185             Difference]: Start difference. First operand has 133 places, 101 transitions, 376 flow. Second operand 17 states and 1636 transitions.
[2020-10-11 18:17:24,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 175 transitions, 1322 flow
[2020-10-11 18:17:24,082 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 175 transitions, 1250 flow, removed 27 selfloop flow, removed 6 redundant places.
[2020-10-11 18:17:24,086 INFO  L241             Difference]: Finished difference. Result has 150 places, 113 transitions, 569 flow
[2020-10-11 18:17:24,087 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=569, PETRI_PLACES=150, PETRI_TRANSITIONS=113}
[2020-10-11 18:17:24,087 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 33 predicate places.
[2020-10-11 18:17:24,087 INFO  L481      AbstractCegarLoop]: Abstraction has has 150 places, 113 transitions, 569 flow
[2020-10-11 18:17:24,087 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-11 18:17:24,089 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:24,089 INFO  L255   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]
[2020-10-11 18:17:24,089 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 18:17:24,089 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:24,089 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:24,090 INFO  L82        PathProgramCache]: Analyzing trace with hash 415842703, now seen corresponding path program 1 times
[2020-10-11 18:17:24,090 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:24,090 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735535927]
[2020-10-11 18:17:24,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:24,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:24,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:24,394 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735535927]
[2020-10-11 18:17:24,394 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:24,395 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-10-11 18:17:24,395 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894088859]
[2020-10-11 18:17:24,395 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-11 18:17:24,395 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:24,396 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-11 18:17:24,396 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2020-10-11 18:17:24,922 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 110
[2020-10-11 18:17:24,923 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 113 transitions, 569 flow. Second operand 11 states.
[2020-10-11 18:17:24,923 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:24,923 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 110
[2020-10-11 18:17:24,923 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:25,562 INFO  L129       PetriNetUnfolder]: 553/1207 cut-off events.
[2020-10-11 18:17:25,562 INFO  L130       PetriNetUnfolder]: For 15407/16275 co-relation queries the response was YES.
[2020-10-11 18:17:25,577 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 1207 events. 553/1207 cut-off events. For 15407/16275 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7535 event pairs, 79 based on Foata normal form. 48/1204 useless extension candidates. Maximal degree in co-relation 7028. Up to 580 conditions per place. 
[2020-10-11 18:17:25,590 INFO  L132   encePairwiseOnDemand]: 97/110 looper letters, 28 selfloop transitions, 14 changer transitions 56/173 dead transitions.
[2020-10-11 18:17:25,590 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 173 transitions, 1559 flow
[2020-10-11 18:17:25,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2020-10-11 18:17:25,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2020-10-11 18:17:25,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1503 transitions.
[2020-10-11 18:17:25,601 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8539772727272728
[2020-10-11 18:17:25,601 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1503 transitions.
[2020-10-11 18:17:25,602 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1503 transitions.
[2020-10-11 18:17:25,603 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:25,603 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1503 transitions.
[2020-10-11 18:17:25,607 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 17 states.
[2020-10-11 18:17:25,610 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states.
[2020-10-11 18:17:25,610 INFO  L81            ComplementDD]: Finished complementDD. Result 17 states.
[2020-10-11 18:17:25,610 INFO  L185             Difference]: Start difference. First operand has 150 places, 113 transitions, 569 flow. Second operand 16 states and 1503 transitions.
[2020-10-11 18:17:25,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 173 transitions, 1559 flow
[2020-10-11 18:17:25,634 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 173 transitions, 1324 flow, removed 105 selfloop flow, removed 12 redundant places.
[2020-10-11 18:17:25,637 INFO  L241             Difference]: Finished difference. Result has 155 places, 115 transitions, 604 flow
[2020-10-11 18:17:25,638 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=604, PETRI_PLACES=155, PETRI_TRANSITIONS=115}
[2020-10-11 18:17:25,638 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places.
[2020-10-11 18:17:25,638 INFO  L481      AbstractCegarLoop]: Abstraction has has 155 places, 115 transitions, 604 flow
[2020-10-11 18:17:25,638 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-11 18:17:25,639 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:25,639 INFO  L255   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]
[2020-10-11 18:17:25,639 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 18:17:25,639 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:25,639 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:25,639 INFO  L82        PathProgramCache]: Analyzing trace with hash 1661779489, now seen corresponding path program 1 times
[2020-10-11 18:17:25,640 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:25,640 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60725402]
[2020-10-11 18:17:25,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:25,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:25,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:25,908 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60725402]
[2020-10-11 18:17:25,909 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:25,909 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-10-11 18:17:25,909 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222467702]
[2020-10-11 18:17:25,909 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-11 18:17:25,909 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:25,910 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-11 18:17:25,910 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2020-10-11 18:17:27,246 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 110
[2020-10-11 18:17:27,247 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 115 transitions, 604 flow. Second operand 11 states.
[2020-10-11 18:17:27,247 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:27,247 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 110
[2020-10-11 18:17:27,247 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:27,775 INFO  L129       PetriNetUnfolder]: 463/1077 cut-off events.
[2020-10-11 18:17:27,775 INFO  L130       PetriNetUnfolder]: For 12991/14021 co-relation queries the response was YES.
[2020-10-11 18:17:27,785 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6136 conditions, 1077 events. 463/1077 cut-off events. For 12991/14021 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6583 event pairs, 96 based on Foata normal form. 38/1069 useless extension candidates. Maximal degree in co-relation 6044. Up to 543 conditions per place. 
[2020-10-11 18:17:27,795 INFO  L132   encePairwiseOnDemand]: 97/110 looper letters, 35 selfloop transitions, 16 changer transitions 19/145 dead transitions.
[2020-10-11 18:17:27,795 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 145 transitions, 1198 flow
[2020-10-11 18:17:27,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:17:27,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:17:27,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1220 transitions.
[2020-10-11 18:17:27,799 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8531468531468531
[2020-10-11 18:17:27,800 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1220 transitions.
[2020-10-11 18:17:27,800 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1220 transitions.
[2020-10-11 18:17:27,801 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:27,801 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1220 transitions.
[2020-10-11 18:17:27,803 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:17:27,806 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:17:27,806 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:17:27,806 INFO  L185             Difference]: Start difference. First operand has 155 places, 115 transitions, 604 flow. Second operand 13 states and 1220 transitions.
[2020-10-11 18:17:27,806 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 145 transitions, 1198 flow
[2020-10-11 18:17:27,825 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 145 transitions, 1065 flow, removed 57 selfloop flow, removed 14 redundant places.
[2020-10-11 18:17:27,828 INFO  L241             Difference]: Finished difference. Result has 151 places, 119 transitions, 638 flow
[2020-10-11 18:17:27,828 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=638, PETRI_PLACES=151, PETRI_TRANSITIONS=119}
[2020-10-11 18:17:27,829 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 34 predicate places.
[2020-10-11 18:17:27,829 INFO  L481      AbstractCegarLoop]: Abstraction has has 151 places, 119 transitions, 638 flow
[2020-10-11 18:17:27,829 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-11 18:17:27,829 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:27,829 INFO  L255   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]
[2020-10-11 18:17:27,829 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 18:17:27,830 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:27,830 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:27,830 INFO  L82        PathProgramCache]: Analyzing trace with hash 377436727, now seen corresponding path program 2 times
[2020-10-11 18:17:27,830 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:27,831 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666154770]
[2020-10-11 18:17:27,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:27,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:28,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:28,234 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666154770]
[2020-10-11 18:17:28,234 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:28,234 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-10-11 18:17:28,234 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921482061]
[2020-10-11 18:17:28,235 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-10-11 18:17:28,235 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:28,235 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-10-11 18:17:28,236 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2020-10-11 18:17:30,062 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 110
[2020-10-11 18:17:30,062 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 119 transitions, 638 flow. Second operand 13 states.
[2020-10-11 18:17:30,062 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:30,062 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 110
[2020-10-11 18:17:30,063 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:30,656 INFO  L129       PetriNetUnfolder]: 465/1109 cut-off events.
[2020-10-11 18:17:30,657 INFO  L130       PetriNetUnfolder]: For 16950/18189 co-relation queries the response was YES.
[2020-10-11 18:17:30,714 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6657 conditions, 1109 events. 465/1109 cut-off events. For 16950/18189 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6884 event pairs, 88 based on Foata normal form. 60/1124 useless extension candidates. Maximal degree in co-relation 6567. Up to 521 conditions per place. 
[2020-10-11 18:17:30,728 INFO  L132   encePairwiseOnDemand]: 96/110 looper letters, 31 selfloop transitions, 23 changer transitions 19/147 dead transitions.
[2020-10-11 18:17:30,728 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 147 transitions, 1318 flow
[2020-10-11 18:17:30,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:17:30,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:17:30,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1389 transitions.
[2020-10-11 18:17:30,732 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8418181818181818
[2020-10-11 18:17:30,732 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1389 transitions.
[2020-10-11 18:17:30,733 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1389 transitions.
[2020-10-11 18:17:30,733 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:30,734 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1389 transitions.
[2020-10-11 18:17:30,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:17:30,739 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:17:30,739 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:17:30,739 INFO  L185             Difference]: Start difference. First operand has 151 places, 119 transitions, 638 flow. Second operand 15 states and 1389 transitions.
[2020-10-11 18:17:30,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 147 transitions, 1318 flow
[2020-10-11 18:17:30,758 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 147 transitions, 1133 flow, removed 79 selfloop flow, removed 11 redundant places.
[2020-10-11 18:17:30,760 INFO  L241             Difference]: Finished difference. Result has 155 places, 121 transitions, 691 flow
[2020-10-11 18:17:30,761 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=691, PETRI_PLACES=155, PETRI_TRANSITIONS=121}
[2020-10-11 18:17:30,761 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places.
[2020-10-11 18:17:30,761 INFO  L481      AbstractCegarLoop]: Abstraction has has 155 places, 121 transitions, 691 flow
[2020-10-11 18:17:30,761 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-10-11 18:17:30,761 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:30,762 INFO  L255   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]
[2020-10-11 18:17:30,762 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 18:17:30,762 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:30,762 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:30,762 INFO  L82        PathProgramCache]: Analyzing trace with hash 363156275, now seen corresponding path program 3 times
[2020-10-11 18:17:30,762 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:30,763 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688706541]
[2020-10-11 18:17:30,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:30,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:31,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:31,030 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688706541]
[2020-10-11 18:17:31,030 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:31,030 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-10-11 18:17:31,030 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314156832]
[2020-10-11 18:17:31,031 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-11 18:17:31,031 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:31,031 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-11 18:17:31,031 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2020-10-11 18:17:32,336 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 110
[2020-10-11 18:17:32,337 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 121 transitions, 691 flow. Second operand 11 states.
[2020-10-11 18:17:32,337 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:32,338 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 110
[2020-10-11 18:17:32,338 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:32,871 INFO  L129       PetriNetUnfolder]: 415/1184 cut-off events.
[2020-10-11 18:17:32,872 INFO  L130       PetriNetUnfolder]: For 19467/21046 co-relation queries the response was YES.
[2020-10-11 18:17:32,883 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 1184 events. 415/1184 cut-off events. For 19467/21046 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8202 event pairs, 43 based on Foata normal form. 45/1187 useless extension candidates. Maximal degree in co-relation 6904. Up to 414 conditions per place. 
[2020-10-11 18:17:32,895 INFO  L132   encePairwiseOnDemand]: 99/110 looper letters, 39 selfloop transitions, 14 changer transitions 19/150 dead transitions.
[2020-10-11 18:17:32,895 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 150 transitions, 1433 flow
[2020-10-11 18:17:32,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-10-11 18:17:32,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-10-11 18:17:32,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1242 transitions.
[2020-10-11 18:17:32,897 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.8685314685314686
[2020-10-11 18:17:32,898 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1242 transitions.
[2020-10-11 18:17:32,898 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1242 transitions.
[2020-10-11 18:17:32,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:32,898 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1242 transitions.
[2020-10-11 18:17:32,900 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 14 states.
[2020-10-11 18:17:32,902 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states.
[2020-10-11 18:17:32,903 INFO  L81            ComplementDD]: Finished complementDD. Result 14 states.
[2020-10-11 18:17:32,903 INFO  L185             Difference]: Start difference. First operand has 155 places, 121 transitions, 691 flow. Second operand 13 states and 1242 transitions.
[2020-10-11 18:17:32,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 150 transitions, 1433 flow
[2020-10-11 18:17:32,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 150 transitions, 1191 flow, removed 104 selfloop flow, removed 13 redundant places.
[2020-10-11 18:17:32,933 INFO  L241             Difference]: Finished difference. Result has 155 places, 124 transitions, 718 flow
[2020-10-11 18:17:32,933 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=718, PETRI_PLACES=155, PETRI_TRANSITIONS=124}
[2020-10-11 18:17:32,933 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places.
[2020-10-11 18:17:32,933 INFO  L481      AbstractCegarLoop]: Abstraction has has 155 places, 124 transitions, 718 flow
[2020-10-11 18:17:32,934 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-11 18:17:32,934 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:32,934 INFO  L255   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]
[2020-10-11 18:17:32,934 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 18:17:32,970 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:32,970 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:32,970 INFO  L82        PathProgramCache]: Analyzing trace with hash 761857655, now seen corresponding path program 1 times
[2020-10-11 18:17:32,971 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:32,972 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112952546]
[2020-10-11 18:17:32,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:32,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:33,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:33,066 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112952546]
[2020-10-11 18:17:33,066 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:33,066 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:17:33,067 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772469475]
[2020-10-11 18:17:33,067 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:17:33,067 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:33,068 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:17:33,068 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:17:33,275 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110
[2020-10-11 18:17:33,276 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 124 transitions, 718 flow. Second operand 6 states.
[2020-10-11 18:17:33,276 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:33,276 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110
[2020-10-11 18:17:33,276 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:33,700 INFO  L129       PetriNetUnfolder]: 627/1875 cut-off events.
[2020-10-11 18:17:33,700 INFO  L130       PetriNetUnfolder]: For 29142/29989 co-relation queries the response was YES.
[2020-10-11 18:17:33,715 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 10043 conditions, 1875 events. 627/1875 cut-off events. For 29142/29989 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15567 event pairs, 136 based on Foata normal form. 97/1888 useless extension candidates. Maximal degree in co-relation 9956. Up to 600 conditions per place. 
[2020-10-11 18:17:33,728 INFO  L132   encePairwiseOnDemand]: 104/110 looper letters, 12 selfloop transitions, 2 changer transitions 4/133 dead transitions.
[2020-10-11 18:17:33,728 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 133 transitions, 852 flow
[2020-10-11 18:17:33,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 18:17:33,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-11 18:17:33,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions.
[2020-10-11 18:17:33,729 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9287878787878788
[2020-10-11 18:17:33,730 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 613 transitions.
[2020-10-11 18:17:33,730 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions.
[2020-10-11 18:17:33,730 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:33,730 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions.
[2020-10-11 18:17:33,731 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-11 18:17:33,732 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-11 18:17:33,732 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-11 18:17:33,732 INFO  L185             Difference]: Start difference. First operand has 155 places, 124 transitions, 718 flow. Second operand 6 states and 613 transitions.
[2020-10-11 18:17:33,733 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 133 transitions, 852 flow
[2020-10-11 18:17:33,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 133 transitions, 781 flow, removed 28 selfloop flow, removed 11 redundant places.
[2020-10-11 18:17:33,762 INFO  L241             Difference]: Finished difference. Result has 147 places, 125 transitions, 685 flow
[2020-10-11 18:17:33,763 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=685, PETRI_PLACES=147, PETRI_TRANSITIONS=125}
[2020-10-11 18:17:33,763 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 30 predicate places.
[2020-10-11 18:17:33,763 INFO  L481      AbstractCegarLoop]: Abstraction has has 147 places, 125 transitions, 685 flow
[2020-10-11 18:17:33,763 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:17:33,763 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:33,763 INFO  L255   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]
[2020-10-11 18:17:33,764 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 18:17:33,764 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:33,764 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:33,764 INFO  L82        PathProgramCache]: Analyzing trace with hash 728202473, now seen corresponding path program 2 times
[2020-10-11 18:17:33,764 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:33,765 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469948191]
[2020-10-11 18:17:33,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:33,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:33,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:33,883 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469948191]
[2020-10-11 18:17:33,883 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:33,883 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:17:33,883 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067776780]
[2020-10-11 18:17:33,884 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:17:33,884 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:33,884 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:17:33,884 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:17:34,017 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110
[2020-10-11 18:17:34,018 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 125 transitions, 685 flow. Second operand 6 states.
[2020-10-11 18:17:34,018 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:34,018 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110
[2020-10-11 18:17:34,019 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:35,261 INFO  L129       PetriNetUnfolder]: 3600/7771 cut-off events.
[2020-10-11 18:17:35,262 INFO  L130       PetriNetUnfolder]: For 35238/36598 co-relation queries the response was YES.
[2020-10-11 18:17:35,339 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 23597 conditions, 7771 events. 3600/7771 cut-off events. For 35238/36598 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 76893 event pairs, 435 based on Foata normal form. 278/7171 useless extension candidates. Maximal degree in co-relation 23516. Up to 2380 conditions per place. 
[2020-10-11 18:17:35,391 INFO  L132   encePairwiseOnDemand]: 100/110 looper letters, 23 selfloop transitions, 19 changer transitions 0/156 dead transitions.
[2020-10-11 18:17:35,391 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 156 transitions, 831 flow
[2020-10-11 18:17:35,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:17:35,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:17:35,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 908 transitions.
[2020-10-11 18:17:35,394 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9171717171717172
[2020-10-11 18:17:35,394 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 908 transitions.
[2020-10-11 18:17:35,394 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 908 transitions.
[2020-10-11 18:17:35,394 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:35,394 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 908 transitions.
[2020-10-11 18:17:35,396 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:17:35,397 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:17:35,397 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:17:35,398 INFO  L185             Difference]: Start difference. First operand has 147 places, 125 transitions, 685 flow. Second operand 9 states and 908 transitions.
[2020-10-11 18:17:35,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 156 transitions, 831 flow
[2020-10-11 18:17:35,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 823 flow, removed 3 selfloop flow, removed 4 redundant places.
[2020-10-11 18:17:35,437 INFO  L241             Difference]: Finished difference. Result has 153 places, 142 transitions, 811 flow
[2020-10-11 18:17:35,437 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=811, PETRI_PLACES=153, PETRI_TRANSITIONS=142}
[2020-10-11 18:17:35,438 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 36 predicate places.
[2020-10-11 18:17:35,438 INFO  L481      AbstractCegarLoop]: Abstraction has has 153 places, 142 transitions, 811 flow
[2020-10-11 18:17:35,438 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:17:35,438 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:35,438 INFO  L255   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]
[2020-10-11 18:17:35,439 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 18:17:35,439 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:35,439 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:35,439 INFO  L82        PathProgramCache]: Analyzing trace with hash -789571139, now seen corresponding path program 1 times
[2020-10-11 18:17:35,439 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:35,440 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765231530]
[2020-10-11 18:17:35,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:35,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:35,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:35,553 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765231530]
[2020-10-11 18:17:35,553 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:35,553 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 18:17:35,553 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445476479]
[2020-10-11 18:17:35,554 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 18:17:35,554 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:35,554 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 18:17:35,554 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-10-11 18:17:35,703 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110
[2020-10-11 18:17:35,703 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 142 transitions, 811 flow. Second operand 7 states.
[2020-10-11 18:17:35,704 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:35,704 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110
[2020-10-11 18:17:35,704 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:36,887 INFO  L129       PetriNetUnfolder]: 3122/7053 cut-off events.
[2020-10-11 18:17:36,887 INFO  L130       PetriNetUnfolder]: For 32103/51027 co-relation queries the response was YES.
[2020-10-11 18:17:36,948 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 27848 conditions, 7053 events. 3122/7053 cut-off events. For 32103/51027 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 71783 event pairs, 146 based on Foata normal form. 1150/7422 useless extension candidates. Maximal degree in co-relation 27763. Up to 3126 conditions per place. 
[2020-10-11 18:17:36,999 INFO  L132   encePairwiseOnDemand]: 100/110 looper letters, 25 selfloop transitions, 37 changer transitions 0/173 dead transitions.
[2020-10-11 18:17:36,999 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 173 transitions, 1134 flow
[2020-10-11 18:17:37,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-10-11 18:17:37,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2020-10-11 18:17:37,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1212 transitions.
[2020-10-11 18:17:37,002 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9181818181818182
[2020-10-11 18:17:37,002 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1212 transitions.
[2020-10-11 18:17:37,002 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1212 transitions.
[2020-10-11 18:17:37,003 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:37,003 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1212 transitions.
[2020-10-11 18:17:37,005 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 13 states.
[2020-10-11 18:17:37,006 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states.
[2020-10-11 18:17:37,006 INFO  L81            ComplementDD]: Finished complementDD. Result 13 states.
[2020-10-11 18:17:37,007 INFO  L185             Difference]: Start difference. First operand has 153 places, 142 transitions, 811 flow. Second operand 12 states and 1212 transitions.
[2020-10-11 18:17:37,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 173 transitions, 1134 flow
[2020-10-11 18:17:37,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 173 transitions, 1132 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-11 18:17:37,061 INFO  L241             Difference]: Finished difference. Result has 168 places, 158 transitions, 1059 flow
[2020-10-11 18:17:37,062 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1059, PETRI_PLACES=168, PETRI_TRANSITIONS=158}
[2020-10-11 18:17:37,062 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 51 predicate places.
[2020-10-11 18:17:37,062 INFO  L481      AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 1059 flow
[2020-10-11 18:17:37,062 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 18:17:37,062 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:37,063 INFO  L255   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]
[2020-10-11 18:17:37,063 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 18:17:37,063 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:37,063 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:37,063 INFO  L82        PathProgramCache]: Analyzing trace with hash -395564196, now seen corresponding path program 1 times
[2020-10-11 18:17:37,064 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:37,064 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87477012]
[2020-10-11 18:17:37,064 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:37,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:37,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:37,153 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87477012]
[2020-10-11 18:17:37,153 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:37,154 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 18:17:37,154 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917437191]
[2020-10-11 18:17:37,154 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 18:17:37,154 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:37,155 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 18:17:37,155 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-10-11 18:17:37,343 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110
[2020-10-11 18:17:37,345 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 158 transitions, 1059 flow. Second operand 6 states.
[2020-10-11 18:17:37,345 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:37,345 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110
[2020-10-11 18:17:37,345 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:38,805 INFO  L129       PetriNetUnfolder]: 2466/7693 cut-off events.
[2020-10-11 18:17:38,805 INFO  L130       PetriNetUnfolder]: For 53237/72352 co-relation queries the response was YES.
[2020-10-11 18:17:38,894 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 33632 conditions, 7693 events. 2466/7693 cut-off events. For 53237/72352 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 91682 event pairs, 312 based on Foata normal form. 224/7046 useless extension candidates. Maximal degree in co-relation 33540. Up to 2761 conditions per place. 
[2020-10-11 18:17:38,940 INFO  L132   encePairwiseOnDemand]: 104/110 looper letters, 14 selfloop transitions, 11 changer transitions 2/172 dead transitions.
[2020-10-11 18:17:38,940 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 172 transitions, 1239 flow
[2020-10-11 18:17:38,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 18:17:38,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-11 18:17:38,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 917 transitions.
[2020-10-11 18:17:38,942 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9262626262626262
[2020-10-11 18:17:38,942 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 917 transitions.
[2020-10-11 18:17:38,942 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 917 transitions.
[2020-10-11 18:17:38,943 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:38,943 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 917 transitions.
[2020-10-11 18:17:38,944 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-11 18:17:38,945 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-11 18:17:38,945 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-11 18:17:38,945 INFO  L185             Difference]: Start difference. First operand has 168 places, 158 transitions, 1059 flow. Second operand 9 states and 917 transitions.
[2020-10-11 18:17:38,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 172 transitions, 1239 flow
[2020-10-11 18:17:39,425 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 172 transitions, 1136 flow, removed 42 selfloop flow, removed 4 redundant places.
[2020-10-11 18:17:39,427 INFO  L241             Difference]: Finished difference. Result has 179 places, 164 transitions, 1089 flow
[2020-10-11 18:17:39,427 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1089, PETRI_PLACES=179, PETRI_TRANSITIONS=164}
[2020-10-11 18:17:39,427 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 62 predicate places.
[2020-10-11 18:17:39,428 INFO  L481      AbstractCegarLoop]: Abstraction has has 179 places, 164 transitions, 1089 flow
[2020-10-11 18:17:39,428 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 18:17:39,428 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:39,428 INFO  L255   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]
[2020-10-11 18:17:39,428 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-11 18:17:39,428 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:39,428 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:39,428 INFO  L82        PathProgramCache]: Analyzing trace with hash -1457728136, now seen corresponding path program 1 times
[2020-10-11 18:17:39,429 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:39,429 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583777732]
[2020-10-11 18:17:39,429 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:39,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:39,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:39,573 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583777732]
[2020-10-11 18:17:39,573 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:39,574 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-11 18:17:39,574 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146507134]
[2020-10-11 18:17:39,574 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 18:17:39,574 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:39,575 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 18:17:39,575 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-10-11 18:17:39,839 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110
[2020-10-11 18:17:39,840 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 164 transitions, 1089 flow. Second operand 8 states.
[2020-10-11 18:17:39,840 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:39,840 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110
[2020-10-11 18:17:39,841 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:41,724 INFO  L129       PetriNetUnfolder]: 4358/9333 cut-off events.
[2020-10-11 18:17:41,724 INFO  L130       PetriNetUnfolder]: For 72194/106722 co-relation queries the response was YES.
[2020-10-11 18:17:41,802 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 44023 conditions, 9333 events. 4358/9333 cut-off events. For 72194/106722 co-relation queries the response was YES. Maximal size of possible extension queue 1558. Compared 99060 event pairs, 28 based on Foata normal form. 2072/10231 useless extension candidates. Maximal degree in co-relation 43925. Up to 3677 conditions per place. 
[2020-10-11 18:17:41,853 INFO  L132   encePairwiseOnDemand]: 100/110 looper letters, 19 selfloop transitions, 57 changer transitions 16/201 dead transitions.
[2020-10-11 18:17:41,854 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 201 transitions, 1655 flow
[2020-10-11 18:17:41,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-10-11 18:17:41,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-10-11 18:17:41,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1516 transitions.
[2020-10-11 18:17:41,857 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9187878787878788
[2020-10-11 18:17:41,857 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1516 transitions.
[2020-10-11 18:17:41,857 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1516 transitions.
[2020-10-11 18:17:41,858 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:41,858 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1516 transitions.
[2020-10-11 18:17:41,860 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 16 states.
[2020-10-11 18:17:41,862 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states.
[2020-10-11 18:17:41,862 INFO  L81            ComplementDD]: Finished complementDD. Result 16 states.
[2020-10-11 18:17:41,862 INFO  L185             Difference]: Start difference. First operand has 179 places, 164 transitions, 1089 flow. Second operand 15 states and 1516 transitions.
[2020-10-11 18:17:41,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 201 transitions, 1655 flow
[2020-10-11 18:17:42,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 201 transitions, 1601 flow, removed 23 selfloop flow, removed 2 redundant places.
[2020-10-11 18:17:42,143 INFO  L241             Difference]: Finished difference. Result has 194 places, 181 transitions, 1399 flow
[2020-10-11 18:17:42,144 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1399, PETRI_PLACES=194, PETRI_TRANSITIONS=181}
[2020-10-11 18:17:42,144 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 77 predicate places.
[2020-10-11 18:17:42,144 INFO  L481      AbstractCegarLoop]: Abstraction has has 194 places, 181 transitions, 1399 flow
[2020-10-11 18:17:42,144 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 18:17:42,144 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:42,144 INFO  L255   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]
[2020-10-11 18:17:42,145 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-11 18:17:42,145 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:42,145 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:42,145 INFO  L82        PathProgramCache]: Analyzing trace with hash -1223374241, now seen corresponding path program 1 times
[2020-10-11 18:17:42,145 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:42,145 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985736699]
[2020-10-11 18:17:42,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:42,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:42,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:42,298 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985736699]
[2020-10-11 18:17:42,301 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:42,301 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-10-11 18:17:42,301 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564309210]
[2020-10-11 18:17:42,302 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 18:17:42,302 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:42,303 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 18:17:42,307 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-10-11 18:17:42,586 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110
[2020-10-11 18:17:42,587 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 181 transitions, 1399 flow. Second operand 9 states.
[2020-10-11 18:17:42,587 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:42,587 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110
[2020-10-11 18:17:42,587 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:45,010 INFO  L129       PetriNetUnfolder]: 3982/8764 cut-off events.
[2020-10-11 18:17:45,010 INFO  L130       PetriNetUnfolder]: For 82722/133425 co-relation queries the response was YES.
[2020-10-11 18:17:45,098 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 46663 conditions, 8764 events. 3982/8764 cut-off events. For 82722/133425 co-relation queries the response was YES. Maximal size of possible extension queue 1558. Compared 95118 event pairs, 2 based on Foata normal form. 2054/9650 useless extension candidates. Maximal degree in co-relation 46604. Up to 3345 conditions per place. 
[2020-10-11 18:17:45,134 INFO  L132   encePairwiseOnDemand]: 100/110 looper letters, 12 selfloop transitions, 63 changer transitions 21/205 dead transitions.
[2020-10-11 18:17:45,134 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 205 transitions, 1820 flow
[2020-10-11 18:17:45,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2020-10-11 18:17:45,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2020-10-11 18:17:45,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1804 transitions.
[2020-10-11 18:17:45,137 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9111111111111111
[2020-10-11 18:17:45,137 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1804 transitions.
[2020-10-11 18:17:45,137 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1804 transitions.
[2020-10-11 18:17:45,138 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:45,138 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1804 transitions.
[2020-10-11 18:17:45,140 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 19 states.
[2020-10-11 18:17:45,142 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states.
[2020-10-11 18:17:45,142 INFO  L81            ComplementDD]: Finished complementDD. Result 19 states.
[2020-10-11 18:17:45,143 INFO  L185             Difference]: Start difference. First operand has 194 places, 181 transitions, 1399 flow. Second operand 18 states and 1804 transitions.
[2020-10-11 18:17:45,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 205 transitions, 1820 flow
[2020-10-11 18:17:47,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 205 transitions, 1332 flow, removed 199 selfloop flow, removed 25 redundant places.
[2020-10-11 18:17:47,456 INFO  L241             Difference]: Finished difference. Result has 186 places, 180 transitions, 1147 flow
[2020-10-11 18:17:47,457 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1147, PETRI_PLACES=186, PETRI_TRANSITIONS=180}
[2020-10-11 18:17:47,457 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 69 predicate places.
[2020-10-11 18:17:47,457 INFO  L481      AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 1147 flow
[2020-10-11 18:17:47,457 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 18:17:47,457 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:47,457 INFO  L255   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]
[2020-10-11 18:17:47,458 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-11 18:17:47,458 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:47,458 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:47,458 INFO  L82        PathProgramCache]: Analyzing trace with hash 648006851, now seen corresponding path program 1 times
[2020-10-11 18:17:47,458 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:47,459 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567443506]
[2020-10-11 18:17:47,459 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:47,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 18:17:47,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 18:17:47,589 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567443506]
[2020-10-11 18:17:47,590 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 18:17:47,590 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 18:17:47,590 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957824645]
[2020-10-11 18:17:47,591 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 18:17:47,591 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 18:17:47,592 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 18:17:47,592 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-10-11 18:17:47,822 INFO  L506   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 110
[2020-10-11 18:17:47,822 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 180 transitions, 1147 flow. Second operand 7 states.
[2020-10-11 18:17:47,822 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-11 18:17:47,823 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 110
[2020-10-11 18:17:47,823 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-11 18:17:49,639 INFO  L129       PetriNetUnfolder]: 5744/15143 cut-off events.
[2020-10-11 18:17:49,639 INFO  L130       PetriNetUnfolder]: For 38139/43644 co-relation queries the response was YES.
[2020-10-11 18:17:49,863 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 50056 conditions, 15143 events. 5744/15143 cut-off events. For 38139/43644 co-relation queries the response was YES. Maximal size of possible extension queue 2514. Compared 197972 event pairs, 5 based on Foata normal form. 10/13411 useless extension candidates. Maximal degree in co-relation 49964. Up to 1940 conditions per place. 
[2020-10-11 18:17:49,911 INFO  L132   encePairwiseOnDemand]: 104/110 looper letters, 9 selfloop transitions, 2 changer transitions 4/185 dead transitions.
[2020-10-11 18:17:49,911 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 185 transitions, 1193 flow
[2020-10-11 18:17:49,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 18:17:49,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-11 18:17:49,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 702 transitions.
[2020-10-11 18:17:49,912 INFO  L551   CegarLoopForPetriNet]: DFA transition density 0.9116883116883117
[2020-10-11 18:17:49,912 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 702 transitions.
[2020-10-11 18:17:49,913 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 702 transitions.
[2020-10-11 18:17:49,913 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-11 18:17:49,913 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 702 transitions.
[2020-10-11 18:17:49,914 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-11 18:17:49,915 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-11 18:17:49,915 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-11 18:17:49,915 INFO  L185             Difference]: Start difference. First operand has 186 places, 180 transitions, 1147 flow. Second operand 7 states and 702 transitions.
[2020-10-11 18:17:49,915 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 185 transitions, 1193 flow
[2020-10-11 18:17:52,851 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 185 transitions, 1059 flow, removed 19 selfloop flow, removed 20 redundant places.
[2020-10-11 18:17:52,854 INFO  L241             Difference]: Finished difference. Result has 175 places, 181 transitions, 1032 flow
[2020-10-11 18:17:52,855 INFO  L325   CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1032, PETRI_PLACES=175, PETRI_TRANSITIONS=181}
[2020-10-11 18:17:52,855 INFO  L341   CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places.
[2020-10-11 18:17:52,855 INFO  L481      AbstractCegarLoop]: Abstraction has has 175 places, 181 transitions, 1032 flow
[2020-10-11 18:17:52,855 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 18:17:52,855 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-11 18:17:52,855 INFO  L255   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]
[2020-10-11 18:17:52,855 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-11 18:17:52,856 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 18:17:52,856 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 18:17:52,856 INFO  L82        PathProgramCache]: Analyzing trace with hash 1301004223, now seen corresponding path program 2 times
[2020-10-11 18:17:52,856 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 18:17:52,857 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224333289]
[2020-10-11 18:17:52,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 18:17:52,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 18:17:52,896 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 18:17:52,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 18:17:52,936 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 18:17:52,985 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 18:17:52,985 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 18:17:52,985 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-11 18:17:53,032 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,033 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,035 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,035 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,035 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,035 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,036 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,036 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,036 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,036 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,036 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,036 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,037 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,037 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,037 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,037 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,037 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,037 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,038 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,038 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,038 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,038 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,038 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,038 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,039 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,039 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,039 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,039 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,039 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,040 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,040 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,040 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,040 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,040 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,040 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,040 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,041 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,042 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,042 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,042 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,042 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,042 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,042 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,043 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,043 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,043 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,043 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,043 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,043 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,044 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,044 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,044 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,044 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,044 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,044 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,045 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,045 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,045 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,045 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,045 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,045 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,045 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,046 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,046 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,046 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,046 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,046 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,047 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,047 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,047 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,047 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 18:17:53,047 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 18:17:53,156 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:17:53 BasicIcfg
[2020-10-11 18:17:53,156 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 18:17:53,159 INFO  L168              Benchmark]: Toolchain (without parser) took 39370.47 ms. Allocated memory was 250.1 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 204.3 MB in the beginning and 930.7 MB in the end (delta: -726.4 MB). Peak memory consumption was 733.7 MB. Max. memory is 14.2 GB.
[2020-10-11 18:17:53,159 INFO  L168              Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 18:17:53,160 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 783.12 ms. Allocated memory was 250.1 MB in the beginning and 310.9 MB in the end (delta: 60.8 MB). Free memory was 204.3 MB in the beginning and 259.0 MB in the end (delta: -54.7 MB). Peak memory consumption was 32.3 MB. Max. memory is 14.2 GB.
[2020-10-11 18:17:53,160 INFO  L168              Benchmark]: Boogie Procedure Inliner took 69.40 ms. Allocated memory is still 310.9 MB. Free memory was 259.0 MB in the beginning and 256.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 18:17:53,161 INFO  L168              Benchmark]: Boogie Preprocessor took 42.79 ms. Allocated memory is still 310.9 MB. Free memory was 256.5 MB in the beginning and 254.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 18:17:53,162 INFO  L168              Benchmark]: RCFGBuilder took 2213.96 ms. Allocated memory was 310.9 MB in the beginning and 356.5 MB in the end (delta: 45.6 MB). Free memory was 254.0 MB in the beginning and 177.1 MB in the end (delta: 76.9 MB). Peak memory consumption was 122.5 MB. Max. memory is 14.2 GB.
[2020-10-11 18:17:53,163 INFO  L168              Benchmark]: TraceAbstraction took 36255.31 ms. Allocated memory was 356.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 177.1 MB in the beginning and 930.7 MB in the end (delta: -753.7 MB). Peak memory consumption was 600.1 MB. Max. memory is 14.2 GB.
[2020-10-11 18:17:53,166 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 1.42 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 783.12 ms. Allocated memory was 250.1 MB in the beginning and 310.9 MB in the end (delta: 60.8 MB). Free memory was 204.3 MB in the beginning and 259.0 MB in the end (delta: -54.7 MB). Peak memory consumption was 32.3 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 69.40 ms. Allocated memory is still 310.9 MB. Free memory was 259.0 MB in the beginning and 256.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 42.79 ms. Allocated memory is still 310.9 MB. Free memory was 256.5 MB in the beginning and 254.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2213.96 ms. Allocated memory was 310.9 MB in the beginning and 356.5 MB in the end (delta: 45.6 MB). Free memory was 254.0 MB in the beginning and 177.1 MB in the end (delta: 76.9 MB). Peak memory consumption was 122.5 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 36255.31 ms. Allocated memory was 356.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 177.1 MB in the beginning and 930.7 MB in the end (delta: -753.7 MB). Peak memory consumption was 600.1 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L701]               0  int __unbuffered_p3_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0]
[L703]               0  int __unbuffered_p3_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0]
[L705]               0  int a = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0]
[L706]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0]
[L707]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L709]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L711]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L712]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L713]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L714]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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]
[L715]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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]
[L716]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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]
[L717]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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]
[L718]               0  _Bool y$r_buff0_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0]
[L719]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0]
[L720]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L721]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L722]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L723]               0  _Bool y$r_buff1_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0]
[L724]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0]
[L725]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L726]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L727]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L728]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L729]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L731]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L732]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L733]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L833]               0  pthread_t t821;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L834]  FCALL, FORK  0  pthread_create(&t821, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L835]               0  pthread_t t822;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L836]  FCALL, FORK  0  pthread_create(&t822, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L837]               0  pthread_t t823;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L838]  FCALL, FORK  0  pthread_create(&t823, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L772]               3  y$w_buff1 = y$w_buff0
[L773]               3  y$w_buff0 = 2
[L774]               3  y$w_buff1_used = y$w_buff0_used
[L775]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L777]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L778]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L779]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L780]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L781]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L782]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L839]               0  pthread_t t824;
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L840]  FCALL, FORK  0  pthread_create(&t824, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0]
[L785]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1]
[L802]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L805]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L808]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L737]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L740]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L752]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L755]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L788]  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)
[L788]               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)
[L789]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L789]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L790]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L790]               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
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L791]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L792]               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
[L745]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L758]  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)
[L758]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L758]  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)
[L758]               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)
[L759]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L759]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L760]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L760]               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
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L761]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L762]               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
[L765]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L795]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L811]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L811]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L811]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L811]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L812]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L812]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L813]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L814]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L814]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L815]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L815]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L818]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L842]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L3]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L846]  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)
[L846]               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)
[L847]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L847]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L848]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L848]               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
[L849]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L849]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L850]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L850]               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
[L853]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L854]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L855]               0  y$flush_delayed = weak$$choice2
[L856]               0  y$mem_tmp = y
[L857]  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)
[L857]               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)
[L858]  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))
[L858]  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)
[L858]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0
[L858]  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)
[L858]  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))
[L858]               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))
[L859]  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))
[L859]               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))
[L860]  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))
[L860]  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)
[L860]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L860]  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)
[L860]  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))
[L860]               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))
[L861]  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))
[L861]               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))
[L862]  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))
[L862]               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))
[L863]  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))
[L863]  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)
[L863]  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))
[L863]               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))
[L864]               0  main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L865]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L865]               0  y = y$flush_delayed ? y$mem_tmp : y
[L866]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L7]    COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]
[L7]                 0  __VERIFIER_error()
        VAL             [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 35.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 31.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 617 SDtfs, 785 SDslu, 2284 SDs, 0 SdLazy, 2358 SolverSat, 457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1399occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1265 NumberOfCodeBlocks, 1265 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1166 ConstructedInterpolants, 0 QuantifiedInterpolants, 406481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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!
Received shutdown request...