/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i


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


This is Ultimate 0.1.25-1d1d2b5
[2020-10-21 22:04:16,188 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-21 22:04:16,192 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-21 22:04:16,217 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-21 22:04:16,218 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-21 22:04:16,219 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-21 22:04:16,221 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-21 22:04:16,222 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-21 22:04:16,224 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-21 22:04:16,225 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-21 22:04:16,226 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-21 22:04:16,227 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-21 22:04:16,228 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-21 22:04:16,229 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-21 22:04:16,230 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-21 22:04:16,231 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-21 22:04:16,232 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-21 22:04:16,233 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-21 22:04:16,235 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-21 22:04:16,237 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-21 22:04:16,238 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-21 22:04:16,240 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-21 22:04:16,241 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-21 22:04:16,242 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-21 22:04:16,244 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-21 22:04:16,245 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-21 22:04:16,245 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-21 22:04:16,246 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-21 22:04:16,246 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-21 22:04:16,247 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-21 22:04:16,247 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-21 22:04:16,248 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-21 22:04:16,249 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-21 22:04:16,250 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-21 22:04:16,251 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-21 22:04:16,251 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-21 22:04:16,252 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-21 22:04:16,252 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-21 22:04:16,252 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-21 22:04:16,253 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-21 22:04:16,254 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-21 22:04:16,255 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-21 22:04:16,279 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-21 22:04:16,279 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-21 22:04:16,280 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-21 22:04:16,280 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-21 22:04:16,281 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-21 22:04:16,281 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-21 22:04:16,281 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-21 22:04:16,281 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-21 22:04:16,282 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-21 22:04:16,282 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-21 22:04:16,282 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-21 22:04:16,282 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-21 22:04:16,282 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-21 22:04:16,283 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-21 22:04:16,283 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-21 22:04:16,283 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-21 22:04:16,283 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-21 22:04:16,283 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-21 22:04:16,284 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-21 22:04:16,284 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-21 22:04:16,284 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-21 22:04:16,284 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-21 22:04:16,284 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-21 22:04:16,285 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-21 22:04:16,285 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-21 22:04:16,285 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-21 22:04:16,285 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-21 22:04:16,285 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-21 22:04:16,286 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-21 22:04:16,286 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-21 22:04:16,586 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-21 22:04:16,599 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-21 22:04:16,602 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-21 22:04:16,604 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-21 22:04:16,604 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-21 22:04:16,605 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i
[2020-10-21 22:04:16,668 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8021ae9f/67aafe17af1744bf804634e17b474f11/FLAG09425c9df
[2020-10-21 22:04:17,252 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-21 22:04:17,253 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i
[2020-10-21 22:04:17,273 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8021ae9f/67aafe17af1744bf804634e17b474f11/FLAG09425c9df
[2020-10-21 22:04:17,491 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8021ae9f/67aafe17af1744bf804634e17b474f11
[2020-10-21 22:04:17,499 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-21 22:04:17,507 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-21 22:04:17,508 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-21 22:04:17,508 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-21 22:04:17,512 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-21 22:04:17,513 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:17" (1/1) ...
[2020-10-21 22:04:17,516 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745ca6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:17, skipping insertion in model container
[2020-10-21 22:04:17,516 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:17" (1/1) ...
[2020-10-21 22:04:17,524 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-21 22:04:17,568 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-21 22:04:18,150 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:04:18,167 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-21 22:04:18,235 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:04:18,317 INFO  L208         MainTranslator]: Completed translation
[2020-10-21 22:04:18,317 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18 WrapperNode
[2020-10-21 22:04:18,318 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-21 22:04:18,319 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-21 22:04:18,319 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-21 22:04:18,319 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-21 22:04:18,328 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,349 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,390 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-21 22:04:18,391 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-21 22:04:18,391 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-21 22:04:18,391 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-21 22:04:18,406 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,407 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,412 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,412 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,424 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,428 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,432 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (1/1) ...
[2020-10-21 22:04:18,438 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-21 22:04:18,439 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-21 22:04:18,439 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-21 22:04:18,439 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-21 22:04:18,440 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (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-21 22:04:18,515 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-21 22:04:18,516 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-21 22:04:18,517 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-21 22:04:18,517 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-21 22:04:18,517 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-21 22:04:18,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-21 22:04:18,518 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-21 22:04:18,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-21 22:04:18,519 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-21 22:04:18,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-21 22:04:18,520 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-10-21 22:04:18,520 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-21 22:04:18,521 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-21 22:04:18,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-21 22:04:18,524 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-21 22:04:20,707 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-21 22:04:20,707 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-10-21 22:04:20,710 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:04:20 BoogieIcfgContainer
[2020-10-21 22:04:20,710 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-21 22:04:20,712 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-21 22:04:20,712 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-21 22:04:20,716 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-21 22:04:20,716 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:04:17" (1/3) ...
[2020-10-21 22:04:20,717 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0f96df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:04:20, skipping insertion in model container
[2020-10-21 22:04:20,718 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:18" (2/3) ...
[2020-10-21 22:04:20,718 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0f96df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:04:20, skipping insertion in model container
[2020-10-21 22:04:20,718 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:04:20" (3/3) ...
[2020-10-21 22:04:20,720 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe030_pso.oepc.i
[2020-10-21 22:04:20,733 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-21 22:04:20,734 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-21 22:04:20,742 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-21 22:04:20,743 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-21 22:04:20,777 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,777 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,777 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,777 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,778 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,778 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,778 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,778 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,779 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,779 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,779 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,780 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,780 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,780 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,780 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,781 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,781 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,781 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,781 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,781 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,782 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,782 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,783 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,783 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,783 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,784 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,784 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,784 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,785 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,785 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,785 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,785 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,785 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,785 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,786 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,786 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,787 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,787 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,787 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,788 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,788 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,788 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,788 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,788 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,788 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,789 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,789 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,789 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,790 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,794 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,794 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,794 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,795 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,795 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,796 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,797 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,797 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,797 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,804 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,804 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,804 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,805 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,805 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,805 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,805 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,805 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,806 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,806 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,808 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,808 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,808 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,809 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,809 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,809 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,809 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,809 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,810 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,810 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:04:20,812 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-21 22:04:20,829 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-21 22:04:20,854 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-21 22:04:20,854 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-21 22:04:20,854 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-21 22:04:20,854 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-21 22:04:20,854 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-21 22:04:20,855 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-21 22:04:20,855 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-21 22:04:20,855 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-21 22:04:20,871 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-21 22:04:20,875 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow
[2020-10-21 22:04:20,878 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow
[2020-10-21 22:04:20,881 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow
[2020-10-21 22:04:20,933 INFO  L129       PetriNetUnfolder]: 3/97 cut-off events.
[2020-10-21 22:04:20,933 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-21 22:04:20,939 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. 
[2020-10-21 22:04:20,943 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1870
[2020-10-21 22:04:21,051 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,055 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,055 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,061 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:21,062 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:04:21,067 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,068 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,176 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,177 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:21,184 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,185 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,188 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,189 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,195 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,203 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,204 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,207 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,207 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,217 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,220 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,221 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,377 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,378 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,379 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,379 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,383 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:21,383 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:04:21,386 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,387 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,441 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:21,443 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,444 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,445 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,446 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,449 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,450 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,453 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,453 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,455 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,457 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,461 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,462 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,463 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,464 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,534 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2020-10-21 22:04:21,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,535 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,536 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,560 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,561 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,562 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,576 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,576 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,578 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,578 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,579 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,580 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,602 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,603 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,604 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,631 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,632 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,633 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,715 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,716 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,717 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,717 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,736 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,736 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,738 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:04:21,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:21,788 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,789 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,790 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,790 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,795 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,795 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,797 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,797 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,799 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:21,800 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:21,802 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,802 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,805 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,805 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,806 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,807 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,857 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:21,858 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,859 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:21,859 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:21,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:21,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:04:21,867 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:21,868 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,027 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,028 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,029 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,030 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,061 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:22,061 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:22,062 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-21 22:04:22,063 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:22,127 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,127 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:22,130 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,131 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,133 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,133 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:22,141 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:22,143 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,144 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:22,146 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,146 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,150 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:22,151 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,152 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:22,153 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,204 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:22,205 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,206 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,206 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,209 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:22,210 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:04:22,214 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,215 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,292 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:22,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,294 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,295 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,298 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:22,298 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:04:22,302 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,303 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,361 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,362 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:22,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,364 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,365 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,365 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,369 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:22,371 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,372 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:22,374 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:22,374 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:22,379 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,379 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,381 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:22,382 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,384 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:22,384 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,708 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,709 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,709 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,710 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,739 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,739 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,740 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,741 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,770 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,771 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,772 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,772 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,792 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,793 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,794 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,794 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,851 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,852 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,852 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,853 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,872 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,874 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,902 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,903 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:22,904 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-21 22:04:22,904 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:22,922 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:22,922 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:22,923 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:22,923 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:23,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:23,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,061 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:23,061 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,062 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:23,062 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,109 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:23,109 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:23,113 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:23,113 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:23,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,117 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:23,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:23,118 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:23,119 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:23,120 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:23,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:23,123 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:23,123 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,124 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:23,124 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,126 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:23,126 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,168 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:23,169 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,169 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:23,170 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:23,172 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:23,172 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:04:23,174 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:23,175 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:24,946 WARN  L193               SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 226 DAG size of output: 185
[2020-10-21 22:04:24,956 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term
[2020-10-21 22:04:24,956 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:24,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:24,957 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,666 WARN  L193               SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121
[2020-10-21 22:04:25,844 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2020-10-21 22:04:25,844 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,845 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:25,845 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:25,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:25,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,880 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:25,881 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,881 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:25,882 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,882 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-21 22:04:25,883 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,912 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:25,912 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,913 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:25,914 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,934 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:25,935 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:25,936 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:25,936 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,174 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:26,175 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,175 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:26,176 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,208 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:04:26,209 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,210 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:04:26,210 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,487 WARN  L193               SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-21 22:04:26,632 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:26,632 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:26,634 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:26,634 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:26,651 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:04:26,652 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,653 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,653 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,654 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,654 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,656 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,658 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,658 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,660 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:26,660 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,661 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,661 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,662 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,704 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:26,705 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:26,707 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:26,708 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,725 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:26,725 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,726 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:04:26,726 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,727 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,727 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,728 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,729 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,730 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,731 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,732 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,733 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,734 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:26,735 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,736 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,737 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,738 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,881 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,882 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,883 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,885 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,886 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:04:26,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:04:26,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:04:26,902 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,903 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,903 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,903 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,905 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,905 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,906 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:04:26,907 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:26,951 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,952 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,952 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,954 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:04:26,956 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:04:26,956 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:04:26,972 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,972 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,973 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,973 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:26,975 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:26,975 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:04:26,977 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:04:26,977 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:04:27,025 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,026 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,026 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,027 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,028 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,028 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,030 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:04:27,030 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,045 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,045 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:04:27,047 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:04:27,047 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:04:27,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,086 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,087 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:04:27,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,089 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,090 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,090 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,092 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,096 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,097 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,099 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,099 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,100 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,101 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,102 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,102 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,120 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,120 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:27,122 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,122 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,168 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,169 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,170 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:04:27,170 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,171 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,171 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,173 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,174 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,175 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,176 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,177 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,178 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,179 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,179 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,181 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,182 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,182 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,200 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,228 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:27,234 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,234 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,309 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,310 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:27,311 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,312 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,335 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,336 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,337 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:04:27,337 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,338 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,338 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,339 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,339 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,341 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,342 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,343 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,343 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,346 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,346 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,348 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,349 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,350 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,350 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,418 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,418 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,419 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:04:27,420 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,421 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,421 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,423 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:04:27,425 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,428 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,428 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,431 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,432 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,433 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,434 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,436 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:04:27,437 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:04:27,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:04:27,469 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:04:27,926 WARN  L193               SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58
[2020-10-21 22:04:28,726 WARN  L193               SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110
[2020-10-21 22:04:28,928 WARN  L193               SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2020-10-21 22:04:28,944 INFO  L131        LiptonReduction]: Checked pairs total: 5127
[2020-10-21 22:04:28,944 INFO  L133        LiptonReduction]: Total number of compositions: 88
[2020-10-21 22:04:28,952 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow
[2020-10-21 22:04:29,010 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states.
[2020-10-21 22:04:29,013 INFO  L276                IsEmpty]: Start isEmpty. Operand 974 states.
[2020-10-21 22:04:29,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-21 22:04:29,020 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:29,021 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-21 22:04:29,021 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:29,028 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:29,028 INFO  L82        PathProgramCache]: Analyzing trace with hash 1087434, now seen corresponding path program 1 times
[2020-10-21 22:04:29,040 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:29,041 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450431794]
[2020-10-21 22:04:29,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:29,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:29,271 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-21 22:04:29,272 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450431794]
[2020-10-21 22:04:29,273 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:29,274 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-21 22:04:29,275 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120200050]
[2020-10-21 22:04:29,280 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:04:29,280 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:29,295 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:04:29,296 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:04:29,298 INFO  L87              Difference]: Start difference. First operand 974 states. Second operand 3 states.
[2020-10-21 22:04:29,442 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:29,442 INFO  L93              Difference]: Finished difference Result 812 states and 2575 transitions.
[2020-10-21 22:04:29,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:04:29,450 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-21 22:04:29,450 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:29,484 INFO  L225             Difference]: With dead ends: 812
[2020-10-21 22:04:29,485 INFO  L226             Difference]: Without dead ends: 687
[2020-10-21 22:04:29,486 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:04:29,513 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 687 states.
[2020-10-21 22:04:29,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687.
[2020-10-21 22:04:29,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 687 states.
[2020-10-21 22:04:29,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions.
[2020-10-21 22:04:29,597 INFO  L78                 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3
[2020-10-21 22:04:29,597 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:29,597 INFO  L481      AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions.
[2020-10-21 22:04:29,597 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:04:29,598 INFO  L276                IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions.
[2020-10-21 22:04:29,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-21 22:04:29,600 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:29,600 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:29,601 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-21 22:04:29,602 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:29,602 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:29,602 INFO  L82        PathProgramCache]: Analyzing trace with hash -818792776, now seen corresponding path program 1 times
[2020-10-21 22:04:29,602 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:29,603 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410762975]
[2020-10-21 22:04:29,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:29,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:29,864 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-21 22:04:29,865 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410762975]
[2020-10-21 22:04:29,865 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:29,865 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:04:29,866 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513629823]
[2020-10-21 22:04:29,867 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:04:29,867 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:29,867 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:04:29,868 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:04:29,868 INFO  L87              Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states.
[2020-10-21 22:04:29,969 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:29,969 INFO  L93              Difference]: Finished difference Result 808 states and 2436 transitions.
[2020-10-21 22:04:29,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:04:29,971 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-21 22:04:29,971 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:29,977 INFO  L225             Difference]: With dead ends: 808
[2020-10-21 22:04:29,977 INFO  L226             Difference]: Without dead ends: 683
[2020-10-21 22:04:29,978 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:29,982 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 683 states.
[2020-10-21 22:04:30,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683.
[2020-10-21 22:04:30,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 683 states.
[2020-10-21 22:04:30,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 2134 transitions.
[2020-10-21 22:04:30,008 INFO  L78                 Accepts]: Start accepts. Automaton has 683 states and 2134 transitions. Word has length 10
[2020-10-21 22:04:30,009 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:30,010 INFO  L481      AbstractCegarLoop]: Abstraction has 683 states and 2134 transitions.
[2020-10-21 22:04:30,010 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:04:30,010 INFO  L276                IsEmpty]: Start isEmpty. Operand 683 states and 2134 transitions.
[2020-10-21 22:04:30,012 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-21 22:04:30,012 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:30,012 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:30,012 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-21 22:04:30,013 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:30,013 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:30,013 INFO  L82        PathProgramCache]: Analyzing trace with hash 512463005, now seen corresponding path program 1 times
[2020-10-21 22:04:30,013 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:30,014 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908119101]
[2020-10-21 22:04:30,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:30,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:30,188 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-21 22:04:30,189 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908119101]
[2020-10-21 22:04:30,189 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:30,189 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:04:30,190 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917072894]
[2020-10-21 22:04:30,190 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:04:30,191 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:30,191 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:04:30,191 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:30,192 INFO  L87              Difference]: Start difference. First operand 683 states and 2134 transitions. Second operand 5 states.
[2020-10-21 22:04:30,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:30,336 INFO  L93              Difference]: Finished difference Result 767 states and 2317 transitions.
[2020-10-21 22:04:30,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:04:30,337 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2020-10-21 22:04:30,338 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:30,343 INFO  L225             Difference]: With dead ends: 767
[2020-10-21 22:04:30,343 INFO  L226             Difference]: Without dead ends: 667
[2020-10-21 22:04:30,344 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:04:30,347 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 667 states.
[2020-10-21 22:04:30,361 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667.
[2020-10-21 22:04:30,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 667 states.
[2020-10-21 22:04:30,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions.
[2020-10-21 22:04:30,365 INFO  L78                 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 11
[2020-10-21 22:04:30,365 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:30,365 INFO  L481      AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions.
[2020-10-21 22:04:30,366 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:04:30,366 INFO  L276                IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions.
[2020-10-21 22:04:30,367 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-21 22:04:30,367 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:30,367 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:30,368 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-21 22:04:30,368 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:30,368 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:30,368 INFO  L82        PathProgramCache]: Analyzing trace with hash 387224091, now seen corresponding path program 1 times
[2020-10-21 22:04:30,368 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:30,369 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989411597]
[2020-10-21 22:04:30,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:30,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:30,443 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-21 22:04:30,444 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989411597]
[2020-10-21 22:04:30,444 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:30,444 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:04:30,445 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141092279]
[2020-10-21 22:04:30,445 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:04:30,445 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:30,445 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:04:30,446 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:04:30,446 INFO  L87              Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states.
[2020-10-21 22:04:30,545 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:30,545 INFO  L93              Difference]: Finished difference Result 759 states and 2283 transitions.
[2020-10-21 22:04:30,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:04:30,546 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-21 22:04:30,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:30,551 INFO  L225             Difference]: With dead ends: 759
[2020-10-21 22:04:30,551 INFO  L226             Difference]: Without dead ends: 659
[2020-10-21 22:04:30,552 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:30,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2020-10-21 22:04:30,571 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659.
[2020-10-21 22:04:30,571 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 659 states.
[2020-10-21 22:04:30,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 2044 transitions.
[2020-10-21 22:04:30,575 INFO  L78                 Accepts]: Start accepts. Automaton has 659 states and 2044 transitions. Word has length 11
[2020-10-21 22:04:30,575 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:30,575 INFO  L481      AbstractCegarLoop]: Abstraction has 659 states and 2044 transitions.
[2020-10-21 22:04:30,575 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:04:30,575 INFO  L276                IsEmpty]: Start isEmpty. Operand 659 states and 2044 transitions.
[2020-10-21 22:04:30,577 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:04:30,577 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:30,577 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:30,578 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-21 22:04:30,578 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:30,578 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:30,578 INFO  L82        PathProgramCache]: Analyzing trace with hash -1293519658, now seen corresponding path program 1 times
[2020-10-21 22:04:30,578 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:30,579 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480180824]
[2020-10-21 22:04:30,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:30,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:30,706 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-21 22:04:30,707 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480180824]
[2020-10-21 22:04:30,707 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:30,707 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:04:30,708 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266249844]
[2020-10-21 22:04:30,708 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:04:30,708 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:30,709 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:04:30,709 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:30,709 INFO  L87              Difference]: Start difference. First operand 659 states and 2044 transitions. Second operand 5 states.
[2020-10-21 22:04:30,853 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:30,853 INFO  L93              Difference]: Finished difference Result 731 states and 2202 transitions.
[2020-10-21 22:04:30,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:04:30,855 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-21 22:04:30,855 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:30,860 INFO  L225             Difference]: With dead ends: 731
[2020-10-21 22:04:30,860 INFO  L226             Difference]: Without dead ends: 651
[2020-10-21 22:04:30,860 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:04:30,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 651 states.
[2020-10-21 22:04:30,886 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651.
[2020-10-21 22:04:30,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 651 states.
[2020-10-21 22:04:30,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 2014 transitions.
[2020-10-21 22:04:30,889 INFO  L78                 Accepts]: Start accepts. Automaton has 651 states and 2014 transitions. Word has length 12
[2020-10-21 22:04:30,890 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:30,890 INFO  L481      AbstractCegarLoop]: Abstraction has 651 states and 2014 transitions.
[2020-10-21 22:04:30,890 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:04:30,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 651 states and 2014 transitions.
[2020-10-21 22:04:30,891 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:04:30,891 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:30,892 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:30,892 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-21 22:04:30,892 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:30,892 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:30,892 INFO  L82        PathProgramCache]: Analyzing trace with hash 20338818, now seen corresponding path program 1 times
[2020-10-21 22:04:30,893 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:30,893 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444882616]
[2020-10-21 22:04:30,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:30,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:31,039 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-21 22:04:31,039 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444882616]
[2020-10-21 22:04:31,040 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:31,040 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:04:31,040 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462484583]
[2020-10-21 22:04:31,040 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:04:31,041 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:31,041 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:04:31,041 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:31,041 INFO  L87              Difference]: Start difference. First operand 651 states and 2014 transitions. Second operand 5 states.
[2020-10-21 22:04:31,147 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:31,147 INFO  L93              Difference]: Finished difference Result 732 states and 2190 transitions.
[2020-10-21 22:04:31,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:04:31,148 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-21 22:04:31,148 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:31,153 INFO  L225             Difference]: With dead ends: 732
[2020-10-21 22:04:31,153 INFO  L226             Difference]: Without dead ends: 637
[2020-10-21 22:04:31,154 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:04:31,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 637 states.
[2020-10-21 22:04:31,171 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637.
[2020-10-21 22:04:31,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 637 states.
[2020-10-21 22:04:31,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1962 transitions.
[2020-10-21 22:04:31,174 INFO  L78                 Accepts]: Start accepts. Automaton has 637 states and 1962 transitions. Word has length 12
[2020-10-21 22:04:31,174 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:31,174 INFO  L481      AbstractCegarLoop]: Abstraction has 637 states and 1962 transitions.
[2020-10-21 22:04:31,175 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:04:31,175 INFO  L276                IsEmpty]: Start isEmpty. Operand 637 states and 1962 transitions.
[2020-10-21 22:04:31,176 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-21 22:04:31,176 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:31,176 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:31,176 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-21 22:04:31,176 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:31,176 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:31,177 INFO  L82        PathProgramCache]: Analyzing trace with hash -543109849, now seen corresponding path program 1 times
[2020-10-21 22:04:31,177 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:31,177 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413189767]
[2020-10-21 22:04:31,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:31,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:31,263 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-21 22:04:31,264 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413189767]
[2020-10-21 22:04:31,264 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:31,264 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:04:31,265 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440005669]
[2020-10-21 22:04:31,265 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:04:31,265 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:31,265 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:04:31,266 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:04:31,267 INFO  L87              Difference]: Start difference. First operand 637 states and 1962 transitions. Second operand 4 states.
[2020-10-21 22:04:31,311 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:31,311 INFO  L93              Difference]: Finished difference Result 1024 states and 3033 transitions.
[2020-10-21 22:04:31,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:04:31,312 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-21 22:04:31,312 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:31,318 INFO  L225             Difference]: With dead ends: 1024
[2020-10-21 22:04:31,318 INFO  L226             Difference]: Without dead ends: 727
[2020-10-21 22:04:31,319 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:31,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 727 states.
[2020-10-21 22:04:31,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 613.
[2020-10-21 22:04:31,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 613 states.
[2020-10-21 22:04:31,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1820 transitions.
[2020-10-21 22:04:31,341 INFO  L78                 Accepts]: Start accepts. Automaton has 613 states and 1820 transitions. Word has length 13
[2020-10-21 22:04:31,342 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:31,342 INFO  L481      AbstractCegarLoop]: Abstraction has 613 states and 1820 transitions.
[2020-10-21 22:04:31,342 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:04:31,342 INFO  L276                IsEmpty]: Start isEmpty. Operand 613 states and 1820 transitions.
[2020-10-21 22:04:31,343 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-21 22:04:31,343 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:31,343 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:31,344 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-21 22:04:31,344 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:31,344 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:31,344 INFO  L82        PathProgramCache]: Analyzing trace with hash 1698628404, now seen corresponding path program 1 times
[2020-10-21 22:04:31,344 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:31,345 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292526497]
[2020-10-21 22:04:31,345 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:31,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:31,524 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-21 22:04:31,524 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292526497]
[2020-10-21 22:04:31,525 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:31,525 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:04:31,525 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609042986]
[2020-10-21 22:04:31,525 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:04:31,526 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:31,526 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:04:31,526 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:04:31,526 INFO  L87              Difference]: Start difference. First operand 613 states and 1820 transitions. Second operand 6 states.
[2020-10-21 22:04:31,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:31,695 INFO  L93              Difference]: Finished difference Result 715 states and 2068 transitions.
[2020-10-21 22:04:31,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:04:31,699 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 13
[2020-10-21 22:04:31,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:31,704 INFO  L225             Difference]: With dead ends: 715
[2020-10-21 22:04:31,704 INFO  L226             Difference]: Without dead ends: 635
[2020-10-21 22:04:31,705 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:04:31,708 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 635 states.
[2020-10-21 22:04:31,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635.
[2020-10-21 22:04:31,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 635 states.
[2020-10-21 22:04:31,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1876 transitions.
[2020-10-21 22:04:31,725 INFO  L78                 Accepts]: Start accepts. Automaton has 635 states and 1876 transitions. Word has length 13
[2020-10-21 22:04:31,725 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:31,726 INFO  L481      AbstractCegarLoop]: Abstraction has 635 states and 1876 transitions.
[2020-10-21 22:04:31,726 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:04:31,726 INFO  L276                IsEmpty]: Start isEmpty. Operand 635 states and 1876 transitions.
[2020-10-21 22:04:31,727 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-21 22:04:31,727 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:31,727 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:31,727 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-21 22:04:31,727 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:31,728 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:31,728 INFO  L82        PathProgramCache]: Analyzing trace with hash 1404860786, now seen corresponding path program 1 times
[2020-10-21 22:04:31,728 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:31,728 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434215396]
[2020-10-21 22:04:31,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:31,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:31,792 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-21 22:04:31,793 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434215396]
[2020-10-21 22:04:31,793 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:31,793 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:04:31,793 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352793576]
[2020-10-21 22:04:31,794 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:04:31,794 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:31,794 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:04:31,794 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:31,794 INFO  L87              Difference]: Start difference. First operand 635 states and 1876 transitions. Second operand 5 states.
[2020-10-21 22:04:31,925 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:31,925 INFO  L93              Difference]: Finished difference Result 782 states and 2255 transitions.
[2020-10-21 22:04:31,926 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:04:31,926 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-21 22:04:31,926 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:31,930 INFO  L225             Difference]: With dead ends: 782
[2020-10-21 22:04:31,931 INFO  L226             Difference]: Without dead ends: 697
[2020-10-21 22:04:31,931 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:04:31,934 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 697 states.
[2020-10-21 22:04:31,949 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 669.
[2020-10-21 22:04:31,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 669 states.
[2020-10-21 22:04:31,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1960 transitions.
[2020-10-21 22:04:31,952 INFO  L78                 Accepts]: Start accepts. Automaton has 669 states and 1960 transitions. Word has length 13
[2020-10-21 22:04:31,952 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:31,953 INFO  L481      AbstractCegarLoop]: Abstraction has 669 states and 1960 transitions.
[2020-10-21 22:04:31,953 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:04:31,953 INFO  L276                IsEmpty]: Start isEmpty. Operand 669 states and 1960 transitions.
[2020-10-21 22:04:31,954 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:04:31,954 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:31,954 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:31,955 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-21 22:04:31,955 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:31,955 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:31,955 INFO  L82        PathProgramCache]: Analyzing trace with hash -1886124809, now seen corresponding path program 1 times
[2020-10-21 22:04:31,955 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:31,956 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960155247]
[2020-10-21 22:04:31,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:31,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:32,100 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-21 22:04:32,101 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960155247]
[2020-10-21 22:04:32,101 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:32,101 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:04:32,101 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448602521]
[2020-10-21 22:04:32,102 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-21 22:04:32,102 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:32,102 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-21 22:04:32,102 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:04:32,102 INFO  L87              Difference]: Start difference. First operand 669 states and 1960 transitions. Second operand 7 states.
[2020-10-21 22:04:32,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:32,318 INFO  L93              Difference]: Finished difference Result 1049 states and 2949 transitions.
[2020-10-21 22:04:32,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:04:32,319 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 14
[2020-10-21 22:04:32,320 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:32,326 INFO  L225             Difference]: With dead ends: 1049
[2020-10-21 22:04:32,326 INFO  L226             Difference]: Without dead ends: 705
[2020-10-21 22:04:32,326 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2020-10-21 22:04:32,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 705 states.
[2020-10-21 22:04:32,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 633.
[2020-10-21 22:04:32,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 633 states.
[2020-10-21 22:04:32,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1756 transitions.
[2020-10-21 22:04:32,347 INFO  L78                 Accepts]: Start accepts. Automaton has 633 states and 1756 transitions. Word has length 14
[2020-10-21 22:04:32,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:32,348 INFO  L481      AbstractCegarLoop]: Abstraction has 633 states and 1756 transitions.
[2020-10-21 22:04:32,348 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-21 22:04:32,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 633 states and 1756 transitions.
[2020-10-21 22:04:32,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:04:32,349 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:32,349 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:32,350 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-21 22:04:32,350 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:32,350 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:32,350 INFO  L82        PathProgramCache]: Analyzing trace with hash 600960688, now seen corresponding path program 1 times
[2020-10-21 22:04:32,350 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:32,351 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784177790]
[2020-10-21 22:04:32,351 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:32,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:32,476 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-21 22:04:32,477 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784177790]
[2020-10-21 22:04:32,477 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:32,477 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:04:32,477 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995456128]
[2020-10-21 22:04:32,478 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:04:32,478 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:32,478 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:04:32,478 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:04:32,478 INFO  L87              Difference]: Start difference. First operand 633 states and 1756 transitions. Second operand 6 states.
[2020-10-21 22:04:32,665 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:32,665 INFO  L93              Difference]: Finished difference Result 740 states and 1993 transitions.
[2020-10-21 22:04:32,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-21 22:04:32,666 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-21 22:04:32,666 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:32,671 INFO  L225             Difference]: With dead ends: 740
[2020-10-21 22:04:32,671 INFO  L226             Difference]: Without dead ends: 646
[2020-10-21 22:04:32,671 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:04:32,674 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 646 states.
[2020-10-21 22:04:32,685 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 613.
[2020-10-21 22:04:32,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 613 states.
[2020-10-21 22:04:32,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1663 transitions.
[2020-10-21 22:04:32,687 INFO  L78                 Accepts]: Start accepts. Automaton has 613 states and 1663 transitions. Word has length 14
[2020-10-21 22:04:32,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:32,688 INFO  L481      AbstractCegarLoop]: Abstraction has 613 states and 1663 transitions.
[2020-10-21 22:04:32,688 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:04:32,688 INFO  L276                IsEmpty]: Start isEmpty. Operand 613 states and 1663 transitions.
[2020-10-21 22:04:32,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-21 22:04:32,689 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:32,689 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:32,690 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-21 22:04:32,690 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:32,690 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:32,690 INFO  L82        PathProgramCache]: Analyzing trace with hash -1269236973, now seen corresponding path program 1 times
[2020-10-21 22:04:32,690 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:32,691 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384534794]
[2020-10-21 22:04:32,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:32,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:32,785 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-21 22:04:32,785 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384534794]
[2020-10-21 22:04:32,785 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:32,785 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:04:32,785 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056965744]
[2020-10-21 22:04:32,786 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:04:32,786 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:32,786 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:04:32,786 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:04:32,787 INFO  L87              Difference]: Start difference. First operand 613 states and 1663 transitions. Second operand 6 states.
[2020-10-21 22:04:32,911 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:32,911 INFO  L93              Difference]: Finished difference Result 665 states and 1777 transitions.
[2020-10-21 22:04:32,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:04:32,912 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-21 22:04:32,912 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:32,917 INFO  L225             Difference]: With dead ends: 665
[2020-10-21 22:04:32,917 INFO  L226             Difference]: Without dead ends: 633
[2020-10-21 22:04:32,917 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:04:32,920 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 633 states.
[2020-10-21 22:04:32,930 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 613.
[2020-10-21 22:04:32,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 613 states.
[2020-10-21 22:04:32,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1668 transitions.
[2020-10-21 22:04:32,933 INFO  L78                 Accepts]: Start accepts. Automaton has 613 states and 1668 transitions. Word has length 15
[2020-10-21 22:04:32,933 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:32,933 INFO  L481      AbstractCegarLoop]: Abstraction has 613 states and 1668 transitions.
[2020-10-21 22:04:32,934 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:04:32,934 INFO  L276                IsEmpty]: Start isEmpty. Operand 613 states and 1668 transitions.
[2020-10-21 22:04:32,935 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-21 22:04:32,935 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:32,935 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:32,935 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-21 22:04:32,936 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:32,936 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:32,936 INFO  L82        PathProgramCache]: Analyzing trace with hash 292670997, now seen corresponding path program 1 times
[2020-10-21 22:04:32,936 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:32,936 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089072053]
[2020-10-21 22:04:32,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:32,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:33,051 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-21 22:04:33,051 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089072053]
[2020-10-21 22:04:33,052 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:33,052 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:04:33,052 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218578149]
[2020-10-21 22:04:33,052 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-21 22:04:33,053 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:33,053 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-21 22:04:33,053 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:04:33,053 INFO  L87              Difference]: Start difference. First operand 613 states and 1668 transitions. Second operand 7 states.
[2020-10-21 22:04:33,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:33,252 INFO  L93              Difference]: Finished difference Result 809 states and 2120 transitions.
[2020-10-21 22:04:33,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-21 22:04:33,253 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2020-10-21 22:04:33,253 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:33,257 INFO  L225             Difference]: With dead ends: 809
[2020-10-21 22:04:33,257 INFO  L226             Difference]: Without dead ends: 607
[2020-10-21 22:04:33,257 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2020-10-21 22:04:33,260 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 607 states.
[2020-10-21 22:04:33,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 511.
[2020-10-21 22:04:33,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 511 states.
[2020-10-21 22:04:33,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1348 transitions.
[2020-10-21 22:04:33,272 INFO  L78                 Accepts]: Start accepts. Automaton has 511 states and 1348 transitions. Word has length 15
[2020-10-21 22:04:33,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:33,272 INFO  L481      AbstractCegarLoop]: Abstraction has 511 states and 1348 transitions.
[2020-10-21 22:04:33,272 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-21 22:04:33,272 INFO  L276                IsEmpty]: Start isEmpty. Operand 511 states and 1348 transitions.
[2020-10-21 22:04:33,273 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-21 22:04:33,273 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:33,274 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:33,274 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-21 22:04:33,274 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:33,274 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:33,274 INFO  L82        PathProgramCache]: Analyzing trace with hash 1658715163, now seen corresponding path program 1 times
[2020-10-21 22:04:33,274 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:33,275 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70514051]
[2020-10-21 22:04:33,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:33,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:33,330 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-21 22:04:33,330 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70514051]
[2020-10-21 22:04:33,331 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:33,331 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:04:33,331 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480203636]
[2020-10-21 22:04:33,331 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:04:33,332 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:33,332 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:04:33,332 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:04:33,332 INFO  L87              Difference]: Start difference. First operand 511 states and 1348 transitions. Second operand 4 states.
[2020-10-21 22:04:33,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:33,373 INFO  L93              Difference]: Finished difference Result 464 states and 1072 transitions.
[2020-10-21 22:04:33,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:04:33,374 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-21 22:04:33,374 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:33,376 INFO  L225             Difference]: With dead ends: 464
[2020-10-21 22:04:33,376 INFO  L226             Difference]: Without dead ends: 349
[2020-10-21 22:04:33,376 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:33,378 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 349 states.
[2020-10-21 22:04:33,384 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349.
[2020-10-21 22:04:33,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 349 states.
[2020-10-21 22:04:33,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 794 transitions.
[2020-10-21 22:04:33,385 INFO  L78                 Accepts]: Start accepts. Automaton has 349 states and 794 transitions. Word has length 15
[2020-10-21 22:04:33,386 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:33,386 INFO  L481      AbstractCegarLoop]: Abstraction has 349 states and 794 transitions.
[2020-10-21 22:04:33,386 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:04:33,386 INFO  L276                IsEmpty]: Start isEmpty. Operand 349 states and 794 transitions.
[2020-10-21 22:04:33,387 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:04:33,387 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:33,387 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:33,387 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-21 22:04:33,387 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:33,388 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:33,388 INFO  L82        PathProgramCache]: Analyzing trace with hash 1607978709, now seen corresponding path program 1 times
[2020-10-21 22:04:33,388 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:33,388 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743975948]
[2020-10-21 22:04:33,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:33,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:33,467 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-21 22:04:33,468 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743975948]
[2020-10-21 22:04:33,468 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:33,468 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:04:33,469 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027614612]
[2020-10-21 22:04:33,469 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:04:33,469 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:33,469 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:04:33,470 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:04:33,470 INFO  L87              Difference]: Start difference. First operand 349 states and 794 transitions. Second operand 5 states.
[2020-10-21 22:04:33,522 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:33,522 INFO  L93              Difference]: Finished difference Result 276 states and 559 transitions.
[2020-10-21 22:04:33,523 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:04:33,523 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-21 22:04:33,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:33,525 INFO  L225             Difference]: With dead ends: 276
[2020-10-21 22:04:33,525 INFO  L226             Difference]: Without dead ends: 213
[2020-10-21 22:04:33,525 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:04:33,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 213 states.
[2020-10-21 22:04:33,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213.
[2020-10-21 22:04:33,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 213 states.
[2020-10-21 22:04:33,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 420 transitions.
[2020-10-21 22:04:33,534 INFO  L78                 Accepts]: Start accepts. Automaton has 213 states and 420 transitions. Word has length 16
[2020-10-21 22:04:33,534 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:33,534 INFO  L481      AbstractCegarLoop]: Abstraction has 213 states and 420 transitions.
[2020-10-21 22:04:33,534 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:04:33,534 INFO  L276                IsEmpty]: Start isEmpty. Operand 213 states and 420 transitions.
[2020-10-21 22:04:33,535 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-21 22:04:33,535 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:33,535 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:33,536 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-21 22:04:33,536 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:33,536 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:33,536 INFO  L82        PathProgramCache]: Analyzing trace with hash 152246784, now seen corresponding path program 1 times
[2020-10-21 22:04:33,536 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:33,537 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427911381]
[2020-10-21 22:04:33,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:33,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:33,773 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-21 22:04:33,774 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427911381]
[2020-10-21 22:04:33,774 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:33,774 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-21 22:04:33,774 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490302881]
[2020-10-21 22:04:33,775 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-21 22:04:33,775 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:33,775 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-21 22:04:33,775 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:04:33,775 INFO  L87              Difference]: Start difference. First operand 213 states and 420 transitions. Second operand 9 states.
[2020-10-21 22:04:33,978 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:33,978 INFO  L93              Difference]: Finished difference Result 246 states and 471 transitions.
[2020-10-21 22:04:33,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:04:33,978 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 19
[2020-10-21 22:04:33,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:33,980 INFO  L225             Difference]: With dead ends: 246
[2020-10-21 22:04:33,980 INFO  L226             Difference]: Without dead ends: 179
[2020-10-21 22:04:33,980 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2020-10-21 22:04:33,981 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2020-10-21 22:04:33,984 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165.
[2020-10-21 22:04:33,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 165 states.
[2020-10-21 22:04:33,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 326 transitions.
[2020-10-21 22:04:33,984 INFO  L78                 Accepts]: Start accepts. Automaton has 165 states and 326 transitions. Word has length 19
[2020-10-21 22:04:33,985 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:33,985 INFO  L481      AbstractCegarLoop]: Abstraction has 165 states and 326 transitions.
[2020-10-21 22:04:33,985 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-21 22:04:33,985 INFO  L276                IsEmpty]: Start isEmpty. Operand 165 states and 326 transitions.
[2020-10-21 22:04:33,986 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-21 22:04:33,986 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:33,986 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:33,986 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-21 22:04:33,986 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:33,986 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:33,986 INFO  L82        PathProgramCache]: Analyzing trace with hash -489867090, now seen corresponding path program 1 times
[2020-10-21 22:04:33,987 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:33,987 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397678597]
[2020-10-21 22:04:33,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:34,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:04:34,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:04:34,066 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397678597]
[2020-10-21 22:04:34,067 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:04:34,067 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:04:34,067 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857680712]
[2020-10-21 22:04:34,067 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:04:34,068 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:04:34,068 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:04:34,068 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:04:34,068 INFO  L87              Difference]: Start difference. First operand 165 states and 326 transitions. Second operand 6 states.
[2020-10-21 22:04:34,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:04:34,126 INFO  L93              Difference]: Finished difference Result 142 states and 280 transitions.
[2020-10-21 22:04:34,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:04:34,126 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-21 22:04:34,127 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:04:34,127 INFO  L225             Difference]: With dead ends: 142
[2020-10-21 22:04:34,127 INFO  L226             Difference]: Without dead ends: 63
[2020-10-21 22:04:34,128 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:04:34,128 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2020-10-21 22:04:34,129 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2020-10-21 22:04:34,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2020-10-21 22:04:34,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions.
[2020-10-21 22:04:34,130 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19
[2020-10-21 22:04:34,130 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:04:34,130 INFO  L481      AbstractCegarLoop]: Abstraction has 63 states and 110 transitions.
[2020-10-21 22:04:34,130 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:04:34,131 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions.
[2020-10-21 22:04:34,131 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-21 22:04:34,131 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:04:34,131 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:04:34,131 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-21 22:04:34,132 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:04:34,132 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:04:34,132 INFO  L82        PathProgramCache]: Analyzing trace with hash 2034612569, now seen corresponding path program 1 times
[2020-10-21 22:04:34,132 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:04:34,133 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330047691]
[2020-10-21 22:04:34,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:04:34,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:04:34,189 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:04:34,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:04:34,249 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:04:34,310 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-21 22:04:34,310 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-21 22:04:34,311 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-21 22:04:34,332 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-21 22:04:34,332 WARN  L224     RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738]
[2020-10-21 22:04:34,340 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-21 22:04:34,341 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,341 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-21 22:04:34,341 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,342 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-21 22:04:34,342 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,342 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-21 22:04:34,343 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,343 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-21 22:04:34,343 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,343 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-21 22:04:34,343 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,344 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-21 22:04:34,344 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,344 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-21 22:04:34,344 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,344 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-21 22:04:34,345 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,345 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-21 22:04:34,345 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,346 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-21 22:04:34,346 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,346 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-21 22:04:34,347 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,347 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-21 22:04:34,347 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,347 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-21 22:04:34,347 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,347 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-21 22:04:34,347 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,348 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-21 22:04:34,348 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,350 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-21 22:04:34,350 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,350 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-21 22:04:34,350 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,355 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-21 22:04:34,355 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,355 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-21 22:04:34,356 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,356 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-21 22:04:34,356 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,356 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-21 22:04:34,356 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,357 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-21 22:04:34,357 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,357 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-21 22:04:34,357 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,357 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-21 22:04:34,357 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,357 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-21 22:04:34,358 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,358 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-21 22:04:34,358 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,358 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-21 22:04:34,358 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,358 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-21 22:04:34,359 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,359 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-21 22:04:34,359 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,360 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-21 22:04:34,360 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,360 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-21 22:04:34,360 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,360 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-21 22:04:34,360 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,361 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-21 22:04:34,361 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,361 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-21 22:04:34,361 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:04:34,477 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:04:34 BasicIcfg
[2020-10-21 22:04:34,477 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-21 22:04:34,479 INFO  L168              Benchmark]: Toolchain (without parser) took 16978.47 ms. Allocated memory was 139.5 MB in the beginning and 426.8 MB in the end (delta: 287.3 MB). Free memory was 100.9 MB in the beginning and 254.0 MB in the end (delta: -153.1 MB). Peak memory consumption was 134.2 MB. Max. memory is 7.1 GB.
[2020-10-21 22:04:34,480 INFO  L168              Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-21 22:04:34,481 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 810.35 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 99.8 MB in the beginning and 152.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB.
[2020-10-21 22:04:34,485 INFO  L168              Benchmark]: Boogie Procedure Inliner took 71.81 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-21 22:04:34,486 INFO  L168              Benchmark]: Boogie Preprocessor took 47.76 ms. Allocated memory is still 202.4 MB. Free memory was 150.2 MB in the beginning and 147.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-21 22:04:34,488 INFO  L168              Benchmark]: RCFGBuilder took 2271.66 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 147.5 MB in the beginning and 161.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB.
[2020-10-21 22:04:34,489 INFO  L168              Benchmark]: TraceAbstraction took 13765.62 ms. Allocated memory was 247.5 MB in the beginning and 426.8 MB in the end (delta: 179.3 MB). Free memory was 161.6 MB in the beginning and 254.0 MB in the end (delta: -92.3 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB.
[2020-10-21 22:04:34,494 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 810.35 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 99.8 MB in the beginning and 152.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 71.81 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 47.76 ms. Allocated memory is still 202.4 MB. Free memory was 150.2 MB in the beginning and 147.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2271.66 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 147.5 MB in the beginning and 161.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 101.6 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 13765.62 ms. Allocated memory was 247.5 MB in the beginning and 426.8 MB in the end (delta: 179.3 MB). Free memory was 161.6 MB in the beginning and 254.0 MB in the end (delta: -92.3 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1131 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 84 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.0s, 107 PlacesBefore, 37 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 5127 MoverChecksTotal
  - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L710]               0  _Bool main$tmp_guard0;
[L711]               0  _Bool main$tmp_guard1;
[L713]               0  int x = 0;
[L715]               0  int y = 0;
[L717]               0  int z = 0;
[L718]               0  _Bool z$flush_delayed;
[L719]               0  int z$mem_tmp;
[L720]               0  _Bool z$r_buff0_thd0;
[L721]               0  _Bool z$r_buff0_thd1;
[L722]               0  _Bool z$r_buff0_thd2;
[L723]               0  _Bool z$r_buff0_thd3;
[L724]               0  _Bool z$r_buff1_thd0;
[L725]               0  _Bool z$r_buff1_thd1;
[L726]               0  _Bool z$r_buff1_thd2;
[L727]               0  _Bool z$r_buff1_thd3;
[L728]               0  _Bool z$read_delayed;
[L729]               0  int *z$read_delayed_var;
[L730]               0  int z$w_buff0;
[L731]               0  _Bool z$w_buff0_used;
[L732]               0  int z$w_buff1;
[L733]               0  _Bool z$w_buff1_used;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L816]               0  pthread_t t2495;
[L817]  FCALL, FORK  0  pthread_create(&t2495, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L739]               1  z$w_buff1 = z$w_buff0
[L740]               1  z$w_buff0 = 2
[L741]               1  z$w_buff1_used = z$w_buff0_used
[L742]               1  z$w_buff0_used = (_Bool)1
[L18]   COND FALSE   1  !(!expression)
[L744]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L745]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L746]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L747]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L748]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L818]               0  pthread_t t2496;
[L819]  FCALL, FORK  0  pthread_create(&t2496, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L820]               0  pthread_t t2497;
[L821]  FCALL, FORK  0  pthread_create(&t2497, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L751]               1  x = 1
        VAL             [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L768]               2  x = 2
        VAL             [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L771]               2  y = 1
        VAL             [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L774]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L774]  EXPR         2  z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L774]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L774]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L775]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L775]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L776]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L777]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L777]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L778]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L778]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L788]               3  y = 2
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L791]               3  z = 1
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L794]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L794]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L795]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L795]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L796]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L796]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L797]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L797]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L798]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L798]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L801]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L803]               3  return 0;
[L781]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L783]               2  return 0;
[L754]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L754]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L755]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L755]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L756]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L756]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L757]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L757]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L758]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L758]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L761]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L763]               1  return 0;
[L823]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L827]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L827]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L827]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L827]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L828]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L828]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L829]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L829]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L830]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L830]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L831]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L831]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L834]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L835]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L836]               0  z$flush_delayed = weak$$choice2
[L837]               0  z$mem_tmp = z
[L838]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L838]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1
[L838]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L838]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L839]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L839]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L839]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L839]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L840]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L840]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L840]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1
[L840]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L840]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L840]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L841]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L841]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)
[L841]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L841]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L842]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L842]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L843]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L843]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L844]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L844]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L845]               0  main$tmp_guard1 = !(x == 2 && y == 2 && z == 2)
[L846]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L846]               0  z = z$flush_delayed ? z$mem_tmp : z
[L847]               0  z$flush_delayed = (_Bool)0
[L18]   COND TRUE    0  !expression
[L17]   COND FALSE   0  !(0)
[L17]                0  __assert_fail ("0", "safe030_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 490 SDtfs, 562 SDslu, 1008 SDs, 0 SdLazy, 609 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 377 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 29933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...