/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/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-16 01:19:40,396 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 01:19:40,399 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 01:19:40,422 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 01:19:40,423 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 01:19:40,424 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 01:19:40,425 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 01:19:40,427 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 01:19:40,429 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 01:19:40,430 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 01:19:40,431 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 01:19:40,432 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 01:19:40,432 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 01:19:40,433 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 01:19:40,434 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 01:19:40,435 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 01:19:40,436 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 01:19:40,437 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 01:19:40,439 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 01:19:40,441 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 01:19:40,442 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 01:19:40,443 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 01:19:40,445 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 01:19:40,446 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 01:19:40,448 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 01:19:40,449 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 01:19:40,449 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 01:19:40,450 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 01:19:40,450 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 01:19:40,451 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 01:19:40,451 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 01:19:40,452 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 01:19:40,453 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 01:19:40,454 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 01:19:40,455 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 01:19:40,455 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 01:19:40,456 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 01:19:40,456 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 01:19:40,456 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 01:19:40,457 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 01:19:40,458 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 01:19:40,459 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf
[2020-10-16 01:19:40,481 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 01:19:40,481 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 01:19:40,482 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 01:19:40,483 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 01:19:40,483 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 01:19:40,483 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 01:19:40,483 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 01:19:40,484 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 01:19:40,484 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 01:19:40,484 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 01:19:40,485 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 01:19:40,485 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 01:19:40,486 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 01:19:40,486 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 01:19:40,486 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 01:19:40,486 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 01:19:40,486 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 01:19:40,487 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 01:19:40,487 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 01:19:40,490 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 01:19:40,490 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 01:19:40,491 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 01:19:40,491 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 01:19:40,491 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 01:19:40,491 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 01:19:40,491 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 01:19:40,492 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 01:19:40,492 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2020-10-16 01:19:40,492 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 01:19:40,813 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 01:19:40,823 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 01:19:40,827 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 01:19:40,828 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 01:19:40,828 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 01:19:40,829 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i
[2020-10-16 01:19:40,876 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2680151a/7fb43fad420f4be98e5766fb007f57d1/FLAGa8b7c0142
[2020-10-16 01:19:41,398 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 01:19:41,398 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i
[2020-10-16 01:19:41,433 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2680151a/7fb43fad420f4be98e5766fb007f57d1/FLAGa8b7c0142
[2020-10-16 01:19:41,675 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2680151a/7fb43fad420f4be98e5766fb007f57d1
[2020-10-16 01:19:41,683 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 01:19:41,684 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 01:19:41,685 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 01:19:41,685 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 01:19:41,689 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 01:19:41,690 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:19:41" (1/1) ...
[2020-10-16 01:19:41,692 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adf83c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:41, skipping insertion in model container
[2020-10-16 01:19:41,693 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:19:41" (1/1) ...
[2020-10-16 01:19:41,700 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 01:19:41,745 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 01:19:42,318 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:19:42,341 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 01:19:42,457 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 01:19:42,561 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 01:19:42,562 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42 WrapperNode
[2020-10-16 01:19:42,563 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 01:19:42,564 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 01:19:42,564 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 01:19:42,564 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 01:19:42,573 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,617 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,672 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 01:19:42,673 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 01:19:42,675 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 01:19:42,675 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 01:19:42,685 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,686 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,692 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,693 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,704 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,707 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,712 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (1/1) ...
[2020-10-16 01:19:42,717 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 01:19:42,718 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 01:19:42,718 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 01:19:42,718 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 01:19:42,719 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (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-16 01:19:42,785 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 01:19:42,785 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 01:19:42,785 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 01:19:42,785 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 01:19:42,786 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 01:19:42,786 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 01:19:42,786 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 01:19:42,786 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 01:19:42,786 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 01:19:42,786 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 01:19:42,787 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 01:19:42,787 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 01:19:42,787 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 01:19:42,787 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 01:19:42,787 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 01:19:42,789 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 01:19:45,047 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 01:19:45,047 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 01:19:45,049 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:19:45 BoogieIcfgContainer
[2020-10-16 01:19:45,050 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 01:19:45,051 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 01:19:45,051 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 01:19:45,055 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 01:19:45,055 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:19:41" (1/3) ...
[2020-10-16 01:19:45,056 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37390fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:19:45, skipping insertion in model container
[2020-10-16 01:19:45,057 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:19:42" (2/3) ...
[2020-10-16 01:19:45,057 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37390fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:19:45, skipping insertion in model container
[2020-10-16 01:19:45,057 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:19:45" (3/3) ...
[2020-10-16 01:19:45,059 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i
[2020-10-16 01:19:45,071 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 01:19:45,079 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 01:19:45,080 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 01:19:45,114 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,115 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,115 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,115 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,116 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,116 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,117 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,117 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,117 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,117 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,118 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,118 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,118 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,118 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,119 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,119 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,120 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,120 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,121 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,121 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,122 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,122 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,122 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,123 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,123 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,123 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,123 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,124 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,124 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,124 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,124 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,125 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,125 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,126 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,126 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,126 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,126 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,127 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,127 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,127 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,127 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,128 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,128 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,128 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,129 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,129 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,133 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,133 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,133 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,134 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,134 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,134 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,134 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,135 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,135 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,135 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,139 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,139 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,139 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,140 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,144 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,145 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,145 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,145 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,145 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,146 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,146 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,146 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,146 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,146 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,148 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,149 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,149 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,149 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,149 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,150 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,150 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,150 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,150 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,150 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,151 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,151 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 01:19:45,169 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 01:19:45,191 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 01:19:45,191 INFO  L378      AbstractCegarLoop]: Hoare is false
[2020-10-16 01:19:45,191 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 01:19:45,192 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 01:19:45,192 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 01:19:45,192 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 01:19:45,192 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 01:19:45,192 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 01:19:45,207 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-16 01:19:45,292 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-16 01:19:45,293 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:19:45,302 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 01:19:45,302 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 111 transitions, 242 flow
[2020-10-16 01:19:45,310 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 118 places, 107 transitions, 226 flow
[2020-10-16 01:19:45,313 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 01:19:45,315 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 226 flow
[2020-10-16 01:19:45,319 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 226 flow
[2020-10-16 01:19:45,319 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 226 flow
[2020-10-16 01:19:45,349 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-16 01:19:45,350 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:19:45,351 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 01:19:45,355 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2572
[2020-10-16 01:19:45,542 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:45,542 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,545 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:45,545 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:45,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:45,589 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,660 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,661 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:45,668 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,669 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,671 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,671 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,675 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,676 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:45,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:45,681 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,682 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:45,684 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:45,685 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,688 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:45,689 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,691 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:45,691 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,749 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:45,749 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,750 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:45,751 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,754 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:45,754 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:19:45,757 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:45,758 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,878 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:45,879 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,880 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:45,880 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:45,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:19:45,886 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:45,887 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,921 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:45,922 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:45,934 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,935 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,936 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,936 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,939 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,940 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:45,942 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,942 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:45,944 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:45,944 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:45,946 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:45,947 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,949 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:45,950 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:45,951 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:45,952 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,025 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,026 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,027 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,027 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,030 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:46,031 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:19:46,033 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:46,034 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,080 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:46,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:46,083 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:46,083 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,084 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:46,084 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,087 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:46,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:46,090 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:46,091 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:46,092 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:46,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:46,094 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:46,095 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,097 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,097 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,099 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,099 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,206 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,207 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,207 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,208 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,263 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,263 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,264 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,265 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,302 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,303 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,304 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,304 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,322 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,323 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,323 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,324 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,352 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,352 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,353 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,354 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,375 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,376 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,377 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,414 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,415 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,416 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,432 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,432 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,433 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,433 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,841 WARN  L193               SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 01:19:46,956 WARN  L193               SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 01:19:46,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:46,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:46,983 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:46,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,024 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,024 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,025 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:47,025 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,083 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,084 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:47,085 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 01:19:47,085 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:47,119 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,120 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,121 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:47,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,198 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,199 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:47,200 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,246 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,247 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,250 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:47,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:47,294 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:47,314 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:47,315 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,315 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:47,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,320 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:47,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:47,327 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:47,328 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:47,333 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:47,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:47,343 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:47,344 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,347 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,347 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,349 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,349 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,392 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,393 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,394 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:47,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,396 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:47,397 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:19:47,400 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:47,400 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,430 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,430 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,431 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:47,431 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,452 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:47,453 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:47,454 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:47,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:48,770 WARN  L193               SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 230 DAG size of output: 190
[2020-10-16 01:19:48,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term
[2020-10-16 01:19:48,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:48,787 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:48,787 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,166 WARN  L193               SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 148 DAG size of output: 128
[2020-10-16 01:19:50,195 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:50,195 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,196 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:50,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,215 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:50,215 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 01:19:50,216 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,256 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:50,257 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,299 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,300 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,300 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,301 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,306 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,307 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:50,309 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,309 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:50,311 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,311 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:50,313 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:50,313 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,314 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:50,315 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,317 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:50,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,354 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 01:19:50,354 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,355 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 01:19:50,355 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,357 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,358 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 01:19:50,360 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 01:19:50,360 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,751 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,751 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,751 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:19:50,752 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,752 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,752 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,753 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,753 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,754 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,755 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,755 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,756 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,758 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,758 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,760 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,760 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,761 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,761 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,779 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,779 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:50,781 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,886 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,886 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:50,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,914 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,914 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,915 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:19:50,916 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,916 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,916 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,917 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,923 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:50,927 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,928 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,929 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,931 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,935 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:50,936 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,938 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,938 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:50,940 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:50,940 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,158 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,159 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:51,160 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,161 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,187 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,187 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,188 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:19:51,188 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,189 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,189 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,190 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,190 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,192 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,192 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,194 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,194 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,204 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,204 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,207 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,208 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,209 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,209 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,293 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,294 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:19:51,295 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,296 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,296 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,297 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,297 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,298 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,299 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,300 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,301 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,302 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,302 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,303 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,304 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,304 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,305 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,327 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,328 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:51,329 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,330 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,519 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,520 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:19:51,521 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,521 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,521 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,522 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:51,525 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,526 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,527 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,528 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,530 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,530 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,532 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,536 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:51,536 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,553 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,554 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:51,555 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:51,556 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:51,724 WARN  L193               SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 01:19:51,830 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 01:19:52,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:52,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 01:19:52,097 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:52,097 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:52,152 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:52,153 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:52,153 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 01:19:52,154 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:52,154 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:52,155 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:52,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:52,156 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:52,157 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:52,157 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:52,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:52,159 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:52,161 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 01:19:52,161 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:52,164 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:52,164 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:52,165 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:52,166 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:53,184 WARN  L193               SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113
[2020-10-16 01:19:53,534 WARN  L193               SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2020-10-16 01:19:53,942 WARN  L193               SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 01:19:54,056 WARN  L193               SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 01:19:55,320 WARN  L193               SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 147 DAG size of output: 137
[2020-10-16 01:19:55,920 WARN  L193               SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-16 01:19:55,927 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:19:55,927 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:55,971 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:19:55,972 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,040 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:56,041 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:56,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:56,044 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:56,044 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:56,045 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:56,059 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:56,059 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,059 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:56,060 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,061 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:56,061 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:19:56,063 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:56,064 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:19:56,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:19:56,089 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,126 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:56,127 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,127 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:56,128 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,131 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:56,132 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:19:56,133 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:56,133 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 01:19:56,150 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:56,150 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,151 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:56,151 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,152 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 01:19:56,153 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:56,154 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 01:19:56,154 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 01:19:56,175 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 01:19:56,176 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 01:19:56,517 WARN  L193               SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-16 01:19:56,670 WARN  L193               SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-16 01:19:56,725 INFO  L132        LiptonReduction]: Checked pairs total: 7754
[2020-10-16 01:19:56,725 INFO  L134        LiptonReduction]: Total number of compositions: 91
[2020-10-16 01:19:56,728 INFO  L182   CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11418
[2020-10-16 01:19:56,735 INFO  L129       PetriNetUnfolder]: 0/11 cut-off events.
[2020-10-16 01:19:56,735 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:19:56,736 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:56,737 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:56,737 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-16 01:19:56,743 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:56,743 INFO  L82        PathProgramCache]: Analyzing trace with hash 51217074, now seen corresponding path program 1 times
[2020-10-16 01:19:56,753 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:56,753 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357328942]
[2020-10-16 01:19:56,754 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:56,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:56,985 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-16 01:19:56,985 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357328942]
[2020-10-16 01:19:56,986 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:56,986 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:19:56,987 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742076920]
[2020-10-16 01:19:56,997 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:19:56,997 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:57,012 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:19:57,014 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:19:57,016 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202
[2020-10-16 01:19:57,018 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states.
[2020-10-16 01:19:57,019 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:57,019 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202
[2020-10-16 01:19:57,020 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:57,136 INFO  L129       PetriNetUnfolder]: 69/146 cut-off events.
[2020-10-16 01:19:57,136 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:19:57,137 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 277 conditions, 146 events. 69/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 610 event pairs, 39 based on Foata normal form. 11/139 useless extension candidates. Maximal degree in co-relation 266. Up to 89 conditions per place. 
[2020-10-16 01:19:57,139 INFO  L132   encePairwiseOnDemand]: 198/202 looper letters, 9 selfloop transitions, 2 changer transitions 2/33 dead transitions.
[2020-10-16 01:19:57,139 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 104 flow
[2020-10-16 01:19:57,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:19:57,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:19:57,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions.
[2020-10-16 01:19:57,158 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.858085808580858
[2020-10-16 01:19:57,159 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 520 transitions.
[2020-10-16 01:19:57,159 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions.
[2020-10-16 01:19:57,162 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:57,165 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions.
[2020-10-16 01:19:57,169 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:19:57,184 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:19:57,185 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:19:57,187 INFO  L185             Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 520 transitions.
[2020-10-16 01:19:57,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 104 flow
[2020-10-16 01:19:57,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places.
[2020-10-16 01:19:57,200 INFO  L241             Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow
[2020-10-16 01:19:57,202 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27}
[2020-10-16 01:19:57,203 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places.
[2020-10-16 01:19:57,203 INFO  L481      AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow
[2020-10-16 01:19:57,203 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:19:57,203 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:57,203 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:57,204 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 01:19:57,204 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-16 01:19:57,204 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:57,204 INFO  L82        PathProgramCache]: Analyzing trace with hash -386244637, now seen corresponding path program 1 times
[2020-10-16 01:19:57,204 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:57,204 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690777129]
[2020-10-16 01:19:57,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:57,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:57,344 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-16 01:19:57,345 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690777129]
[2020-10-16 01:19:57,345 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:57,345 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 01:19:57,345 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359976518]
[2020-10-16 01:19:57,349 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 01:19:57,350 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:57,350 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 01:19:57,350 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 01:19:57,352 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 182 out of 202
[2020-10-16 01:19:57,352 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states.
[2020-10-16 01:19:57,353 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:57,353 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 202
[2020-10-16 01:19:57,353 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:57,367 INFO  L129       PetriNetUnfolder]: 0/27 cut-off events.
[2020-10-16 01:19:57,367 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 01:19:57,368 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 43 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. 
[2020-10-16 01:19:57,368 INFO  L132   encePairwiseOnDemand]: 199/202 looper letters, 1 selfloop transitions, 2 changer transitions 0/27 dead transitions.
[2020-10-16 01:19:57,368 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 72 flow
[2020-10-16 01:19:57,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 01:19:57,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-10-16 01:19:57,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions.
[2020-10-16 01:19:57,373 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.9075907590759076
[2020-10-16 01:19:57,373 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 550 transitions.
[2020-10-16 01:19:57,373 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions.
[2020-10-16 01:19:57,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:57,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions.
[2020-10-16 01:19:57,375 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 4 states.
[2020-10-16 01:19:57,379 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states.
[2020-10-16 01:19:57,379 INFO  L81            ComplementDD]: Finished complementDD. Result 4 states.
[2020-10-16 01:19:57,379 INFO  L185             Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 550 transitions.
[2020-10-16 01:19:57,379 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 72 flow
[2020-10-16 01:19:57,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:19:57,381 INFO  L241             Difference]: Finished difference. Result has 39 places, 27 transitions, 70 flow
[2020-10-16 01:19:57,381 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=27}
[2020-10-16 01:19:57,381 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places.
[2020-10-16 01:19:57,382 INFO  L481      AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow
[2020-10-16 01:19:57,382 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 01:19:57,382 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:57,382 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:57,382 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 01:19:57,382 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-16 01:19:57,383 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:57,383 INFO  L82        PathProgramCache]: Analyzing trace with hash -1834993487, now seen corresponding path program 1 times
[2020-10-16 01:19:57,383 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:57,383 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552149008]
[2020-10-16 01:19:57,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:57,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:57,501 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-16 01:19:57,501 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552149008]
[2020-10-16 01:19:57,501 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:57,502 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:19:57,502 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100938968]
[2020-10-16 01:19:57,502 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:19:57,502 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:57,503 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:19:57,503 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:19:57,504 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 202
[2020-10-16 01:19:57,505 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand 4 states.
[2020-10-16 01:19:57,505 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:57,505 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 202
[2020-10-16 01:19:57,505 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:57,667 INFO  L129       PetriNetUnfolder]: 277/482 cut-off events.
[2020-10-16 01:19:57,667 INFO  L130       PetriNetUnfolder]: For 20/20 co-relation queries the response was YES.
[2020-10-16 01:19:57,670 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 950 conditions, 482 events. 277/482 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2340 event pairs, 135 based on Foata normal form. 8/461 useless extension candidates. Maximal degree in co-relation 940. Up to 381 conditions per place. 
[2020-10-16 01:19:57,675 INFO  L132   encePairwiseOnDemand]: 196/202 looper letters, 15 selfloop transitions, 6 changer transitions 0/38 dead transitions.
[2020-10-16 01:19:57,675 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 134 flow
[2020-10-16 01:19:57,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:19:57,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:19:57,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions.
[2020-10-16 01:19:57,679 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7957920792079208
[2020-10-16 01:19:57,679 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 643 transitions.
[2020-10-16 01:19:57,679 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions.
[2020-10-16 01:19:57,680 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:57,680 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions.
[2020-10-16 01:19:57,682 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:19:57,684 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:19:57,684 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:19:57,684 INFO  L185             Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 4 states and 643 transitions.
[2020-10-16 01:19:57,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 134 flow
[2020-10-16 01:19:57,685 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places.
[2020-10-16 01:19:57,729 INFO  L241             Difference]: Finished difference. Result has 42 places, 32 transitions, 108 flow
[2020-10-16 01:19:57,729 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=32}
[2020-10-16 01:19:57,730 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2020-10-16 01:19:57,730 INFO  L481      AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 108 flow
[2020-10-16 01:19:57,730 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:19:57,730 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:57,730 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:57,730 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 01:19:57,730 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-16 01:19:57,731 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:57,731 INFO  L82        PathProgramCache]: Analyzing trace with hash -428080417, now seen corresponding path program 1 times
[2020-10-16 01:19:57,731 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:57,731 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714204025]
[2020-10-16 01:19:57,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:57,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:57,826 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-16 01:19:57,826 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714204025]
[2020-10-16 01:19:57,827 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:57,827 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:19:57,827 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911739076]
[2020-10-16 01:19:57,827 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:19:57,828 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:57,828 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:19:57,828 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:19:57,829 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 202
[2020-10-16 01:19:57,830 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 108 flow. Second operand 5 states.
[2020-10-16 01:19:57,830 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:57,830 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 202
[2020-10-16 01:19:57,830 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:58,024 INFO  L129       PetriNetUnfolder]: 317/606 cut-off events.
[2020-10-16 01:19:58,024 INFO  L130       PetriNetUnfolder]: For 393/405 co-relation queries the response was YES.
[2020-10-16 01:19:58,027 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 606 events. 317/606 cut-off events. For 393/405 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3352 event pairs, 114 based on Foata normal form. 29/601 useless extension candidates. Maximal degree in co-relation 1435. Up to 281 conditions per place. 
[2020-10-16 01:19:58,030 INFO  L132   encePairwiseOnDemand]: 194/202 looper letters, 19 selfloop transitions, 14 changer transitions 1/51 dead transitions.
[2020-10-16 01:19:58,031 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 241 flow
[2020-10-16 01:19:58,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:19:58,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:19:58,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 803 transitions.
[2020-10-16 01:19:58,034 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7950495049504951
[2020-10-16 01:19:58,035 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 803 transitions.
[2020-10-16 01:19:58,035 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 803 transitions.
[2020-10-16 01:19:58,035 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:58,036 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 803 transitions.
[2020-10-16 01:19:58,037 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:19:58,039 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:19:58,040 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:19:58,040 INFO  L185             Difference]: Start difference. First operand has 42 places, 32 transitions, 108 flow. Second operand 5 states and 803 transitions.
[2020-10-16 01:19:58,040 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 241 flow
[2020-10-16 01:19:58,042 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 241 flow, removed 0 selfloop flow, removed 0 redundant places.
[2020-10-16 01:19:58,043 INFO  L241             Difference]: Finished difference. Result has 49 places, 43 transitions, 215 flow
[2020-10-16 01:19:58,043 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=49, PETRI_TRANSITIONS=43}
[2020-10-16 01:19:58,043 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2020-10-16 01:19:58,044 INFO  L481      AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 215 flow
[2020-10-16 01:19:58,044 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:19:58,044 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:58,044 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:58,044 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 01:19:58,044 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-16 01:19:58,044 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:58,045 INFO  L82        PathProgramCache]: Analyzing trace with hash 783776947, now seen corresponding path program 1 times
[2020-10-16 01:19:58,045 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:58,045 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796345311]
[2020-10-16 01:19:58,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:58,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:58,118 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-16 01:19:58,118 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796345311]
[2020-10-16 01:19:58,118 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:58,119 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 01:19:58,119 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079087105]
[2020-10-16 01:19:58,119 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:19:58,120 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:58,120 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:19:58,120 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:19:58,121 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202
[2020-10-16 01:19:58,122 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 215 flow. Second operand 4 states.
[2020-10-16 01:19:58,122 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:58,122 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202
[2020-10-16 01:19:58,122 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:58,278 INFO  L129       PetriNetUnfolder]: 186/403 cut-off events.
[2020-10-16 01:19:58,278 INFO  L130       PetriNetUnfolder]: For 711/1023 co-relation queries the response was YES.
[2020-10-16 01:19:58,281 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 403 events. 186/403 cut-off events. For 711/1023 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2153 event pairs, 69 based on Foata normal form. 17/398 useless extension candidates. Maximal degree in co-relation 1259. Up to 223 conditions per place. 
[2020-10-16 01:19:58,285 INFO  L132   encePairwiseOnDemand]: 195/202 looper letters, 15 selfloop transitions, 10 changer transitions 0/51 dead transitions.
[2020-10-16 01:19:58,285 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 307 flow
[2020-10-16 01:19:58,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:19:58,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:19:58,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions.
[2020-10-16 01:19:58,290 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8143564356435643
[2020-10-16 01:19:58,291 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 658 transitions.
[2020-10-16 01:19:58,291 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions.
[2020-10-16 01:19:58,292 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:58,292 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions.
[2020-10-16 01:19:58,294 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:19:58,296 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:19:58,296 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:19:58,296 INFO  L185             Difference]: Start difference. First operand has 49 places, 43 transitions, 215 flow. Second operand 4 states and 658 transitions.
[2020-10-16 01:19:58,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 307 flow
[2020-10-16 01:19:58,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 303 flow, removed 2 selfloop flow, removed 0 redundant places.
[2020-10-16 01:19:58,301 INFO  L241             Difference]: Finished difference. Result has 53 places, 47 transitions, 262 flow
[2020-10-16 01:19:58,301 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=53, PETRI_TRANSITIONS=47}
[2020-10-16 01:19:58,301 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2020-10-16 01:19:58,302 INFO  L481      AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 262 flow
[2020-10-16 01:19:58,302 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:19:58,302 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:58,302 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:58,302 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 01:19:58,302 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-16 01:19:58,303 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:58,303 INFO  L82        PathProgramCache]: Analyzing trace with hash -708453323, now seen corresponding path program 2 times
[2020-10-16 01:19:58,303 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:58,303 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954270874]
[2020-10-16 01:19:58,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:58,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:58,408 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-16 01:19:58,408 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954270874]
[2020-10-16 01:19:58,409 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:58,409 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:19:58,409 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127203488]
[2020-10-16 01:19:58,409 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:19:58,410 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:58,410 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:19:58,410 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:19:58,411 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 154 out of 202
[2020-10-16 01:19:58,412 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 262 flow. Second operand 5 states.
[2020-10-16 01:19:58,412 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:58,412 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 202
[2020-10-16 01:19:58,412 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:58,585 INFO  L129       PetriNetUnfolder]: 182/395 cut-off events.
[2020-10-16 01:19:58,586 INFO  L130       PetriNetUnfolder]: For 930/1414 co-relation queries the response was YES.
[2020-10-16 01:19:58,588 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 395 events. 182/395 cut-off events. For 930/1414 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2122 event pairs, 67 based on Foata normal form. 25/398 useless extension candidates. Maximal degree in co-relation 1475. Up to 223 conditions per place. 
[2020-10-16 01:19:58,592 INFO  L132   encePairwiseOnDemand]: 196/202 looper letters, 16 selfloop transitions, 12 changer transitions 0/54 dead transitions.
[2020-10-16 01:19:58,592 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 368 flow
[2020-10-16 01:19:58,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:19:58,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:19:58,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions.
[2020-10-16 01:19:58,595 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7846534653465347
[2020-10-16 01:19:58,595 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 634 transitions.
[2020-10-16 01:19:58,596 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 634 transitions.
[2020-10-16 01:19:58,596 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:58,596 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 634 transitions.
[2020-10-16 01:19:58,598 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:19:58,600 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:19:58,600 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:19:58,600 INFO  L185             Difference]: Start difference. First operand has 53 places, 47 transitions, 262 flow. Second operand 4 states and 634 transitions.
[2020-10-16 01:19:58,600 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 368 flow
[2020-10-16 01:19:58,605 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 351 flow, removed 5 selfloop flow, removed 1 redundant places.
[2020-10-16 01:19:58,607 INFO  L241             Difference]: Finished difference. Result has 56 places, 50 transitions, 300 flow
[2020-10-16 01:19:58,608 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=56, PETRI_TRANSITIONS=50}
[2020-10-16 01:19:58,608 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places.
[2020-10-16 01:19:58,608 INFO  L481      AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 300 flow
[2020-10-16 01:19:58,608 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:19:58,608 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:58,609 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:58,609 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 01:19:58,609 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-16 01:19:58,609 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:58,609 INFO  L82        PathProgramCache]: Analyzing trace with hash 1514025193, now seen corresponding path program 1 times
[2020-10-16 01:19:58,610 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:58,610 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284648119]
[2020-10-16 01:19:58,610 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:58,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:58,746 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-16 01:19:58,746 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284648119]
[2020-10-16 01:19:58,747 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:58,747 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:19:58,747 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494521773]
[2020-10-16 01:19:58,747 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:19:58,748 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:58,748 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:19:58,749 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:19:58,750 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 202
[2020-10-16 01:19:58,750 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 300 flow. Second operand 5 states.
[2020-10-16 01:19:58,751 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:58,751 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 202
[2020-10-16 01:19:58,751 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:58,946 INFO  L129       PetriNetUnfolder]: 199/422 cut-off events.
[2020-10-16 01:19:58,946 INFO  L130       PetriNetUnfolder]: For 1519/2155 co-relation queries the response was YES.
[2020-10-16 01:19:58,949 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 422 events. 199/422 cut-off events. For 1519/2155 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2253 event pairs, 55 based on Foata normal form. 35/436 useless extension candidates. Maximal degree in co-relation 1722. Up to 299 conditions per place. 
[2020-10-16 01:19:58,953 INFO  L132   encePairwiseOnDemand]: 194/202 looper letters, 20 selfloop transitions, 16 changer transitions 0/62 dead transitions.
[2020-10-16 01:19:58,953 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 463 flow
[2020-10-16 01:19:58,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:19:58,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:19:58,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 802 transitions.
[2020-10-16 01:19:58,957 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7940594059405941
[2020-10-16 01:19:58,957 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 802 transitions.
[2020-10-16 01:19:58,957 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 802 transitions.
[2020-10-16 01:19:58,958 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:58,958 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 802 transitions.
[2020-10-16 01:19:58,960 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:19:58,962 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:19:58,962 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:19:58,962 INFO  L185             Difference]: Start difference. First operand has 56 places, 50 transitions, 300 flow. Second operand 5 states and 802 transitions.
[2020-10-16 01:19:58,962 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 463 flow
[2020-10-16 01:19:58,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 449 flow, removed 3 selfloop flow, removed 1 redundant places.
[2020-10-16 01:19:58,968 INFO  L241             Difference]: Finished difference. Result has 62 places, 60 transitions, 430 flow
[2020-10-16 01:19:58,968 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=62, PETRI_TRANSITIONS=60}
[2020-10-16 01:19:58,968 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places.
[2020-10-16 01:19:58,968 INFO  L481      AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 430 flow
[2020-10-16 01:19:58,968 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:19:58,969 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:58,969 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:58,969 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 01:19:58,969 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-16 01:19:58,969 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:58,969 INFO  L82        PathProgramCache]: Analyzing trace with hash -614373345, now seen corresponding path program 2 times
[2020-10-16 01:19:58,970 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:58,970 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935925895]
[2020-10-16 01:19:58,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:58,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:59,067 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-16 01:19:59,068 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935925895]
[2020-10-16 01:19:59,068 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:59,068 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:19:59,069 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814348905]
[2020-10-16 01:19:59,069 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:19:59,069 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:59,070 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:19:59,070 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:19:59,072 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 202
[2020-10-16 01:19:59,073 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 430 flow. Second operand 5 states.
[2020-10-16 01:19:59,074 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:59,074 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 202
[2020-10-16 01:19:59,074 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:59,341 INFO  L129       PetriNetUnfolder]: 204/447 cut-off events.
[2020-10-16 01:19:59,341 INFO  L130       PetriNetUnfolder]: For 2680/4111 co-relation queries the response was YES.
[2020-10-16 01:19:59,344 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 447 events. 204/447 cut-off events. For 2680/4111 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2437 event pairs, 53 based on Foata normal form. 40/466 useless extension candidates. Maximal degree in co-relation 2031. Up to 286 conditions per place. 
[2020-10-16 01:19:59,348 INFO  L132   encePairwiseOnDemand]: 196/202 looper letters, 25 selfloop transitions, 15 changer transitions 0/66 dead transitions.
[2020-10-16 01:19:59,349 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 566 flow
[2020-10-16 01:19:59,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:19:59,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:19:59,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions.
[2020-10-16 01:19:59,352 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7933168316831684
[2020-10-16 01:19:59,352 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 641 transitions.
[2020-10-16 01:19:59,352 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 641 transitions.
[2020-10-16 01:19:59,353 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:59,353 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 641 transitions.
[2020-10-16 01:19:59,354 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:19:59,356 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:19:59,356 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:19:59,356 INFO  L185             Difference]: Start difference. First operand has 62 places, 60 transitions, 430 flow. Second operand 4 states and 641 transitions.
[2020-10-16 01:19:59,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 566 flow
[2020-10-16 01:19:59,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 548 flow, removed 9 selfloop flow, removed 0 redundant places.
[2020-10-16 01:19:59,365 INFO  L241             Difference]: Finished difference. Result has 66 places, 63 transitions, 486 flow
[2020-10-16 01:19:59,365 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=486, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2020-10-16 01:19:59,366 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places.
[2020-10-16 01:19:59,366 INFO  L481      AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 486 flow
[2020-10-16 01:19:59,366 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:19:59,366 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:59,366 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:59,366 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 01:19:59,368 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-16 01:19:59,368 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:59,368 INFO  L82        PathProgramCache]: Analyzing trace with hash -1477872604, now seen corresponding path program 1 times
[2020-10-16 01:19:59,368 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:59,369 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976262065]
[2020-10-16 01:19:59,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:59,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:19:59,656 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-16 01:19:59,657 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976262065]
[2020-10-16 01:19:59,657 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:19:59,658 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:19:59,658 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123258556]
[2020-10-16 01:19:59,658 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:19:59,659 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:19:59,659 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:19:59,659 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:19:59,662 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 202
[2020-10-16 01:19:59,663 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 486 flow. Second operand 6 states.
[2020-10-16 01:19:59,663 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:19:59,663 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 202
[2020-10-16 01:19:59,663 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:19:59,940 INFO  L129       PetriNetUnfolder]: 194/423 cut-off events.
[2020-10-16 01:19:59,941 INFO  L130       PetriNetUnfolder]: For 3076/4798 co-relation queries the response was YES.
[2020-10-16 01:19:59,943 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 423 events. 194/423 cut-off events. For 3076/4798 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2268 event pairs, 49 based on Foata normal form. 44/447 useless extension candidates. Maximal degree in co-relation 2087. Up to 244 conditions per place. 
[2020-10-16 01:19:59,948 INFO  L132   encePairwiseOnDemand]: 198/202 looper letters, 32 selfloop transitions, 10 changer transitions 0/68 dead transitions.
[2020-10-16 01:19:59,948 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 626 flow
[2020-10-16 01:19:59,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:19:59,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:19:59,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions.
[2020-10-16 01:19:59,951 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7920792079207921
[2020-10-16 01:19:59,951 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 640 transitions.
[2020-10-16 01:19:59,951 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 640 transitions.
[2020-10-16 01:19:59,952 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:19:59,952 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 640 transitions.
[2020-10-16 01:19:59,953 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:19:59,955 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:19:59,955 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:19:59,955 INFO  L185             Difference]: Start difference. First operand has 66 places, 63 transitions, 486 flow. Second operand 4 states and 640 transitions.
[2020-10-16 01:19:59,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 626 flow
[2020-10-16 01:19:59,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 600 flow, removed 4 selfloop flow, removed 2 redundant places.
[2020-10-16 01:19:59,963 INFO  L241             Difference]: Finished difference. Result has 68 places, 63 transitions, 487 flow
[2020-10-16 01:19:59,963 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=487, PETRI_PLACES=68, PETRI_TRANSITIONS=63}
[2020-10-16 01:19:59,963 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places.
[2020-10-16 01:19:59,964 INFO  L481      AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 487 flow
[2020-10-16 01:19:59,964 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:19:59,964 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:19:59,964 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:19:59,964 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 01:19:59,964 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-16 01:19:59,964 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:19:59,965 INFO  L82        PathProgramCache]: Analyzing trace with hash -643745599, now seen corresponding path program 1 times
[2020-10-16 01:19:59,965 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:19:59,969 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212921083]
[2020-10-16 01:19:59,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:19:59,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:00,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-16 01:20:00,063 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212921083]
[2020-10-16 01:20:00,063 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:00,063 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:20:00,063 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670500614]
[2020-10-16 01:20:00,064 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:20:00,064 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:00,064 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:20:00,064 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:20:00,066 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 202
[2020-10-16 01:20:00,067 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 487 flow. Second operand 6 states.
[2020-10-16 01:20:00,067 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:00,067 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 202
[2020-10-16 01:20:00,068 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:00,290 INFO  L129       PetriNetUnfolder]: 204/451 cut-off events.
[2020-10-16 01:20:00,290 INFO  L130       PetriNetUnfolder]: For 3124/4801 co-relation queries the response was YES.
[2020-10-16 01:20:00,294 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 451 events. 204/451 cut-off events. For 3124/4801 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2473 event pairs, 19 based on Foata normal form. 55/487 useless extension candidates. Maximal degree in co-relation 2186. Up to 248 conditions per place. 
[2020-10-16 01:20:00,300 INFO  L132   encePairwiseOnDemand]: 194/202 looper letters, 28 selfloop transitions, 16 changer transitions 0/70 dead transitions.
[2020-10-16 01:20:00,300 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 647 flow
[2020-10-16 01:20:00,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:20:00,301 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:20:00,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 801 transitions.
[2020-10-16 01:20:00,306 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7930693069306931
[2020-10-16 01:20:00,306 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 801 transitions.
[2020-10-16 01:20:00,306 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 801 transitions.
[2020-10-16 01:20:00,307 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:00,307 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 801 transitions.
[2020-10-16 01:20:00,309 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:20:00,311 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:20:00,312 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:20:00,312 INFO  L185             Difference]: Start difference. First operand has 68 places, 63 transitions, 487 flow. Second operand 5 states and 801 transitions.
[2020-10-16 01:20:00,312 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 647 flow
[2020-10-16 01:20:00,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 623 flow, removed 1 selfloop flow, removed 3 redundant places.
[2020-10-16 01:20:00,322 INFO  L241             Difference]: Finished difference. Result has 70 places, 66 transitions, 537 flow
[2020-10-16 01:20:00,323 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=70, PETRI_TRANSITIONS=66}
[2020-10-16 01:20:00,323 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places.
[2020-10-16 01:20:00,323 INFO  L481      AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 537 flow
[2020-10-16 01:20:00,323 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:20:00,323 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:00,324 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:20:00,324 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 01:20:00,324 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-16 01:20:00,324 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:00,324 INFO  L82        PathProgramCache]: Analyzing trace with hash -486965631, now seen corresponding path program 2 times
[2020-10-16 01:20:00,324 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:00,325 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147133038]
[2020-10-16 01:20:00,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:00,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:00,516 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-16 01:20:00,517 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147133038]
[2020-10-16 01:20:00,517 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:00,517 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:20:00,518 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235058565]
[2020-10-16 01:20:00,518 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:20:00,518 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:00,519 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:20:00,519 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:20:00,521 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 202
[2020-10-16 01:20:00,523 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 537 flow. Second operand 6 states.
[2020-10-16 01:20:00,523 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:00,523 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 202
[2020-10-16 01:20:00,523 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:00,883 INFO  L129       PetriNetUnfolder]: 212/481 cut-off events.
[2020-10-16 01:20:00,884 INFO  L130       PetriNetUnfolder]: For 4018/6397 co-relation queries the response was YES.
[2020-10-16 01:20:00,888 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 481 events. 212/481 cut-off events. For 4018/6397 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2709 event pairs, 11 based on Foata normal form. 57/519 useless extension candidates. Maximal degree in co-relation 2445. Up to 214 conditions per place. 
[2020-10-16 01:20:00,894 INFO  L132   encePairwiseOnDemand]: 195/202 looper letters, 24 selfloop transitions, 25 changer transitions 0/75 dead transitions.
[2020-10-16 01:20:00,895 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 743 flow
[2020-10-16 01:20:00,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:20:00,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:20:00,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions.
[2020-10-16 01:20:00,899 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7881188118811882
[2020-10-16 01:20:00,899 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 796 transitions.
[2020-10-16 01:20:00,899 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 796 transitions.
[2020-10-16 01:20:00,900 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:00,900 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 796 transitions.
[2020-10-16 01:20:00,902 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:20:00,904 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:20:00,904 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:20:00,904 INFO  L185             Difference]: Start difference. First operand has 70 places, 66 transitions, 537 flow. Second operand 5 states and 796 transitions.
[2020-10-16 01:20:00,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 743 flow
[2020-10-16 01:20:00,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 701 flow, removed 7 selfloop flow, removed 3 redundant places.
[2020-10-16 01:20:00,913 INFO  L241             Difference]: Finished difference. Result has 72 places, 69 transitions, 611 flow
[2020-10-16 01:20:00,914 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=611, PETRI_PLACES=72, PETRI_TRANSITIONS=69}
[2020-10-16 01:20:00,914 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places.
[2020-10-16 01:20:00,914 INFO  L481      AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 611 flow
[2020-10-16 01:20:00,914 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:20:00,914 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:00,914 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:20:00,915 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 01:20:00,915 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-16 01:20:00,915 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:00,915 INFO  L82        PathProgramCache]: Analyzing trace with hash -856724126, now seen corresponding path program 1 times
[2020-10-16 01:20:00,915 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:00,915 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456981992]
[2020-10-16 01:20:00,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:00,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:01,076 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-16 01:20:01,077 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456981992]
[2020-10-16 01:20:01,077 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:01,078 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:20:01,078 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763281234]
[2020-10-16 01:20:01,078 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:20:01,078 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:01,079 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:20:01,079 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:20:01,081 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 202
[2020-10-16 01:20:01,082 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 611 flow. Second operand 7 states.
[2020-10-16 01:20:01,082 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:01,082 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 202
[2020-10-16 01:20:01,082 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:01,467 INFO  L129       PetriNetUnfolder]: 224/511 cut-off events.
[2020-10-16 01:20:01,467 INFO  L130       PetriNetUnfolder]: For 4466/7032 co-relation queries the response was YES.
[2020-10-16 01:20:01,470 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 2851 conditions, 511 events. 224/511 cut-off events. For 4466/7032 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2966 event pairs, 13 based on Foata normal form. 87/580 useless extension candidates. Maximal degree in co-relation 2820. Up to 255 conditions per place. 
[2020-10-16 01:20:01,476 INFO  L132   encePairwiseOnDemand]: 194/202 looper letters, 25 selfloop transitions, 42 changer transitions 0/93 dead transitions.
[2020-10-16 01:20:01,476 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 93 transitions, 1045 flow
[2020-10-16 01:20:01,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 01:20:01,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-10-16 01:20:01,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1233 transitions.
[2020-10-16 01:20:01,481 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.7629950495049505
[2020-10-16 01:20:01,482 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1233 transitions.
[2020-10-16 01:20:01,482 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1233 transitions.
[2020-10-16 01:20:01,483 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:01,483 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1233 transitions.
[2020-10-16 01:20:01,486 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 9 states.
[2020-10-16 01:20:01,490 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states.
[2020-10-16 01:20:01,490 INFO  L81            ComplementDD]: Finished complementDD. Result 9 states.
[2020-10-16 01:20:01,490 INFO  L185             Difference]: Start difference. First operand has 72 places, 69 transitions, 611 flow. Second operand 8 states and 1233 transitions.
[2020-10-16 01:20:01,491 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 93 transitions, 1045 flow
[2020-10-16 01:20:01,502 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 968 flow, removed 18 selfloop flow, removed 3 redundant places.
[2020-10-16 01:20:01,506 INFO  L241             Difference]: Finished difference. Result has 81 places, 86 transitions, 915 flow
[2020-10-16 01:20:01,506 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=915, PETRI_PLACES=81, PETRI_TRANSITIONS=86}
[2020-10-16 01:20:01,507 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places.
[2020-10-16 01:20:01,507 INFO  L481      AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 915 flow
[2020-10-16 01:20:01,507 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:20:01,507 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:01,507 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:20:01,508 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 01:20:01,508 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-16 01:20:01,508 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:01,508 INFO  L82        PathProgramCache]: Analyzing trace with hash 2003634760, now seen corresponding path program 1 times
[2020-10-16 01:20:01,509 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:01,509 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261807244]
[2020-10-16 01:20:01,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:01,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:01,637 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-16 01:20:01,637 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261807244]
[2020-10-16 01:20:01,638 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:01,638 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:20:01,638 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814884454]
[2020-10-16 01:20:01,638 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:20:01,638 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:01,639 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:20:01,639 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:20:01,641 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202
[2020-10-16 01:20:01,641 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 915 flow. Second operand 4 states.
[2020-10-16 01:20:01,641 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:01,642 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202
[2020-10-16 01:20:01,642 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:02,032 INFO  L129       PetriNetUnfolder]: 937/1710 cut-off events.
[2020-10-16 01:20:02,033 INFO  L130       PetriNetUnfolder]: For 11698/13504 co-relation queries the response was YES.
[2020-10-16 01:20:02,051 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6938 conditions, 1710 events. 937/1710 cut-off events. For 11698/13504 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 11782 event pairs, 341 based on Foata normal form. 299/1825 useless extension candidates. Maximal degree in co-relation 6902. Up to 910 conditions per place. 
[2020-10-16 01:20:02,065 INFO  L132   encePairwiseOnDemand]: 195/202 looper letters, 13 selfloop transitions, 10 changer transitions 0/96 dead transitions.
[2020-10-16 01:20:02,066 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 96 transitions, 956 flow
[2020-10-16 01:20:02,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 01:20:02,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-10-16 01:20:02,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions.
[2020-10-16 01:20:02,069 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8534653465346534
[2020-10-16 01:20:02,069 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 862 transitions.
[2020-10-16 01:20:02,069 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions.
[2020-10-16 01:20:02,070 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:02,070 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions.
[2020-10-16 01:20:02,072 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 6 states.
[2020-10-16 01:20:02,074 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states.
[2020-10-16 01:20:02,074 INFO  L81            ComplementDD]: Finished complementDD. Result 6 states.
[2020-10-16 01:20:02,074 INFO  L185             Difference]: Start difference. First operand has 81 places, 86 transitions, 915 flow. Second operand 5 states and 862 transitions.
[2020-10-16 01:20:02,074 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 96 transitions, 956 flow
[2020-10-16 01:20:02,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 96 transitions, 920 flow, removed 18 selfloop flow, removed 0 redundant places.
[2020-10-16 01:20:02,096 INFO  L241             Difference]: Finished difference. Result has 88 places, 92 transitions, 935 flow
[2020-10-16 01:20:02,097 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=935, PETRI_PLACES=88, PETRI_TRANSITIONS=92}
[2020-10-16 01:20:02,097 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places.
[2020-10-16 01:20:02,097 INFO  L481      AbstractCegarLoop]: Abstraction has has 88 places, 92 transitions, 935 flow
[2020-10-16 01:20:02,097 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:20:02,097 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:02,097 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:20:02,098 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 01:20:02,098 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-16 01:20:02,098 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:02,098 INFO  L82        PathProgramCache]: Analyzing trace with hash -1499763890, now seen corresponding path program 1 times
[2020-10-16 01:20:02,098 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:02,099 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124990136]
[2020-10-16 01:20:02,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:02,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:02,261 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-16 01:20:02,261 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124990136]
[2020-10-16 01:20:02,261 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:02,262 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:20:02,262 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047494762]
[2020-10-16 01:20:02,262 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:20:02,262 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:02,262 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:20:02,263 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:20:02,264 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 202
[2020-10-16 01:20:02,265 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 935 flow. Second operand 7 states.
[2020-10-16 01:20:02,265 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:02,265 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 202
[2020-10-16 01:20:02,266 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:02,906 INFO  L129       PetriNetUnfolder]: 1318/2343 cut-off events.
[2020-10-16 01:20:02,907 INFO  L130       PetriNetUnfolder]: For 18080/22366 co-relation queries the response was YES.
[2020-10-16 01:20:02,934 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 11464 conditions, 2343 events. 1318/2343 cut-off events. For 18080/22366 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 16767 event pairs, 457 based on Foata normal form. 163/2215 useless extension candidates. Maximal degree in co-relation 11423. Up to 1436 conditions per place. 
[2020-10-16 01:20:02,954 INFO  L132   encePairwiseOnDemand]: 196/202 looper letters, 34 selfloop transitions, 31 changer transitions 0/100 dead transitions.
[2020-10-16 01:20:02,955 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 100 transitions, 1175 flow
[2020-10-16 01:20:02,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 01:20:02,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-10-16 01:20:02,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 926 transitions.
[2020-10-16 01:20:02,958 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.764026402640264
[2020-10-16 01:20:02,959 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 926 transitions.
[2020-10-16 01:20:02,959 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 926 transitions.
[2020-10-16 01:20:02,960 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:02,960 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 926 transitions.
[2020-10-16 01:20:02,962 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 7 states.
[2020-10-16 01:20:02,964 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states.
[2020-10-16 01:20:02,964 INFO  L81            ComplementDD]: Finished complementDD. Result 7 states.
[2020-10-16 01:20:02,964 INFO  L185             Difference]: Start difference. First operand has 88 places, 92 transitions, 935 flow. Second operand 6 states and 926 transitions.
[2020-10-16 01:20:02,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 100 transitions, 1175 flow
[2020-10-16 01:20:02,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 100 transitions, 1170 flow, removed 0 selfloop flow, removed 1 redundant places.
[2020-10-16 01:20:02,990 INFO  L241             Difference]: Finished difference. Result has 93 places, 94 transitions, 1052 flow
[2020-10-16 01:20:02,990 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1052, PETRI_PLACES=93, PETRI_TRANSITIONS=94}
[2020-10-16 01:20:02,991 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places.
[2020-10-16 01:20:02,991 INFO  L481      AbstractCegarLoop]: Abstraction has has 93 places, 94 transitions, 1052 flow
[2020-10-16 01:20:02,991 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:20:02,991 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:02,991 INFO  L255   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 01:20:02,991 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 01:20:02,992 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-16 01:20:02,992 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:02,992 INFO  L82        PathProgramCache]: Analyzing trace with hash 220944570, now seen corresponding path program 1 times
[2020-10-16 01:20:02,992 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:02,992 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141029279]
[2020-10-16 01:20:02,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:03,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:03,077 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-16 01:20:03,077 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141029279]
[2020-10-16 01:20:03,077 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:03,078 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 01:20:03,078 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852550093]
[2020-10-16 01:20:03,080 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 01:20:03,080 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:03,080 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 01:20:03,081 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 01:20:03,082 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202
[2020-10-16 01:20:03,083 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 94 transitions, 1052 flow. Second operand 5 states.
[2020-10-16 01:20:03,083 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:03,084 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202
[2020-10-16 01:20:03,084 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:03,542 INFO  L129       PetriNetUnfolder]: 819/1654 cut-off events.
[2020-10-16 01:20:03,543 INFO  L130       PetriNetUnfolder]: For 15884/23329 co-relation queries the response was YES.
[2020-10-16 01:20:03,562 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 1654 events. 819/1654 cut-off events. For 15884/23329 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 12322 event pairs, 144 based on Foata normal form. 741/2218 useless extension candidates. Maximal degree in co-relation 8134. Up to 1094 conditions per place. 
[2020-10-16 01:20:03,586 INFO  L132   encePairwiseOnDemand]: 195/202 looper letters, 11 selfloop transitions, 19 changer transitions 0/92 dead transitions.
[2020-10-16 01:20:03,587 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 974 flow
[2020-10-16 01:20:03,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 01:20:03,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-10-16 01:20:03,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1207 transitions.
[2020-10-16 01:20:03,591 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8536067892503536
[2020-10-16 01:20:03,591 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1207 transitions.
[2020-10-16 01:20:03,592 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1207 transitions.
[2020-10-16 01:20:03,592 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:03,593 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1207 transitions.
[2020-10-16 01:20:03,595 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 8 states.
[2020-10-16 01:20:03,598 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states.
[2020-10-16 01:20:03,599 INFO  L81            ComplementDD]: Finished complementDD. Result 8 states.
[2020-10-16 01:20:03,599 INFO  L185             Difference]: Start difference. First operand has 93 places, 94 transitions, 1052 flow. Second operand 7 states and 1207 transitions.
[2020-10-16 01:20:03,599 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 974 flow
[2020-10-16 01:20:03,618 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 92 transitions, 872 flow, removed 17 selfloop flow, removed 11 redundant places.
[2020-10-16 01:20:03,620 INFO  L241             Difference]: Finished difference. Result has 91 places, 88 transitions, 874 flow
[2020-10-16 01:20:03,621 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=874, PETRI_PLACES=91, PETRI_TRANSITIONS=88}
[2020-10-16 01:20:03,621 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places.
[2020-10-16 01:20:03,621 INFO  L481      AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 874 flow
[2020-10-16 01:20:03,621 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 01:20:03,621 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:03,621 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]
[2020-10-16 01:20:03,621 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 01:20:03,622 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-16 01:20:03,622 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:03,622 INFO  L82        PathProgramCache]: Analyzing trace with hash -659878023, now seen corresponding path program 1 times
[2020-10-16 01:20:03,622 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:03,622 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941816710]
[2020-10-16 01:20:03,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:03,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:03,734 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-16 01:20:03,735 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941816710]
[2020-10-16 01:20:03,735 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:03,736 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 01:20:03,736 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799559946]
[2020-10-16 01:20:03,736 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 01:20:03,736 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:03,737 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 01:20:03,737 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 01:20:03,742 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202
[2020-10-16 01:20:03,743 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 874 flow. Second operand 6 states.
[2020-10-16 01:20:03,743 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:03,743 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202
[2020-10-16 01:20:03,743 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:04,067 INFO  L129       PetriNetUnfolder]: 574/1271 cut-off events.
[2020-10-16 01:20:04,068 INFO  L130       PetriNetUnfolder]: For 15955/29304 co-relation queries the response was YES.
[2020-10-16 01:20:04,081 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 1271 events. 574/1271 cut-off events. For 15955/29304 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 9757 event pairs, 17 based on Foata normal form. 982/2099 useless extension candidates. Maximal degree in co-relation 7357. Up to 997 conditions per place. 
[2020-10-16 01:20:04,090 INFO  L132   encePairwiseOnDemand]: 195/202 looper letters, 6 selfloop transitions, 28 changer transitions 4/98 dead transitions.
[2020-10-16 01:20:04,090 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 98 transitions, 1044 flow
[2020-10-16 01:20:04,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-16 01:20:04,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-10-16 01:20:04,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1552 transitions.
[2020-10-16 01:20:04,095 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8536853685368537
[2020-10-16 01:20:04,095 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1552 transitions.
[2020-10-16 01:20:04,096 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1552 transitions.
[2020-10-16 01:20:04,097 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:04,097 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1552 transitions.
[2020-10-16 01:20:04,099 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 10 states.
[2020-10-16 01:20:04,103 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states.
[2020-10-16 01:20:04,103 INFO  L81            ComplementDD]: Finished complementDD. Result 10 states.
[2020-10-16 01:20:04,103 INFO  L185             Difference]: Start difference. First operand has 91 places, 88 transitions, 874 flow. Second operand 9 states and 1552 transitions.
[2020-10-16 01:20:04,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 98 transitions, 1044 flow
[2020-10-16 01:20:04,134 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 98 transitions, 951 flow, removed 26 selfloop flow, removed 6 redundant places.
[2020-10-16 01:20:04,137 INFO  L241             Difference]: Finished difference. Result has 96 places, 94 transitions, 927 flow
[2020-10-16 01:20:04,137 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=927, PETRI_PLACES=96, PETRI_TRANSITIONS=94}
[2020-10-16 01:20:04,137 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places.
[2020-10-16 01:20:04,138 INFO  L481      AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 927 flow
[2020-10-16 01:20:04,138 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 01:20:04,138 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:04,138 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]
[2020-10-16 01:20:04,138 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 01:20:04,138 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-16 01:20:04,138 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:04,139 INFO  L82        PathProgramCache]: Analyzing trace with hash 1588655644, now seen corresponding path program 1 times
[2020-10-16 01:20:04,139 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:04,139 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841637119]
[2020-10-16 01:20:04,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:04,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:04,246 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-16 01:20:04,246 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841637119]
[2020-10-16 01:20:04,247 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:04,247 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 01:20:04,247 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398999121]
[2020-10-16 01:20:04,248 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 01:20:04,248 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:04,248 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 01:20:04,248 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 01:20:04,250 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202
[2020-10-16 01:20:04,251 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 927 flow. Second operand 7 states.
[2020-10-16 01:20:04,251 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:04,252 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202
[2020-10-16 01:20:04,252 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:04,653 INFO  L129       PetriNetUnfolder]: 499/1143 cut-off events.
[2020-10-16 01:20:04,653 INFO  L130       PetriNetUnfolder]: For 16605/24306 co-relation queries the response was YES.
[2020-10-16 01:20:04,666 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6844 conditions, 1143 events. 499/1143 cut-off events. For 16605/24306 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 8902 event pairs, 2 based on Foata normal form. 839/1832 useless extension candidates. Maximal degree in co-relation 6803. Up to 634 conditions per place. 
[2020-10-16 01:20:04,672 INFO  L132   encePairwiseOnDemand]: 195/202 looper letters, 2 selfloop transitions, 33 changer transitions 8/99 dead transitions.
[2020-10-16 01:20:04,672 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 1061 flow
[2020-10-16 01:20:04,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-10-16 01:20:04,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-10-16 01:20:04,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1889 transitions.
[2020-10-16 01:20:04,678 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8501350135013501
[2020-10-16 01:20:04,678 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1889 transitions.
[2020-10-16 01:20:04,678 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1889 transitions.
[2020-10-16 01:20:04,680 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:04,680 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1889 transitions.
[2020-10-16 01:20:04,684 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 12 states.
[2020-10-16 01:20:04,688 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states.
[2020-10-16 01:20:04,688 INFO  L81            ComplementDD]: Finished complementDD. Result 12 states.
[2020-10-16 01:20:04,688 INFO  L185             Difference]: Start difference. First operand has 96 places, 94 transitions, 927 flow. Second operand 11 states and 1889 transitions.
[2020-10-16 01:20:04,688 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 1061 flow
[2020-10-16 01:20:04,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 925 flow, removed 50 selfloop flow, removed 6 redundant places.
[2020-10-16 01:20:04,771 INFO  L241             Difference]: Finished difference. Result has 103 places, 91 transitions, 855 flow
[2020-10-16 01:20:04,771 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=855, PETRI_PLACES=103, PETRI_TRANSITIONS=91}
[2020-10-16 01:20:04,772 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places.
[2020-10-16 01:20:04,772 INFO  L481      AbstractCegarLoop]: Abstraction has has 103 places, 91 transitions, 855 flow
[2020-10-16 01:20:04,772 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 01:20:04,772 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:04,772 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]
[2020-10-16 01:20:04,772 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 01:20:04,773 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-16 01:20:04,773 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:04,773 INFO  L82        PathProgramCache]: Analyzing trace with hash -704221307, now seen corresponding path program 1 times
[2020-10-16 01:20:04,773 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:04,773 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832016073]
[2020-10-16 01:20:04,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:04,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:04,825 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-16 01:20:04,826 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832016073]
[2020-10-16 01:20:04,826 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:04,826 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:20:04,826 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384280851]
[2020-10-16 01:20:04,827 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:20:04,827 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:04,827 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:20:04,827 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:20:04,828 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 176 out of 202
[2020-10-16 01:20:04,829 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 91 transitions, 855 flow. Second operand 4 states.
[2020-10-16 01:20:04,829 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:04,829 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 202
[2020-10-16 01:20:04,829 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:05,039 INFO  L129       PetriNetUnfolder]: 573/1353 cut-off events.
[2020-10-16 01:20:05,039 INFO  L130       PetriNetUnfolder]: For 9336/10403 co-relation queries the response was YES.
[2020-10-16 01:20:05,051 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 6165 conditions, 1353 events. 573/1353 cut-off events. For 9336/10403 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 11080 event pairs, 4 based on Foata normal form. 56/1264 useless extension candidates. Maximal degree in co-relation 6122. Up to 385 conditions per place. 
[2020-10-16 01:20:05,055 INFO  L132   encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 1 changer transitions 1/92 dead transitions.
[2020-10-16 01:20:05,056 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 867 flow
[2020-10-16 01:20:05,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:20:05,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:20:05,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 710 transitions.
[2020-10-16 01:20:05,059 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8787128712871287
[2020-10-16 01:20:05,059 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 710 transitions.
[2020-10-16 01:20:05,059 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 710 transitions.
[2020-10-16 01:20:05,060 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:05,060 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 710 transitions.
[2020-10-16 01:20:05,061 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:20:05,063 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:20:05,063 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:20:05,063 INFO  L185             Difference]: Start difference. First operand has 103 places, 91 transitions, 855 flow. Second operand 4 states and 710 transitions.
[2020-10-16 01:20:05,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 867 flow
[2020-10-16 01:20:05,147 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 738 flow, removed 27 selfloop flow, removed 13 redundant places.
[2020-10-16 01:20:05,148 INFO  L241             Difference]: Finished difference. Result has 94 places, 91 transitions, 733 flow
[2020-10-16 01:20:05,149 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=733, PETRI_PLACES=94, PETRI_TRANSITIONS=91}
[2020-10-16 01:20:05,149 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places.
[2020-10-16 01:20:05,149 INFO  L481      AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 733 flow
[2020-10-16 01:20:05,149 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:20:05,149 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:05,150 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]
[2020-10-16 01:20:05,150 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 01:20:05,150 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:20:05,150 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:05,151 INFO  L82        PathProgramCache]: Analyzing trace with hash -1527448791, now seen corresponding path program 2 times
[2020-10-16 01:20:05,151 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:05,151 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792165215]
[2020-10-16 01:20:05,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:05,171 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 01:20:05,205 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-16 01:20:05,205 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792165215]
[2020-10-16 01:20:05,206 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 01:20:05,206 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 01:20:05,206 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179236502]
[2020-10-16 01:20:05,206 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 01:20:05,207 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 01:20:05,207 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 01:20:05,207 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 01:20:05,208 INFO  L507   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202
[2020-10-16 01:20:05,208 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 733 flow. Second operand 4 states.
[2020-10-16 01:20:05,209 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2020-10-16 01:20:05,209 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202
[2020-10-16 01:20:05,209 INFO  L71            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2020-10-16 01:20:05,386 INFO  L129       PetriNetUnfolder]: 649/1574 cut-off events.
[2020-10-16 01:20:05,386 INFO  L130       PetriNetUnfolder]: For 5708/6071 co-relation queries the response was YES.
[2020-10-16 01:20:05,397 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 5909 conditions, 1574 events. 649/1574 cut-off events. For 5708/6071 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 13536 event pairs, 4 based on Foata normal form. 71/1491 useless extension candidates. Maximal degree in co-relation 5876. Up to 460 conditions per place. 
[2020-10-16 01:20:05,400 INFO  L132   encePairwiseOnDemand]: 199/202 looper letters, 4 selfloop transitions, 1 changer transitions 27/93 dead transitions.
[2020-10-16 01:20:05,400 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 751 flow
[2020-10-16 01:20:05,401 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 01:20:05,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-10-16 01:20:05,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions.
[2020-10-16 01:20:05,403 INFO  L552   CegarLoopForPetriNet]: DFA transition density 0.8663366336633663
[2020-10-16 01:20:05,403 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 700 transitions.
[2020-10-16 01:20:05,403 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 700 transitions.
[2020-10-16 01:20:05,403 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2020-10-16 01:20:05,404 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 700 transitions.
[2020-10-16 01:20:05,405 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 5 states.
[2020-10-16 01:20:05,406 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states.
[2020-10-16 01:20:05,406 INFO  L81            ComplementDD]: Finished complementDD. Result 5 states.
[2020-10-16 01:20:05,406 INFO  L185             Difference]: Start difference. First operand has 94 places, 91 transitions, 733 flow. Second operand 4 states and 700 transitions.
[2020-10-16 01:20:05,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 751 flow
[2020-10-16 01:20:05,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 93 transitions, 748 flow, removed 1 selfloop flow, removed 2 redundant places.
[2020-10-16 01:20:05,492 INFO  L241             Difference]: Finished difference. Result has 96 places, 66 transitions, 494 flow
[2020-10-16 01:20:05,493 INFO  L326   CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=96, PETRI_TRANSITIONS=66}
[2020-10-16 01:20:05,493 INFO  L342   CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places.
[2020-10-16 01:20:05,493 INFO  L481      AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 494 flow
[2020-10-16 01:20:05,493 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 01:20:05,493 INFO  L247   CegarLoopForPetriNet]: Found error trace
[2020-10-16 01:20:05,493 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]
[2020-10-16 01:20:05,493 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 01:20:05,493 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 01:20:05,494 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 01:20:05,494 INFO  L82        PathProgramCache]: Analyzing trace with hash -2009868447, now seen corresponding path program 3 times
[2020-10-16 01:20:05,494 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 01:20:05,494 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968011104]
[2020-10-16 01:20:05,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 01:20:05,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:20:05,532 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:20:05,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 01:20:05,569 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 01:20:05,606 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 01:20:05,607 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 01:20:05,607 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-16 01:20:05,608 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 01:20:05,623 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In545030462 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In545030462 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In545030462 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In545030462 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff0_thd0~0_In545030462 ~y$r_buff0_thd0~0_Out545030462) (or (and .cse0 (or (and (= ~y~0_Out545030462 ~y$w_buff1~0_In545030462) .cse1 .cse2) (and .cse3 (= ~y~0_Out545030462 ~y~0_In545030462)))) (and .cse4 (= ~y$w_buff0~0_In545030462 ~y~0_Out545030462) .cse5)) (or (and .cse3 (= ~y$w_buff1_used~0_Out545030462 ~y$w_buff1_used~0_In545030462)) (and (= ~y$w_buff1_used~0_Out545030462 0) .cse1 .cse2)) (= ~y$r_buff1_thd0~0_In545030462 ~y$r_buff1_thd0~0_Out545030462) (or (and (= ~y$w_buff0_used~0_Out545030462 ~y$w_buff0_used~0_In545030462) .cse0) (and (= ~y$w_buff0_used~0_Out545030462 0) .cse4 .cse5)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In545030462| ULTIMATE.start_assume_abort_if_not_~cond_Out545030462) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out545030462)))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In545030462|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In545030462, ~y$w_buff1~0=~y$w_buff1~0_In545030462, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545030462, ~y$w_buff0~0=~y$w_buff0~0_In545030462, ~y~0=~y~0_In545030462, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545030462, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545030462}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out545030462, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out545030462|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out545030462|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out545030462|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out545030462|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out545030462|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out545030462|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In545030462|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out545030462, ~y$w_buff1~0=~y$w_buff1~0_In545030462, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out545030462, ~y$w_buff0~0=~y$w_buff0~0_In545030462, ~y~0=~y~0_Out545030462, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out545030462, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out545030462}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 01:20:05,630 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-16 01:20:05,630 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,632 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-16 01:20:05,632 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,632 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-16 01:20:05,633 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,633 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-16 01:20:05,633 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,633 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-16 01:20:05,633 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,633 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-16 01:20:05,634 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,634 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-16 01:20:05,634 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,634 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-16 01:20:05,634 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,635 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-16 01:20:05,635 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,635 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-16 01:20:05,635 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,635 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-16 01:20:05,635 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,636 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-16 01:20:05,636 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,637 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-16 01:20:05,637 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,637 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-16 01:20:05,637 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,637 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-16 01:20:05,637 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,638 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-16 01:20:05,638 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,638 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-16 01:20:05,638 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,639 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-16 01:20:05,639 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,639 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-16 01:20:05,639 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,639 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-16 01:20:05,640 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,640 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-16 01:20:05,640 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,640 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-16 01:20:05,640 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,641 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-16 01:20:05,641 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,641 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-16 01:20:05,641 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,641 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-16 01:20:05,641 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,641 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-16 01:20:05,642 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,642 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-16 01:20:05,642 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,642 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-16 01:20:05,642 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 01:20:05,714 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:20:05 BasicIcfg
[2020-10-16 01:20:05,714 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 01:20:05,715 INFO  L168              Benchmark]: Toolchain (without parser) took 24031.50 ms. Allocated memory was 251.1 MB in the beginning and 688.4 MB in the end (delta: 437.3 MB). Free memory was 205.5 MB in the beginning and 191.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 451.4 MB. Max. memory is 14.2 GB.
[2020-10-16 01:20:05,716 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory was 229.2 MB in the beginning and 228.4 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB.
[2020-10-16 01:20:05,717 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 878.12 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 205.5 MB in the beginning and 263.3 MB in the end (delta: -57.8 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB.
[2020-10-16 01:20:05,718 INFO  L168              Benchmark]: Boogie Procedure Inliner took 108.62 ms. Allocated memory is still 314.0 MB. Free memory was 262.4 MB in the beginning and 259.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:20:05,718 INFO  L168              Benchmark]: Boogie Preprocessor took 44.38 ms. Allocated memory is still 314.0 MB. Free memory was 259.9 MB in the beginning and 257.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-16 01:20:05,719 INFO  L168              Benchmark]: RCFGBuilder took 2332.49 ms. Allocated memory was 314.0 MB in the beginning and 358.6 MB in the end (delta: 44.6 MB). Free memory was 257.4 MB in the beginning and 180.9 MB in the end (delta: 76.5 MB). Peak memory consumption was 121.1 MB. Max. memory is 14.2 GB.
[2020-10-16 01:20:05,719 INFO  L168              Benchmark]: TraceAbstraction took 20662.65 ms. Allocated memory was 358.6 MB in the beginning and 688.4 MB in the end (delta: 329.8 MB). Free memory was 180.9 MB in the beginning and 191.4 MB in the end (delta: -10.5 MB). Peak memory consumption was 319.3 MB. Max. memory is 14.2 GB.
[2020-10-16 01:20:05,723 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.21 ms. Allocated memory is still 251.1 MB. Free memory was 229.2 MB in the beginning and 228.4 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 878.12 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 205.5 MB in the beginning and 263.3 MB in the end (delta: -57.8 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 108.62 ms. Allocated memory is still 314.0 MB. Free memory was 262.4 MB in the beginning and 259.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 44.38 ms. Allocated memory is still 314.0 MB. Free memory was 259.9 MB in the beginning and 257.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2332.49 ms. Allocated memory was 314.0 MB in the beginning and 358.6 MB in the end (delta: 44.6 MB). Free memory was 257.4 MB in the beginning and 180.9 MB in the end (delta: 76.5 MB). Peak memory consumption was 121.1 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 20662.65 ms. Allocated memory was 358.6 MB in the beginning and 688.4 MB in the end (delta: 329.8 MB). Free memory was 180.9 MB in the beginning and 191.4 MB in the end (delta: -10.5 MB). Peak memory consumption was 319.3 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1771 VarBasedMoverChecksPositive, 103 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 222 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.4s, 118 PlacesBefore, 42 PlacesAfterwards, 107 TransitionsBefore, 30 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7754 MoverChecksTotal
  - 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;
[L701]               0  int __unbuffered_p2_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L708]               0  _Bool main$tmp_guard0;
[L709]               0  _Bool main$tmp_guard1;
[L711]               0  int x = 0;
[L713]               0  int y = 0;
[L714]               0  _Bool y$flush_delayed;
[L715]               0  int y$mem_tmp;
[L716]               0  _Bool y$r_buff0_thd0;
[L717]               0  _Bool y$r_buff0_thd1;
[L718]               0  _Bool y$r_buff0_thd2;
[L719]               0  _Bool y$r_buff0_thd3;
[L720]               0  _Bool y$r_buff0_thd4;
[L721]               0  _Bool y$r_buff1_thd0;
[L722]               0  _Bool y$r_buff1_thd1;
[L723]               0  _Bool y$r_buff1_thd2;
[L724]               0  _Bool y$r_buff1_thd3;
[L725]               0  _Bool y$r_buff1_thd4;
[L726]               0  _Bool y$read_delayed;
[L727]               0  int *y$read_delayed_var;
[L728]               0  int y$w_buff0;
[L729]               0  _Bool y$w_buff0_used;
[L730]               0  int y$w_buff1;
[L731]               0  _Bool y$w_buff1_used;
[L733]               0  int z = 0;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L835]               0  pthread_t t577;
[L836]  FCALL, FORK  0  pthread_create(&t577, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L837]               0  pthread_t t578;
[L838]  FCALL, FORK  0  pthread_create(&t578, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L839]               0  pthread_t t579;
[L840]  FCALL, FORK  0  pthread_create(&t579, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L774]               3  y$w_buff1 = y$w_buff0
[L775]               3  y$w_buff0 = 2
[L776]               3  y$w_buff1_used = y$w_buff0_used
[L777]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L779]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L780]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L781]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L782]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L783]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L784]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L787]               3  __unbuffered_p2_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L841]               0  pthread_t t580;
[L842]  FCALL, FORK  0  pthread_create(&t580, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L804]               4  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L807]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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]
[L810]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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]
[L739]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1]
[L742]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1]
[L754]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1]
[L757]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1]
[L790]  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)
[L790]               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)
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792]               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
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L794]               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
[L760]  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)
[L760]               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)
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L761]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L762]               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
[L763]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L763]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764]               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
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L749]               1  return 0;
[L767]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L769]               2  return 0;
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L813]  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)
[L813]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L813]  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)
[L813]               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)
[L814]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L814]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L815]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L815]               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
[L816]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L816]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L817]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L817]               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
[L820]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L822]               4  return 0;
[L844]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L855]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L856]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L857]               0  y$flush_delayed = weak$$choice2
[L858]               0  y$mem_tmp = y
[L859]  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)
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1
[L859]  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)
[L859]               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)
[L860]  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))
[L860]               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))
[L861]  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))
[L861]               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))
[L862]  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))
[L862]               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))
[L863]  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))
[L863]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L863]  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))
[L863]               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))
[L864]  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))
[L864]               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))
[L865]  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))
[L865]  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)
[L865]  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))
[L865]               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))
[L866]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L867]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L867]               0  y = y$flush_delayed ? y$mem_tmp : y
[L868]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, 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=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 110 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: 20.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 82 SDtfs, 56 SDslu, 32 SDs, 0 SdLazy, 569 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1052occurred in iteration=14, 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.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 37042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...