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


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 14:52:52,240 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 14:52:52,242 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 14:52:52,284 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 14:52:52,284 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 14:52:52,293 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 14:52:52,296 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 14:52:52,300 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 14:52:52,303 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 14:52:52,306 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 14:52:52,307 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 14:52:52,308 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 14:52:52,308 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 14:52:52,311 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 14:52:52,313 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 14:52:52,315 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 14:52:52,317 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 14:52:52,319 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 14:52:52,320 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 14:52:52,330 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 14:52:52,332 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 14:52:52,333 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 14:52:52,334 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 14:52:52,335 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 14:52:52,347 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 14:52:52,348 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 14:52:52,351 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 14:52:52,352 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 14:52:52,352 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 14:52:52,356 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 14:52:52,357 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 14:52:52,357 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 14:52:52,359 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 14:52:52,363 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 14:52:52,364 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 14:52:52,365 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 14:52:52,365 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 14:52:52,366 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 14:52:52,366 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 14:52:52,368 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 14:52:52,369 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 14:52:52,370 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-11 14:52:52,406 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 14:52:52,407 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 14:52:52,409 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 14:52:52,409 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 14:52:52,409 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 14:52:52,409 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 14:52:52,410 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 14:52:52,410 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 14:52:52,410 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 14:52:52,410 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 14:52:52,411 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 14:52:52,412 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 14:52:52,412 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 14:52:52,412 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 14:52:52,412 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 14:52:52,412 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 14:52:52,413 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 14:52:52,413 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 14:52:52,413 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 14:52:52,413 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 14:52:52,414 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 14:52:52,414 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:52:52,414 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 14:52:52,414 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 14:52:52,415 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 14:52:52,415 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 14:52:52,415 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 14:52:52,415 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-11 14:52:52,415 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-11 14:52:52,415 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 14:52:52,729 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 14:52:52,741 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 14:52:52,745 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 14:52:52,747 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 14:52:52,747 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 14:52:52,748 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i
[2020-10-11 14:52:52,815 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88e1f596/a44d4044ab1d4b3392239f9d6dc57ef1/FLAG9b3b961f1
[2020-10-11 14:52:53,343 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 14:52:53,344 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i
[2020-10-11 14:52:53,365 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88e1f596/a44d4044ab1d4b3392239f9d6dc57ef1/FLAG9b3b961f1
[2020-10-11 14:52:53,594 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88e1f596/a44d4044ab1d4b3392239f9d6dc57ef1
[2020-10-11 14:52:53,603 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 14:52:53,605 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 14:52:53,607 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 14:52:53,607 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 14:52:53,611 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 14:52:53,612 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:52:53" (1/1) ...
[2020-10-11 14:52:53,616 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a8da1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:53, skipping insertion in model container
[2020-10-11 14:52:53,616 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:52:53" (1/1) ...
[2020-10-11 14:52:53,625 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 14:52:53,690 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 14:52:54,206 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:52:54,223 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 14:52:54,286 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:52:54,361 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 14:52:54,362 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54 WrapperNode
[2020-10-11 14:52:54,362 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 14:52:54,363 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 14:52:54,363 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 14:52:54,363 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 14:52:54,372 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,392 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,431 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 14:52:54,432 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 14:52:54,432 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 14:52:54,432 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 14:52:54,447 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,447 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,452 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,452 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,463 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,468 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,472 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
[2020-10-11 14:52:54,477 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 14:52:54,477 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 14:52:54,477 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 14:52:54,477 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 14:52:54,478 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:52:54,549 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 14:52:54,549 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 14:52:54,550 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 14:52:54,550 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 14:52:54,550 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 14:52:54,550 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 14:52:54,550 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 14:52:54,550 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 14:52:54,551 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 14:52:54,551 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 14:52:54,551 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 14:52:54,551 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 14:52:54,551 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 14:52:54,553 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-11 14:52:56,482 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 14:52:56,482 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 14:52:56,484 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:52:56 BoogieIcfgContainer
[2020-10-11 14:52:56,485 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 14:52:56,486 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 14:52:56,486 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 14:52:56,490 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 14:52:56,490 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:52:53" (1/3) ...
[2020-10-11 14:52:56,492 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bbeeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:52:56, skipping insertion in model container
[2020-10-11 14:52:56,492 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:54" (2/3) ...
[2020-10-11 14:52:56,493 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bbeeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:52:56, skipping insertion in model container
[2020-10-11 14:52:56,493 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:52:56" (3/3) ...
[2020-10-11 14:52:56,496 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i
[2020-10-11 14:52:56,507 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-11 14:52:56,507 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 14:52:56,515 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 14:52:56,516 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 14:52:56,546 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,546 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,546 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,547 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,547 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,547 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,548 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,548 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,548 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,549 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,549 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,549 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,549 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,549 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,549 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,550 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,550 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,550 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,550 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,552 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,552 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,552 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,552 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,559 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,559 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,565 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,565 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,567 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,568 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,569 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,569 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,569 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,569 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,569 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,570 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,570 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,570 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,570 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,570 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,570 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:56,586 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-11 14:52:56,608 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 14:52:56,608 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-11 14:52:56,608 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 14:52:56,609 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 14:52:56,609 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 14:52:56,609 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 14:52:56,609 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 14:52:56,609 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 14:52:56,624 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-11 14:52:56,627 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow
[2020-10-11 14:52:56,630 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 205 flow
[2020-10-11 14:52:56,632 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow
[2020-10-11 14:52:56,680 INFO  L129       PetriNetUnfolder]: 2/92 cut-off events.
[2020-10-11 14:52:56,680 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 14:52:56,686 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2020-10-11 14:52:56,689 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1692
[2020-10-11 14:52:56,809 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:52:56,810 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:56,812 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:52:56,813 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:56,853 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:52:56,853 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:56,856 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:52:56,857 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:57,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:52:57,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:57,251 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:52:57,252 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:57,275 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:52:57,275 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:57,277 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:52:57,278 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:58,518 WARN  L193               SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 228 DAG size of output: 188
[2020-10-11 14:52:58,533 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term
[2020-10-11 14:52:58,533 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:58,538 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:52:58,538 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:59,454 WARN  L193               SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125
[2020-10-11 14:52:59,522 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:52:59,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,254 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,255 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,256 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,256 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,259 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,260 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,263 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,263 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,280 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,281 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,282 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,282 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,286 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,289 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,401 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:53:00,402 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,498 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,499 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,500 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,504 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,504 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,507 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,508 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,532 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,533 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,534 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,538 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,538 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,541 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,541 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,736 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,737 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,738 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,741 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,741 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,743 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,744 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,760 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,761 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,762 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,762 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:00,764 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:00,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:00,767 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:00,767 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:01,066 WARN  L193               SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-11 14:53:01,177 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-11 14:53:01,862 WARN  L193               SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110
[2020-10-11 14:53:02,168 WARN  L193               SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 107
[2020-10-11 14:53:02,215 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,215 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,219 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,219 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:02,221 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,222 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:02,248 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,250 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,253 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:02,255 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,255 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:02,329 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,329 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,330 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,331 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,332 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,332 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:02,334 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,335 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:02,349 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,350 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,350 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,351 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,352 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,353 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:02,357 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,359 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:02,554 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,555 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,555 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,556 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,557 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,558 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:02,580 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,581 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:02,592 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,594 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,594 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:02,595 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:02,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:02,597 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:02,597 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:03,374 WARN  L193               SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 126
[2020-10-11 14:53:03,735 WARN  L193               SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 123
[2020-10-11 14:53:03,797 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:03,797 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:03,798 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,799 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:03,800 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,800 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:03,802 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:03,802 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:03,818 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,819 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:03,820 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,820 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:03,821 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,822 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:03,823 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:03,824 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:03,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:03,862 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,863 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:03,864 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:03,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:03,866 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:03,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,888 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:03,889 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:03,894 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:03,895 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:03,900 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:53:03,904 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:53:04,035 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term
[2020-10-11 14:53:04,036 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,037 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term
[2020-10-11 14:53:04,037 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,038 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,038 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,039 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,040 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,041 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,046 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,046 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,047 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,048 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,048 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,049 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,069 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,069 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:04,071 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,268 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,268 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:04,270 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,270 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,286 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term
[2020-10-11 14:53:04,286 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term
[2020-10-11 14:53:04,287 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,289 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,289 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,291 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,291 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,292 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,294 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,294 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,296 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,296 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,297 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,297 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,382 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,383 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:04,385 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,385 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,405 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term
[2020-10-11 14:53:04,406 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,407 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term
[2020-10-11 14:53:04,408 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,409 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,409 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,411 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,413 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,414 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,416 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,417 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,418 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,418 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,420 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,420 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,422 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,423 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,475 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term
[2020-10-11 14:53:04,476 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,477 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term
[2020-10-11 14:53:04,478 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,479 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,479 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,481 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,481 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:53:04,483 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,484 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,485 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,486 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,488 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,490 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:53:04,492 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:04,517 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,518 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:53:04,521 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term
[2020-10-11 14:53:04,521 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:53:05,194 WARN  L193               SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 131
[2020-10-11 14:53:05,549 WARN  L193               SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 129
[2020-10-11 14:53:05,717 WARN  L193               SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2020-10-11 14:53:05,835 WARN  L193               SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2020-10-11 14:53:06,147 WARN  L193               SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89
[2020-10-11 14:53:06,284 WARN  L193               SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87
[2020-10-11 14:53:06,291 INFO  L132        LiptonReduction]: Checked pairs total: 4495
[2020-10-11 14:53:06,291 INFO  L134        LiptonReduction]: Total number of compositions: 82
[2020-10-11 14:53:06,297 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow
[2020-10-11 14:53:06,351 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states.
[2020-10-11 14:53:06,354 INFO  L276                IsEmpty]: Start isEmpty. Operand 750 states.
[2020-10-11 14:53:06,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-11 14:53:06,361 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:06,361 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:06,362 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:06,367 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:06,368 INFO  L82        PathProgramCache]: Analyzing trace with hash -139107104, now seen corresponding path program 1 times
[2020-10-11 14:53:06,378 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:06,379 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829217794]
[2020-10-11 14:53:06,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:06,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:06,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:06,625 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829217794]
[2020-10-11 14:53:06,626 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:06,626 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:53:06,627 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689034442]
[2020-10-11 14:53:06,633 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:53:06,633 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:06,651 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:53:06,651 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:53:06,654 INFO  L87              Difference]: Start difference. First operand 750 states. Second operand 3 states.
[2020-10-11 14:53:06,762 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:06,762 INFO  L93              Difference]: Finished difference Result 650 states and 2028 transitions.
[2020-10-11 14:53:06,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:53:06,769 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-11 14:53:06,769 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:06,806 INFO  L225             Difference]: With dead ends: 650
[2020-10-11 14:53:06,806 INFO  L226             Difference]: Without dead ends: 530
[2020-10-11 14:53:06,808 INFO  L673         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-11 14:53:06,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 530 states.
[2020-10-11 14:53:06,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530.
[2020-10-11 14:53:06,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 530 states.
[2020-10-11 14:53:06,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions.
[2020-10-11 14:53:06,936 INFO  L78                 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7
[2020-10-11 14:53:06,937 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:06,937 INFO  L481      AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions.
[2020-10-11 14:53:06,937 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:53:06,937 INFO  L276                IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions.
[2020-10-11 14:53:06,938 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-11 14:53:06,939 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:06,939 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:06,939 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 14:53:06,939 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:06,939 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:06,940 INFO  L82        PathProgramCache]: Analyzing trace with hash -537885840, now seen corresponding path program 1 times
[2020-10-11 14:53:06,940 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:06,940 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767566086]
[2020-10-11 14:53:06,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:06,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:07,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:07,062 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767566086]
[2020-10-11 14:53:07,063 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:07,063 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:53:07,063 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947216938]
[2020-10-11 14:53:07,065 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:53:07,065 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:07,065 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:53:07,066 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:53:07,066 INFO  L87              Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states.
[2020-10-11 14:53:07,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:07,098 INFO  L93              Difference]: Finished difference Result 528 states and 1614 transitions.
[2020-10-11 14:53:07,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:53:07,099 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-11 14:53:07,100 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:07,105 INFO  L225             Difference]: With dead ends: 528
[2020-10-11 14:53:07,105 INFO  L226             Difference]: Without dead ends: 528
[2020-10-11 14:53:07,106 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 14:53:07,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2020-10-11 14:53:07,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2020-10-11 14:53:07,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 528 states.
[2020-10-11 14:53:07,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1614 transitions.
[2020-10-11 14:53:07,143 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 1614 transitions. Word has length 9
[2020-10-11 14:53:07,143 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:07,144 INFO  L481      AbstractCegarLoop]: Abstraction has 528 states and 1614 transitions.
[2020-10-11 14:53:07,144 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:53:07,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 1614 transitions.
[2020-10-11 14:53:07,145 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-11 14:53:07,145 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:07,145 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:07,146 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 14:53:07,146 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:07,146 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:07,147 INFO  L82        PathProgramCache]: Analyzing trace with hash 505407985, now seen corresponding path program 1 times
[2020-10-11 14:53:07,147 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:07,147 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990795742]
[2020-10-11 14:53:07,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:07,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:07,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:07,257 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990795742]
[2020-10-11 14:53:07,258 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:07,258 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:53:07,258 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407409803]
[2020-10-11 14:53:07,258 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:53:07,258 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:07,259 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:53:07,259 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:53:07,259 INFO  L87              Difference]: Start difference. First operand 528 states and 1614 transitions. Second operand 3 states.
[2020-10-11 14:53:07,274 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:07,275 INFO  L93              Difference]: Finished difference Result 518 states and 1576 transitions.
[2020-10-11 14:53:07,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:53:07,276 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-11 14:53:07,276 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:07,280 INFO  L225             Difference]: With dead ends: 518
[2020-10-11 14:53:07,281 INFO  L226             Difference]: Without dead ends: 518
[2020-10-11 14:53:07,281 INFO  L673         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-11 14:53:07,284 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 518 states.
[2020-10-11 14:53:07,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518.
[2020-10-11 14:53:07,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 518 states.
[2020-10-11 14:53:07,298 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1576 transitions.
[2020-10-11 14:53:07,298 INFO  L78                 Accepts]: Start accepts. Automaton has 518 states and 1576 transitions. Word has length 10
[2020-10-11 14:53:07,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:07,299 INFO  L481      AbstractCegarLoop]: Abstraction has 518 states and 1576 transitions.
[2020-10-11 14:53:07,299 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:53:07,299 INFO  L276                IsEmpty]: Start isEmpty. Operand 518 states and 1576 transitions.
[2020-10-11 14:53:07,300 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-11 14:53:07,300 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:07,301 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:07,301 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 14:53:07,301 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:07,301 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:07,301 INFO  L82        PathProgramCache]: Analyzing trace with hash 505408109, now seen corresponding path program 1 times
[2020-10-11 14:53:07,302 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:07,302 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981885104]
[2020-10-11 14:53:07,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:07,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:07,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:07,379 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981885104]
[2020-10-11 14:53:07,379 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:07,379 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:53:07,379 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013013520]
[2020-10-11 14:53:07,380 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:53:07,380 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:07,380 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:53:07,380 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:53:07,381 INFO  L87              Difference]: Start difference. First operand 518 states and 1576 transitions. Second operand 3 states.
[2020-10-11 14:53:07,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:07,409 INFO  L93              Difference]: Finished difference Result 512 states and 1554 transitions.
[2020-10-11 14:53:07,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:53:07,411 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-11 14:53:07,411 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:07,415 INFO  L225             Difference]: With dead ends: 512
[2020-10-11 14:53:07,415 INFO  L226             Difference]: Without dead ends: 512
[2020-10-11 14:53:07,415 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 14:53:07,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 512 states.
[2020-10-11 14:53:07,433 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512.
[2020-10-11 14:53:07,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 512 states.
[2020-10-11 14:53:07,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1554 transitions.
[2020-10-11 14:53:07,439 INFO  L78                 Accepts]: Start accepts. Automaton has 512 states and 1554 transitions. Word has length 10
[2020-10-11 14:53:07,440 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:07,440 INFO  L481      AbstractCegarLoop]: Abstraction has 512 states and 1554 transitions.
[2020-10-11 14:53:07,443 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:53:07,443 INFO  L276                IsEmpty]: Start isEmpty. Operand 512 states and 1554 transitions.
[2020-10-11 14:53:07,447 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-11 14:53:07,447 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:07,447 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:07,447 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 14:53:07,451 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:07,452 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:07,452 INFO  L82        PathProgramCache]: Analyzing trace with hash -1512221684, now seen corresponding path program 1 times
[2020-10-11 14:53:07,452 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:07,452 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274462156]
[2020-10-11 14:53:07,452 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:07,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:07,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:07,576 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274462156]
[2020-10-11 14:53:07,576 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:07,576 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:53:07,577 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286692]
[2020-10-11 14:53:07,577 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:53:07,577 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:07,577 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:53:07,578 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:53:07,578 INFO  L87              Difference]: Start difference. First operand 512 states and 1554 transitions. Second operand 3 states.
[2020-10-11 14:53:07,592 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:07,593 INFO  L93              Difference]: Finished difference Result 482 states and 1450 transitions.
[2020-10-11 14:53:07,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:53:07,594 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-11 14:53:07,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:07,597 INFO  L225             Difference]: With dead ends: 482
[2020-10-11 14:53:07,597 INFO  L226             Difference]: Without dead ends: 482
[2020-10-11 14:53:07,598 INFO  L673         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-11 14:53:07,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 482 states.
[2020-10-11 14:53:07,609 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482.
[2020-10-11 14:53:07,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 482 states.
[2020-10-11 14:53:07,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions.
[2020-10-11 14:53:07,612 INFO  L78                 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 11
[2020-10-11 14:53:07,612 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:07,612 INFO  L481      AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions.
[2020-10-11 14:53:07,612 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:53:07,613 INFO  L276                IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions.
[2020-10-11 14:53:07,614 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-11 14:53:07,614 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:07,614 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:07,614 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 14:53:07,615 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:07,615 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:07,615 INFO  L82        PathProgramCache]: Analyzing trace with hash 365755524, now seen corresponding path program 1 times
[2020-10-11 14:53:07,615 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:07,615 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640201387]
[2020-10-11 14:53:07,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:07,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:07,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:07,741 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640201387]
[2020-10-11 14:53:07,741 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:07,741 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:53:07,741 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385592431]
[2020-10-11 14:53:07,741 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:53:07,742 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:07,742 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:53:07,742 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:07,742 INFO  L87              Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 5 states.
[2020-10-11 14:53:07,821 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:07,821 INFO  L93              Difference]: Finished difference Result 470 states and 1406 transitions.
[2020-10-11 14:53:07,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:53:07,828 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-11 14:53:07,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:07,832 INFO  L225             Difference]: With dead ends: 470
[2020-10-11 14:53:07,832 INFO  L226             Difference]: Without dead ends: 470
[2020-10-11 14:53:07,832 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:53:07,834 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 470 states.
[2020-10-11 14:53:07,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470.
[2020-10-11 14:53:07,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 470 states.
[2020-10-11 14:53:07,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1406 transitions.
[2020-10-11 14:53:07,854 INFO  L78                 Accepts]: Start accepts. Automaton has 470 states and 1406 transitions. Word has length 12
[2020-10-11 14:53:07,854 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:07,854 INFO  L481      AbstractCegarLoop]: Abstraction has 470 states and 1406 transitions.
[2020-10-11 14:53:07,854 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:53:07,855 INFO  L276                IsEmpty]: Start isEmpty. Operand 470 states and 1406 transitions.
[2020-10-11 14:53:07,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 14:53:07,856 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:07,856 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:07,856 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 14:53:07,856 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:07,857 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:07,857 INFO  L82        PathProgramCache]: Analyzing trace with hash -1546482384, now seen corresponding path program 1 times
[2020-10-11 14:53:07,857 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:07,858 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237787185]
[2020-10-11 14:53:07,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:07,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:07,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:07,988 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237787185]
[2020-10-11 14:53:07,988 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:07,988 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:53:07,988 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023153165]
[2020-10-11 14:53:07,988 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:53:07,988 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:07,989 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:53:07,989 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:07,989 INFO  L87              Difference]: Start difference. First operand 470 states and 1406 transitions. Second operand 5 states.
[2020-10-11 14:53:08,060 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:08,060 INFO  L93              Difference]: Finished difference Result 494 states and 1464 transitions.
[2020-10-11 14:53:08,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:53:08,062 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-11 14:53:08,062 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:08,065 INFO  L225             Difference]: With dead ends: 494
[2020-10-11 14:53:08,066 INFO  L226             Difference]: Without dead ends: 494
[2020-10-11 14:53:08,066 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:08,068 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 494 states.
[2020-10-11 14:53:08,079 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 486.
[2020-10-11 14:53:08,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 486 states.
[2020-10-11 14:53:08,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1446 transitions.
[2020-10-11 14:53:08,082 INFO  L78                 Accepts]: Start accepts. Automaton has 486 states and 1446 transitions. Word has length 13
[2020-10-11 14:53:08,082 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:08,082 INFO  L481      AbstractCegarLoop]: Abstraction has 486 states and 1446 transitions.
[2020-10-11 14:53:08,082 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:53:08,082 INFO  L276                IsEmpty]: Start isEmpty. Operand 486 states and 1446 transitions.
[2020-10-11 14:53:08,083 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-11 14:53:08,084 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:08,084 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:08,084 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 14:53:08,084 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:08,084 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:08,085 INFO  L82        PathProgramCache]: Analyzing trace with hash -697643707, now seen corresponding path program 1 times
[2020-10-11 14:53:08,085 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:08,085 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262908004]
[2020-10-11 14:53:08,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:08,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:08,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:08,173 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262908004]
[2020-10-11 14:53:08,173 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:08,173 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:53:08,173 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273124306]
[2020-10-11 14:53:08,174 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:53:08,174 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:08,174 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:53:08,174 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:53:08,174 INFO  L87              Difference]: Start difference. First operand 486 states and 1446 transitions. Second operand 4 states.
[2020-10-11 14:53:08,214 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:08,215 INFO  L93              Difference]: Finished difference Result 472 states and 1245 transitions.
[2020-10-11 14:53:08,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:53:08,215 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-11 14:53:08,216 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:08,218 INFO  L225             Difference]: With dead ends: 472
[2020-10-11 14:53:08,218 INFO  L226             Difference]: Without dead ends: 344
[2020-10-11 14:53:08,218 INFO  L673         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-11 14:53:08,220 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 344 states.
[2020-10-11 14:53:08,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344.
[2020-10-11 14:53:08,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 344 states.
[2020-10-11 14:53:08,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 878 transitions.
[2020-10-11 14:53:08,229 INFO  L78                 Accepts]: Start accepts. Automaton has 344 states and 878 transitions. Word has length 14
[2020-10-11 14:53:08,229 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:08,229 INFO  L481      AbstractCegarLoop]: Abstraction has 344 states and 878 transitions.
[2020-10-11 14:53:08,229 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:53:08,229 INFO  L276                IsEmpty]: Start isEmpty. Operand 344 states and 878 transitions.
[2020-10-11 14:53:08,230 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:53:08,230 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:08,230 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:08,230 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 14:53:08,231 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:08,231 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:08,231 INFO  L82        PathProgramCache]: Analyzing trace with hash -1081476507, now seen corresponding path program 1 times
[2020-10-11 14:53:08,231 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:08,232 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166435266]
[2020-10-11 14:53:08,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:08,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:08,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:08,323 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166435266]
[2020-10-11 14:53:08,324 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:08,324 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:53:08,324 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092843452]
[2020-10-11 14:53:08,324 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:53:08,325 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:08,325 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:53:08,325 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:53:08,325 INFO  L87              Difference]: Start difference. First operand 344 states and 878 transitions. Second operand 5 states.
[2020-10-11 14:53:08,382 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:08,382 INFO  L93              Difference]: Finished difference Result 282 states and 663 transitions.
[2020-10-11 14:53:08,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:53:08,383 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-11 14:53:08,384 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:08,385 INFO  L225             Difference]: With dead ends: 282
[2020-10-11 14:53:08,385 INFO  L226             Difference]: Without dead ends: 217
[2020-10-11 14:53:08,385 INFO  L673         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-11 14:53:08,386 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2020-10-11 14:53:08,390 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217.
[2020-10-11 14:53:08,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 217 states.
[2020-10-11 14:53:08,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 497 transitions.
[2020-10-11 14:53:08,391 INFO  L78                 Accepts]: Start accepts. Automaton has 217 states and 497 transitions. Word has length 15
[2020-10-11 14:53:08,392 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:08,392 INFO  L481      AbstractCegarLoop]: Abstraction has 217 states and 497 transitions.
[2020-10-11 14:53:08,392 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:53:08,392 INFO  L276                IsEmpty]: Start isEmpty. Operand 217 states and 497 transitions.
[2020-10-11 14:53:08,393 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 14:53:08,393 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:08,393 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:08,393 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 14:53:08,393 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:08,394 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:08,394 INFO  L82        PathProgramCache]: Analyzing trace with hash -726028274, now seen corresponding path program 1 times
[2020-10-11 14:53:08,394 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:08,394 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940528486]
[2020-10-11 14:53:08,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:08,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:08,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:08,644 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940528486]
[2020-10-11 14:53:08,645 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:08,645 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:53:08,645 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946678519]
[2020-10-11 14:53:08,646 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:53:08,646 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:08,647 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:53:08,648 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:08,648 INFO  L87              Difference]: Start difference. First operand 217 states and 497 transitions. Second operand 7 states.
[2020-10-11 14:53:08,820 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:08,821 INFO  L93              Difference]: Finished difference Result 318 states and 690 transitions.
[2020-10-11 14:53:08,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:53:08,822 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-11 14:53:08,822 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:08,827 INFO  L225             Difference]: With dead ends: 318
[2020-10-11 14:53:08,827 INFO  L226             Difference]: Without dead ends: 302
[2020-10-11 14:53:08,827 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:53:08,830 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2020-10-11 14:53:08,837 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 249.
[2020-10-11 14:53:08,838 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 249 states.
[2020-10-11 14:53:08,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 561 transitions.
[2020-10-11 14:53:08,838 INFO  L78                 Accepts]: Start accepts. Automaton has 249 states and 561 transitions. Word has length 17
[2020-10-11 14:53:08,839 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:08,839 INFO  L481      AbstractCegarLoop]: Abstraction has 249 states and 561 transitions.
[2020-10-11 14:53:08,839 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:53:08,839 INFO  L276                IsEmpty]: Start isEmpty. Operand 249 states and 561 transitions.
[2020-10-11 14:53:08,840 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 14:53:08,840 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:08,840 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:08,840 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 14:53:08,840 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:08,841 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:08,841 INFO  L82        PathProgramCache]: Analyzing trace with hash 632441612, now seen corresponding path program 2 times
[2020-10-11 14:53:08,841 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:08,841 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517022247]
[2020-10-11 14:53:08,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:08,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:08,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:08,903 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517022247]
[2020-10-11 14:53:08,903 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:08,903 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:53:08,903 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50516704]
[2020-10-11 14:53:08,904 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:53:08,905 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:08,906 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:53:08,906 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:53:08,906 INFO  L87              Difference]: Start difference. First operand 249 states and 561 transitions. Second operand 4 states.
[2020-10-11 14:53:08,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:08,931 INFO  L93              Difference]: Finished difference Result 340 states and 746 transitions.
[2020-10-11 14:53:08,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:53:08,932 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-11 14:53:08,932 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:08,934 INFO  L225             Difference]: With dead ends: 340
[2020-10-11 14:53:08,934 INFO  L226             Difference]: Without dead ends: 244
[2020-10-11 14:53:08,934 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:53:08,935 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 244 states.
[2020-10-11 14:53:08,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 212.
[2020-10-11 14:53:08,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 212 states.
[2020-10-11 14:53:08,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 451 transitions.
[2020-10-11 14:53:08,941 INFO  L78                 Accepts]: Start accepts. Automaton has 212 states and 451 transitions. Word has length 17
[2020-10-11 14:53:08,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:08,944 INFO  L481      AbstractCegarLoop]: Abstraction has 212 states and 451 transitions.
[2020-10-11 14:53:08,944 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:53:08,944 INFO  L276                IsEmpty]: Start isEmpty. Operand 212 states and 451 transitions.
[2020-10-11 14:53:08,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-11 14:53:08,945 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:08,945 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:08,945 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 14:53:08,945 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:08,946 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:08,946 INFO  L82        PathProgramCache]: Analyzing trace with hash -1032040049, now seen corresponding path program 1 times
[2020-10-11 14:53:08,946 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:08,946 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104490264]
[2020-10-11 14:53:08,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:09,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:09,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:09,079 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104490264]
[2020-10-11 14:53:09,079 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:09,079 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:53:09,080 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132053353]
[2020-10-11 14:53:09,080 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:53:09,080 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:09,080 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:53:09,080 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:53:09,081 INFO  L87              Difference]: Start difference. First operand 212 states and 451 transitions. Second operand 6 states.
[2020-10-11 14:53:09,152 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:09,152 INFO  L93              Difference]: Finished difference Result 191 states and 408 transitions.
[2020-10-11 14:53:09,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:53:09,154 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-11 14:53:09,154 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:09,155 INFO  L225             Difference]: With dead ends: 191
[2020-10-11 14:53:09,156 INFO  L226             Difference]: Without dead ends: 113
[2020-10-11 14:53:09,156 INFO  L673         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-11 14:53:09,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2020-10-11 14:53:09,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109.
[2020-10-11 14:53:09,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2020-10-11 14:53:09,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 223 transitions.
[2020-10-11 14:53:09,161 INFO  L78                 Accepts]: Start accepts. Automaton has 109 states and 223 transitions. Word has length 18
[2020-10-11 14:53:09,161 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:09,162 INFO  L481      AbstractCegarLoop]: Abstraction has 109 states and 223 transitions.
[2020-10-11 14:53:09,162 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:53:09,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 109 states and 223 transitions.
[2020-10-11 14:53:09,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-11 14:53:09,163 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:09,163 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:09,163 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 14:53:09,164 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:09,164 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:09,164 INFO  L82        PathProgramCache]: Analyzing trace with hash 430399513, now seen corresponding path program 1 times
[2020-10-11 14:53:09,164 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:09,165 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946624412]
[2020-10-11 14:53:09,165 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:09,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:53:09,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:53:09,415 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946624412]
[2020-10-11 14:53:09,415 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:53:09,415 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 14:53:09,415 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503343701]
[2020-10-11 14:53:09,416 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-11 14:53:09,416 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:53:09,416 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-11 14:53:09,416 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:53:09,416 INFO  L87              Difference]: Start difference. First operand 109 states and 223 transitions. Second operand 8 states.
[2020-10-11 14:53:09,603 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:53:09,604 INFO  L93              Difference]: Finished difference Result 146 states and 284 transitions.
[2020-10-11 14:53:09,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-11 14:53:09,605 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 21
[2020-10-11 14:53:09,605 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:53:09,606 INFO  L225             Difference]: With dead ends: 146
[2020-10-11 14:53:09,606 INFO  L226             Difference]: Without dead ends: 120
[2020-10-11 14:53:09,606 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2020-10-11 14:53:09,607 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2020-10-11 14:53:09,609 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97.
[2020-10-11 14:53:09,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2020-10-11 14:53:09,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 195 transitions.
[2020-10-11 14:53:09,609 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 195 transitions. Word has length 21
[2020-10-11 14:53:09,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:53:09,610 INFO  L481      AbstractCegarLoop]: Abstraction has 97 states and 195 transitions.
[2020-10-11 14:53:09,610 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-11 14:53:09,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 195 transitions.
[2020-10-11 14:53:09,610 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-11 14:53:09,611 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:53:09,611 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:53:09,611 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 14:53:09,611 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:53:09,611 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:53:09,611 INFO  L82        PathProgramCache]: Analyzing trace with hash 288272655, now seen corresponding path program 2 times
[2020-10-11 14:53:09,612 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:53:09,612 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974067531]
[2020-10-11 14:53:09,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:53:09,647 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:53:09,647 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:53:09,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:53:09,676 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:53:09,710 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 14:53:09,711 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 14:53:09,711 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-11 14:53:09,712 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-11 14:53:09,722 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L821-->L828: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-2117278495 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-2117278495 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-2117278495 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-2117278495 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (or (and (= ~y~0_Out-2117278495 ~y$w_buff1~0_In-2117278495) .cse1 .cse2) (and (= ~y~0_Out-2117278495 ~y~0_In-2117278495) .cse3))) (and (= ~y~0_Out-2117278495 ~y$w_buff0~0_In-2117278495) .cse4 .cse5)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2117278495| ULTIMATE.start_assume_abort_if_not_~cond_Out-2117278495) (or (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-2117278495 0)) (and (= ~y$w_buff1_used~0_Out-2117278495 ~y$w_buff1_used~0_In-2117278495) .cse3)) (or (and (= ~y$w_buff0_used~0_In-2117278495 ~y$w_buff0_used~0_Out-2117278495) .cse0) (and .cse4 (= ~y$w_buff0_used~0_Out-2117278495 0) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2117278495 0)) (= ~y$r_buff0_thd0~0_Out-2117278495 ~y$r_buff0_thd0~0_In-2117278495) (= ~y$r_buff1_thd0~0_In-2117278495 ~y$r_buff1_thd0~0_Out-2117278495))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2117278495|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2117278495, ~y$w_buff1~0=~y$w_buff1~0_In-2117278495, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2117278495, ~y$w_buff0~0=~y$w_buff0~0_In-2117278495, ~y~0=~y~0_In-2117278495, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2117278495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2117278495}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-2117278495, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-2117278495|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-2117278495|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2117278495|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2117278495|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2117278495|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2117278495|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2117278495|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2117278495, ~y$w_buff1~0=~y$w_buff1~0_In-2117278495, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-2117278495, ~y$w_buff0~0=~y$w_buff0~0_In-2117278495, ~y~0=~y~0_Out-2117278495, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2117278495, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-2117278495}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-11 14:53:09,728 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,728 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,729 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,729 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,730 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,730 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,730 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,730 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,730 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,731 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,731 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,731 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,731 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,732 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,732 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,732 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,732 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,732 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,732 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,732 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,733 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,733 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,733 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,733 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,734 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,734 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,734 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,734 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,735 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,735 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,735 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,735 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,735 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,735 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,736 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,736 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,736 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,736 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,737 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,737 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,737 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,737 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,737 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:53:09,737 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:53:09,827 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:53:09 BasicIcfg
[2020-10-11 14:53:09,827 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 14:53:09,830 INFO  L168              Benchmark]: Toolchain (without parser) took 16224.40 ms. Allocated memory was 251.1 MB in the beginning and 536.3 MB in the end (delta: 285.2 MB). Free memory was 205.7 MB in the beginning and 225.9 MB in the end (delta: -20.3 MB). Peak memory consumption was 264.9 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:09,831 INFO  L168              Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 251.1 MB. Free memory was 229.2 MB in the beginning and 228.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB.
[2020-10-11 14:53:09,832 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 755.89 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 205.7 MB in the beginning and 266.3 MB in the end (delta: -60.6 MB). Peak memory consumption was 34.0 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:09,833 INFO  L168              Benchmark]: Boogie Procedure Inliner took 68.83 ms. Allocated memory is still 314.6 MB. Free memory was 266.3 MB in the beginning and 263.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:09,834 INFO  L168              Benchmark]: Boogie Preprocessor took 44.85 ms. Allocated memory is still 314.6 MB. Free memory was 263.8 MB in the beginning and 261.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:09,837 INFO  L168              Benchmark]: RCFGBuilder took 2007.59 ms. Allocated memory was 314.6 MB in the beginning and 358.6 MB in the end (delta: 44.0 MB). Free memory was 261.3 MB in the beginning and 211.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 100.9 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:09,838 INFO  L168              Benchmark]: TraceAbstraction took 13341.83 ms. Allocated memory was 358.6 MB in the beginning and 536.3 MB in the end (delta: 177.7 MB). Free memory was 211.1 MB in the beginning and 225.9 MB in the end (delta: -14.8 MB). Peak memory consumption was 162.9 MB. Max. memory is 14.2 GB.
[2020-10-11 14:53:09,844 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.22 ms. Allocated memory is still 251.1 MB. Free memory was 229.2 MB in the beginning and 228.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 755.89 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 205.7 MB in the beginning and 266.3 MB in the end (delta: -60.6 MB). Peak memory consumption was 34.0 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 68.83 ms. Allocated memory is still 314.6 MB. Free memory was 266.3 MB in the beginning and 263.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 44.85 ms. Allocated memory is still 314.6 MB. Free memory was 263.8 MB in the beginning and 261.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2007.59 ms. Allocated memory was 314.6 MB in the beginning and 358.6 MB in the end (delta: 44.0 MB). Free memory was 261.3 MB in the beginning and 211.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 100.9 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 13341.83 ms. Allocated memory was 358.6 MB in the beginning and 536.3 MB in the end (delta: 177.7 MB). Free memory was 211.1 MB in the beginning and 225.9 MB in the end (delta: -14.8 MB). Peak memory consumption was 162.9 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1223 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 141 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.6s, 103 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 26 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 4495 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p2_EAX = 0;
[L702]               0  int __unbuffered_p2_EBX = 0;
[L704]               0  int a = 0;
[L705]               0  _Bool main$tmp_guard0;
[L706]               0  _Bool main$tmp_guard1;
[L708]               0  int x = 0;
[L710]               0  int y = 0;
[L711]               0  _Bool y$flush_delayed;
[L712]               0  int y$mem_tmp;
[L713]               0  _Bool y$r_buff0_thd0;
[L714]               0  _Bool y$r_buff0_thd1;
[L715]               0  _Bool y$r_buff0_thd2;
[L716]               0  _Bool y$r_buff0_thd3;
[L717]               0  _Bool y$r_buff1_thd0;
[L718]               0  _Bool y$r_buff1_thd1;
[L719]               0  _Bool y$r_buff1_thd2;
[L720]               0  _Bool y$r_buff1_thd3;
[L721]               0  _Bool y$read_delayed;
[L722]               0  int *y$read_delayed_var;
[L723]               0  int y$w_buff0;
[L724]               0  _Bool y$w_buff0_used;
[L725]               0  int y$w_buff1;
[L726]               0  _Bool y$w_buff1_used;
[L728]               0  int z = 0;
[L729]               0  _Bool weak$$choice0;
[L730]               0  _Bool weak$$choice2;
[L812]               0  pthread_t t1214;
[L813]  FCALL, FORK  0  pthread_create(&t1214, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L814]               0  pthread_t t1215;
[L815]  FCALL, FORK  0  pthread_create(&t1215, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L816]               0  pthread_t t1216;
[L817]  FCALL, FORK  0  pthread_create(&t1216, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L769]               3  y$w_buff1 = y$w_buff0
[L770]               3  y$w_buff0 = 2
[L771]               3  y$w_buff1_used = y$w_buff0_used
[L772]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L774]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L775]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L776]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L777]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L778]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L781]               3  z = 1
[L784]               3  __unbuffered_p2_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L787]               3  __unbuffered_p2_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L734]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L737]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L742]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L744]               1  return 0;
[L749]               2  x = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L752]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L790]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L790]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L794]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L755]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L755]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L755]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L755]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L756]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L756]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L757]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L757]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L758]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L758]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L759]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L759]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L762]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L764]               2  return 0;
[L819]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L830]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L831]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L832]               0  y$flush_delayed = weak$$choice2
[L833]               0  y$mem_tmp = y
[L834]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L834]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L835]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L835]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L835]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L835]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L836]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L836]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L836]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1
[L836]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L836]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L836]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L837]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L837]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L838]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L838]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L839]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L839]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L840]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L841]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L842]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L842]               0  y = y$flush_delayed ? y$mem_tmp : y
[L843]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 308 SDtfs, 306 SDslu, 452 SDs, 0 SdLazy, 267 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 120 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 18501 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...