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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:19:31,046 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:19:31,049 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:19:31,093 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:19:31,093 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:19:31,104 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:19:31,106 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:19:31,108 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:19:31,110 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:19:31,113 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:19:31,114 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:19:31,115 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:19:31,115 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:19:31,116 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:19:31,117 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:19:31,118 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:19:31,119 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:19:31,119 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:19:31,121 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:19:31,127 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:19:31,128 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:19:31,131 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:19:31,132 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:19:31,133 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:19:31,138 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:19:31,138 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:19:31,138 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:19:31,141 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:19:31,141 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:19:31,144 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:19:31,144 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:19:31,145 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:19:31,146 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:19:31,146 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:19:31,147 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:19:31,148 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:19:31,148 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:19:31,149 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:19:31,149 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:19:31,150 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:19:31,152 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:19:31,152 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:19:31,194 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:19:31,194 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:19:31,196 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:19:31,197 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:19:31,197 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:19:31,197 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:19:31,197 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:19:31,198 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:19:31,198 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:19:31,198 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:19:31,199 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:19:31,199 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:19:31,200 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:19:31,200 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:19:31,201 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:19:31,201 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:19:31,201 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:19:31,201 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:19:31,201 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:19:31,202 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:19:31,202 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:19:31,202 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:19:31,203 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:19:31,203 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:19:31,204 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:19:31,204 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:19:31,204 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:19:31,204 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:19:31,204 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:19:31,205 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:19:31,482 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:19:31,494 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:19:31,498 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:19:31,499 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:19:31,500 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:19:31,501 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i
[2020-10-16 11:19:31,580 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1852a0f37/e2f7bd32cb7e41c5ae1a74274d1f1a63/FLAG68e4d8fc1
[2020-10-16 11:19:32,190 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:19:32,190 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i
[2020-10-16 11:19:32,206 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1852a0f37/e2f7bd32cb7e41c5ae1a74274d1f1a63/FLAG68e4d8fc1
[2020-10-16 11:19:32,517 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1852a0f37/e2f7bd32cb7e41c5ae1a74274d1f1a63
[2020-10-16 11:19:32,528 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:19:32,530 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:19:32,531 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:19:32,531 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:19:32,535 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:19:32,536 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:19:32" (1/1) ...
[2020-10-16 11:19:32,539 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a50daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:32, skipping insertion in model container
[2020-10-16 11:19:32,540 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:19:32" (1/1) ...
[2020-10-16 11:19:32,548 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:19:32,622 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:19:33,175 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:19:33,186 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:19:33,248 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:19:33,335 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:19:33,336 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33 WrapperNode
[2020-10-16 11:19:33,336 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:19:33,337 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:19:33,337 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:19:33,338 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:19:33,348 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,379 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,442 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:19:33,442 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:19:33,443 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:19:33,443 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:19:33,455 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,455 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,477 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,478 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,488 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,493 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,497 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
[2020-10-16 11:19:33,502 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:19:33,503 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:19:33,503 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:19:33,503 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:19:33,505 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:19:33,574 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:19:33,574 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:19:33,575 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:19:33,575 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:19:33,575 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:19:33,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:19:33,575 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:19:33,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:19:33,576 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:19:33,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:19:33,576 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:19:33,576 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:19:33,577 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:19:33,579 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:19:35,650 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:19:35,651 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:19:35,653 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:19:35 BoogieIcfgContainer
[2020-10-16 11:19:35,654 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:19:35,655 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:19:35,655 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:19:35,659 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:19:35,659 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:19:32" (1/3) ...
[2020-10-16 11:19:35,660 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404e1a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:19:35, skipping insertion in model container
[2020-10-16 11:19:35,661 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:33" (2/3) ...
[2020-10-16 11:19:35,661 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404e1a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:19:35, skipping insertion in model container
[2020-10-16 11:19:35,661 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:19:35" (3/3) ...
[2020-10-16 11:19:35,663 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe017_power.opt.i
[2020-10-16 11:19:35,676 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:19:35,677 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:19:35,685 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:19:35,686 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:19:35,719 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,719 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,720 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,720 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,720 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,720 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,721 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,721 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,721 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,722 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,722 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,722 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,722 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,722 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,723 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,723 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,723 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,724 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,724 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,724 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,724 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,725 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,725 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,725 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,725 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,725 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,726 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,726 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,726 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,727 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,727 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,727 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,727 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,728 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,728 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,728 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,728 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,729 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,729 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,729 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,729 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,730 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,730 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,734 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,735 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,736 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,736 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,736 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,737 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,737 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,742 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,742 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,742 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,743 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,743 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,744 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,744 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,746 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,746 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,746 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,746 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,747 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,748 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:19:35,752 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:19:35,767 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 11:19:35,790 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:19:35,790 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:19:35,790 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:19:35,790 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:19:35,791 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:19:35,791 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:19:35,791 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:19:35,791 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:19:35,806 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:19:35,809 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow
[2020-10-16 11:19:35,812 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow
[2020-10-16 11:19:35,814 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow
[2020-10-16 11:19:35,861 INFO  L129       PetriNetUnfolder]: 2/87 cut-off events.
[2020-10-16 11:19:35,861 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:19:35,867 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. 
[2020-10-16 11:19:35,871 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1560
[2020-10-16 11:19:36,735 WARN  L193               SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:19:36,880 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:36,881 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:36,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:36,883 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:36,919 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:36,920 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:36,922 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:36,923 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:36,960 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:36,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:36,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:36,962 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:36,966 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:36,967 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:36,970 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:36,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:36,990 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:36,991 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:36,992 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:36,993 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:36,996 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:36,997 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,000 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:37,000 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,046 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,047 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,048 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,048 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,051 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,055 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:37,055 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,072 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,072 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,073 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,074 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,076 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,077 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,079 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:37,080 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:37,276 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:37,277 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,278 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:37,278 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,281 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:37,282 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:37,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:37,286 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,335 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,336 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,338 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,339 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,340 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,341 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,344 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,344 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:37,347 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,348 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:37,349 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,350 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:37,353 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:37,353 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,355 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:37,356 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,357 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:37,358 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,464 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:37,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,466 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:37,466 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,493 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:37,493 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:37,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,543 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,544 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:37,546 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,547 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,548 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,548 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,551 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,552 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:37,555 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,555 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:37,557 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:37,557 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:37,559 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:37,560 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:37,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,565 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:37,565 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,610 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:37,610 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,611 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:37,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,614 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:37,615 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:37,617 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:37,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:37,998 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:37,999 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,021 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,022 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,053 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,055 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,055 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,056 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,056 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,057 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,058 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,060 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,060 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,063 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,063 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,065 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,065 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,112 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,112 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,113 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,116 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:38,116 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:38,122 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,123 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,169 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,169 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,170 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,170 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,189 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,189 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,190 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,191 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,227 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,228 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,229 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-16 11:19:38,229 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,253 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,254 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,255 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,296 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2020-10-16 11:19:38,296 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,297 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,298 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,333 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,333 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,334 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,336 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,336 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,339 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,339 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,340 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,340 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,378 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,378 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,379 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,380 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,398 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,398 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,399 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,399 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,430 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,431 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,432 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,432 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,451 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,451 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,452 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-16 11:19:38,452 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,500 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,503 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,503 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,505 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,506 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,508 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,509 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,509 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,511 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,511 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,513 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,514 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,515 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,515 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,567 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,568 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,568 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,569 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,571 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:38,571 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:38,574 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,574 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,932 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,932 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,933 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:38,933 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,935 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:38,936 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:38,938 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,938 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,980 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:38,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,983 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,985 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,986 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,988 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,988 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,989 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:38,989 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:38,991 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:38,991 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,994 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,994 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:38,996 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:38,996 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,070 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,071 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,073 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-16 11:19:39,074 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:19:39,076 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,076 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:39,108 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:39,126 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,126 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,127 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,127 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,130 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,131 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,132 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,132 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,134 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:39,134 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:19:39,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,139 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-16 11:19:39,140 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,379 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,380 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,381 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,381 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,399 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-16 11:19:39,400 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:39,401 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:39,401 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,581 WARN  L193               SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 229 DAG size of output: 189
[2020-10-16 11:19:40,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-16 11:19:40,588 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:40,589 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:40,589 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:41,542 WARN  L193               SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 108
[2020-10-16 11:19:41,981 WARN  L193               SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83
[2020-10-16 11:19:42,085 WARN  L193               SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2020-10-16 11:19:43,585 WARN  L193               SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 243 DAG size of output: 203
[2020-10-16 11:19:43,594 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-16 11:19:43,595 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:43,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-16 11:19:43,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:19:45,081 WARN  L193               SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 159 DAG size of output: 130
[2020-10-16 11:19:45,164 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,164 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,165 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,166 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,168 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,168 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,170 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,171 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,196 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,197 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,199 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,199 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,201 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,201 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,235 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,236 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,236 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,237 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,239 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,240 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,242 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,243 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,261 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,261 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,262 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,262 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,266 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,267 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,325 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:19:45,325 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,361 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,362 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,363 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,363 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,365 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,366 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,367 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,368 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,385 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,386 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,387 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,387 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,389 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,389 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,391 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,392 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,425 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,425 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,427 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,428 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,430 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,430 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,452 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,452 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,453 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:19:45,456 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:19:45,457 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,459 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:19:45,459 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:19:45,488 INFO  L132        LiptonReduction]: Checked pairs total: 4070
[2020-10-16 11:19:45,488 INFO  L134        LiptonReduction]: Total number of compositions: 78
[2020-10-16 11:19:45,503 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow
[2020-10-16 11:19:45,579 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states.
[2020-10-16 11:19:45,581 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states.
[2020-10-16 11:19:45,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-16 11:19:45,590 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:45,591 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-16 11:19:45,592 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:45,597 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:45,598 INFO  L82        PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times
[2020-10-16 11:19:45,609 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:45,609 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981861034]
[2020-10-16 11:19:45,610 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:45,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:45,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:45,853 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981861034]
[2020-10-16 11:19:45,854 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:45,855 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:45,855 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609906530]
[2020-10-16 11:19:45,861 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:45,861 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:45,876 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:45,877 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:45,879 INFO  L87              Difference]: Start difference. First operand 662 states. Second operand 3 states.
[2020-10-16 11:19:45,990 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:45,990 INFO  L93              Difference]: Finished difference Result 552 states and 1697 transitions.
[2020-10-16 11:19:45,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:45,993 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-16 11:19:45,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,031 INFO  L225             Difference]: With dead ends: 552
[2020-10-16 11:19:46,032 INFO  L226             Difference]: Without dead ends: 452
[2020-10-16 11:19:46,033 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,063 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2020-10-16 11:19:46,128 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452.
[2020-10-16 11:19:46,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 452 states.
[2020-10-16 11:19:46,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions.
[2020-10-16 11:19:46,138 INFO  L78                 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3
[2020-10-16 11:19:46,139 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:46,139 INFO  L481      AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions.
[2020-10-16 11:19:46,139 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:46,139 INFO  L276                IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions.
[2020-10-16 11:19:46,140 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:19:46,141 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:46,141 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:46,141 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:19:46,141 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:46,142 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:46,142 INFO  L82        PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times
[2020-10-16 11:19:46,142 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:46,142 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364708170]
[2020-10-16 11:19:46,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:46,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:46,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:46,278 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364708170]
[2020-10-16 11:19:46,278 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:46,278 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:46,279 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095572882]
[2020-10-16 11:19:46,280 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:46,281 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:46,281 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:46,281 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,281 INFO  L87              Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states.
[2020-10-16 11:19:46,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:46,300 INFO  L93              Difference]: Finished difference Result 442 states and 1324 transitions.
[2020-10-16 11:19:46,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:46,302 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 11:19:46,302 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,307 INFO  L225             Difference]: With dead ends: 442
[2020-10-16 11:19:46,307 INFO  L226             Difference]: Without dead ends: 442
[2020-10-16 11:19:46,308 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 442 states.
[2020-10-16 11:19:46,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442.
[2020-10-16 11:19:46,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 442 states.
[2020-10-16 11:19:46,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions.
[2020-10-16 11:19:46,335 INFO  L78                 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 9
[2020-10-16 11:19:46,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:46,337 INFO  L481      AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions.
[2020-10-16 11:19:46,337 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:46,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions.
[2020-10-16 11:19:46,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 11:19:46,339 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:46,339 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:46,339 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:19:46,339 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:46,340 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:46,340 INFO  L82        PathProgramCache]: Analyzing trace with hash -1657178972, now seen corresponding path program 1 times
[2020-10-16 11:19:46,340 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:46,340 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355602078]
[2020-10-16 11:19:46,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:46,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:46,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:46,414 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355602078]
[2020-10-16 11:19:46,414 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:46,414 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:46,414 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802261201]
[2020-10-16 11:19:46,415 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:46,415 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:46,415 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:46,415 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,415 INFO  L87              Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states.
[2020-10-16 11:19:46,448 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:46,448 INFO  L93              Difference]: Finished difference Result 439 states and 1313 transitions.
[2020-10-16 11:19:46,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:46,451 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-16 11:19:46,451 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,454 INFO  L225             Difference]: With dead ends: 439
[2020-10-16 11:19:46,455 INFO  L226             Difference]: Without dead ends: 439
[2020-10-16 11:19:46,455 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 439 states.
[2020-10-16 11:19:46,474 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439.
[2020-10-16 11:19:46,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 439 states.
[2020-10-16 11:19:46,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1313 transitions.
[2020-10-16 11:19:46,477 INFO  L78                 Accepts]: Start accepts. Automaton has 439 states and 1313 transitions. Word has length 10
[2020-10-16 11:19:46,478 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:46,478 INFO  L481      AbstractCegarLoop]: Abstraction has 439 states and 1313 transitions.
[2020-10-16 11:19:46,478 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:46,478 INFO  L276                IsEmpty]: Start isEmpty. Operand 439 states and 1313 transitions.
[2020-10-16 11:19:46,480 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:19:46,480 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:46,480 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:46,480 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:19:46,480 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:46,481 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:46,481 INFO  L82        PathProgramCache]: Analyzing trace with hash -872477858, now seen corresponding path program 1 times
[2020-10-16 11:19:46,481 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:46,481 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421556776]
[2020-10-16 11:19:46,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:46,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:46,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:46,584 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421556776]
[2020-10-16 11:19:46,584 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:46,584 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:19:46,584 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735742925]
[2020-10-16 11:19:46,585 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:19:46,585 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:46,585 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:19:46,585 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:46,585 INFO  L87              Difference]: Start difference. First operand 439 states and 1313 transitions. Second operand 5 states.
[2020-10-16 11:19:46,699 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:46,699 INFO  L93              Difference]: Finished difference Result 622 states and 1777 transitions.
[2020-10-16 11:19:46,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:19:46,702 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2020-10-16 11:19:46,702 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,706 INFO  L225             Difference]: With dead ends: 622
[2020-10-16 11:19:46,707 INFO  L226             Difference]: Without dead ends: 469
[2020-10-16 11:19:46,707 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:46,715 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 469 states.
[2020-10-16 11:19:46,726 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 424.
[2020-10-16 11:19:46,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 424 states.
[2020-10-16 11:19:46,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1210 transitions.
[2020-10-16 11:19:46,729 INFO  L78                 Accepts]: Start accepts. Automaton has 424 states and 1210 transitions. Word has length 11
[2020-10-16 11:19:46,729 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:46,729 INFO  L481      AbstractCegarLoop]: Abstraction has 424 states and 1210 transitions.
[2020-10-16 11:19:46,729 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:19:46,729 INFO  L276                IsEmpty]: Start isEmpty. Operand 424 states and 1210 transitions.
[2020-10-16 11:19:46,736 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:19:46,737 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:46,737 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:46,737 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:19:46,737 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:46,737 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:46,737 INFO  L82        PathProgramCache]: Analyzing trace with hash 1529992242, now seen corresponding path program 1 times
[2020-10-16 11:19:46,738 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:46,738 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439198442]
[2020-10-16 11:19:46,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:46,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:46,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:46,813 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439198442]
[2020-10-16 11:19:46,814 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:46,814 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:19:46,814 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836133811]
[2020-10-16 11:19:46,814 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:19:46,815 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:46,815 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:19:46,815 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,815 INFO  L87              Difference]: Start difference. First operand 424 states and 1210 transitions. Second operand 3 states.
[2020-10-16 11:19:46,825 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:46,825 INFO  L93              Difference]: Finished difference Result 412 states and 1169 transitions.
[2020-10-16 11:19:46,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:19:46,827 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 11:19:46,827 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:46,830 INFO  L225             Difference]: With dead ends: 412
[2020-10-16 11:19:46,830 INFO  L226             Difference]: Without dead ends: 412
[2020-10-16 11:19:46,830 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:19:46,833 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 412 states.
[2020-10-16 11:19:46,843 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412.
[2020-10-16 11:19:46,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 412 states.
[2020-10-16 11:19:46,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1169 transitions.
[2020-10-16 11:19:46,846 INFO  L78                 Accepts]: Start accepts. Automaton has 412 states and 1169 transitions. Word has length 11
[2020-10-16 11:19:46,846 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:46,847 INFO  L481      AbstractCegarLoop]: Abstraction has 412 states and 1169 transitions.
[2020-10-16 11:19:46,847 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:19:46,847 INFO  L276                IsEmpty]: Start isEmpty. Operand 412 states and 1169 transitions.
[2020-10-16 11:19:46,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:19:46,848 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:46,848 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:46,848 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:19:46,848 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:46,848 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:46,849 INFO  L82        PathProgramCache]: Analyzing trace with hash 167058694, now seen corresponding path program 1 times
[2020-10-16 11:19:46,849 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:46,849 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775831722]
[2020-10-16 11:19:46,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:46,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:46,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:46,981 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775831722]
[2020-10-16 11:19:46,981 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:46,981 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:19:46,982 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409185734]
[2020-10-16 11:19:46,982 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:19:46,982 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:46,982 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:19:46,983 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:46,983 INFO  L87              Difference]: Start difference. First operand 412 states and 1169 transitions. Second operand 4 states.
[2020-10-16 11:19:47,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,034 INFO  L93              Difference]: Finished difference Result 409 states and 1158 transitions.
[2020-10-16 11:19:47,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:47,035 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 11:19:47,035 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,038 INFO  L225             Difference]: With dead ends: 409
[2020-10-16 11:19:47,038 INFO  L226             Difference]: Without dead ends: 409
[2020-10-16 11:19:47,039 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-16 11:19:47,041 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 409 states.
[2020-10-16 11:19:47,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409.
[2020-10-16 11:19:47,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 409 states.
[2020-10-16 11:19:47,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1158 transitions.
[2020-10-16 11:19:47,052 INFO  L78                 Accepts]: Start accepts. Automaton has 409 states and 1158 transitions. Word has length 11
[2020-10-16 11:19:47,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,053 INFO  L481      AbstractCegarLoop]: Abstraction has 409 states and 1158 transitions.
[2020-10-16 11:19:47,053 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:19:47,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 409 states and 1158 transitions.
[2020-10-16 11:19:47,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:19:47,054 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,054 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,054 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:19:47,054 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,054 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,055 INFO  L82        PathProgramCache]: Analyzing trace with hash 185118520, now seen corresponding path program 1 times
[2020-10-16 11:19:47,055 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,055 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246065500]
[2020-10-16 11:19:47,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,298 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246065500]
[2020-10-16 11:19:47,298 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,298 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:19:47,299 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066092111]
[2020-10-16 11:19:47,299 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:19:47,299 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,300 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:19:47,301 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:47,301 INFO  L87              Difference]: Start difference. First operand 409 states and 1158 transitions. Second operand 5 states.
[2020-10-16 11:19:47,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,415 INFO  L93              Difference]: Finished difference Result 423 states and 1182 transitions.
[2020-10-16 11:19:47,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:47,417 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-16 11:19:47,417 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,420 INFO  L225             Difference]: With dead ends: 423
[2020-10-16 11:19:47,420 INFO  L226             Difference]: Without dead ends: 423
[2020-10-16 11:19:47,421 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:47,423 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 423 states.
[2020-10-16 11:19:47,433 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423.
[2020-10-16 11:19:47,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 423 states.
[2020-10-16 11:19:47,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1182 transitions.
[2020-10-16 11:19:47,435 INFO  L78                 Accepts]: Start accepts. Automaton has 423 states and 1182 transitions. Word has length 12
[2020-10-16 11:19:47,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,436 INFO  L481      AbstractCegarLoop]: Abstraction has 423 states and 1182 transitions.
[2020-10-16 11:19:47,436 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:19:47,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 423 states and 1182 transitions.
[2020-10-16 11:19:47,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:19:47,437 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,438 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,438 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:19:47,438 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,438 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,438 INFO  L82        PathProgramCache]: Analyzing trace with hash 883850748, now seen corresponding path program 1 times
[2020-10-16 11:19:47,438 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,439 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537259866]
[2020-10-16 11:19:47,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,510 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537259866]
[2020-10-16 11:19:47,510 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,510 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:19:47,511 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791932237]
[2020-10-16 11:19:47,511 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:19:47,511 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,511 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:19:47,512 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:47,512 INFO  L87              Difference]: Start difference. First operand 423 states and 1182 transitions. Second operand 4 states.
[2020-10-16 11:19:47,579 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,579 INFO  L93              Difference]: Finished difference Result 431 states and 1207 transitions.
[2020-10-16 11:19:47,580 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:47,580 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-16 11:19:47,581 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,584 INFO  L225             Difference]: With dead ends: 431
[2020-10-16 11:19:47,584 INFO  L226             Difference]: Without dead ends: 431
[2020-10-16 11:19:47,588 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-16 11:19:47,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 431 states.
[2020-10-16 11:19:47,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427.
[2020-10-16 11:19:47,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 427 states.
[2020-10-16 11:19:47,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1193 transitions.
[2020-10-16 11:19:47,603 INFO  L78                 Accepts]: Start accepts. Automaton has 427 states and 1193 transitions. Word has length 12
[2020-10-16 11:19:47,603 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,604 INFO  L481      AbstractCegarLoop]: Abstraction has 427 states and 1193 transitions.
[2020-10-16 11:19:47,604 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:19:47,604 INFO  L276                IsEmpty]: Start isEmpty. Operand 427 states and 1193 transitions.
[2020-10-16 11:19:47,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:19:47,605 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,605 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,605 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:19:47,605 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,605 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,606 INFO  L82        PathProgramCache]: Analyzing trace with hash 882578508, now seen corresponding path program 2 times
[2020-10-16 11:19:47,606 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,607 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272014345]
[2020-10-16 11:19:47,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:47,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:47,764 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272014345]
[2020-10-16 11:19:47,764 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:47,764 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:19:47,764 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314031029]
[2020-10-16 11:19:47,765 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:19:47,765 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:47,765 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:19:47,765 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:47,766 INFO  L87              Difference]: Start difference. First operand 427 states and 1193 transitions. Second operand 5 states.
[2020-10-16 11:19:47,907 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:47,908 INFO  L93              Difference]: Finished difference Result 422 states and 1177 transitions.
[2020-10-16 11:19:47,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:47,909 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-16 11:19:47,909 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:47,912 INFO  L225             Difference]: With dead ends: 422
[2020-10-16 11:19:47,912 INFO  L226             Difference]: Without dead ends: 422
[2020-10-16 11:19:47,912 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:47,914 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 422 states.
[2020-10-16 11:19:47,924 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414.
[2020-10-16 11:19:47,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 414 states.
[2020-10-16 11:19:47,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1152 transitions.
[2020-10-16 11:19:47,927 INFO  L78                 Accepts]: Start accepts. Automaton has 414 states and 1152 transitions. Word has length 12
[2020-10-16 11:19:47,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:47,927 INFO  L481      AbstractCegarLoop]: Abstraction has 414 states and 1152 transitions.
[2020-10-16 11:19:47,927 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:19:47,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 414 states and 1152 transitions.
[2020-10-16 11:19:47,928 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:19:47,928 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:47,929 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:47,929 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:19:47,929 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:47,929 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:47,929 INFO  L82        PathProgramCache]: Analyzing trace with hash 939905806, now seen corresponding path program 1 times
[2020-10-16 11:19:47,930 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:47,930 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74467736]
[2020-10-16 11:19:47,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:47,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:48,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:48,222 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74467736]
[2020-10-16 11:19:48,222 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:48,223 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:19:48,223 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739642858]
[2020-10-16 11:19:48,223 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:19:48,223 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:48,224 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:19:48,224 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:48,224 INFO  L87              Difference]: Start difference. First operand 414 states and 1152 transitions. Second operand 6 states.
[2020-10-16 11:19:48,331 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:48,332 INFO  L93              Difference]: Finished difference Result 410 states and 1138 transitions.
[2020-10-16 11:19:48,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:19:48,333 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 13
[2020-10-16 11:19:48,333 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:48,336 INFO  L225             Difference]: With dead ends: 410
[2020-10-16 11:19:48,336 INFO  L226             Difference]: Without dead ends: 410
[2020-10-16 11:19:48,336 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:19:48,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 410 states.
[2020-10-16 11:19:48,347 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 394.
[2020-10-16 11:19:48,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 394 states.
[2020-10-16 11:19:48,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1106 transitions.
[2020-10-16 11:19:48,350 INFO  L78                 Accepts]: Start accepts. Automaton has 394 states and 1106 transitions. Word has length 13
[2020-10-16 11:19:48,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:48,350 INFO  L481      AbstractCegarLoop]: Abstraction has 394 states and 1106 transitions.
[2020-10-16 11:19:48,350 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:19:48,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 394 states and 1106 transitions.
[2020-10-16 11:19:48,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:19:48,351 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:48,352 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:48,352 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:19:48,352 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:48,352 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:48,352 INFO  L82        PathProgramCache]: Analyzing trace with hash 1443705354, now seen corresponding path program 1 times
[2020-10-16 11:19:48,353 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:48,353 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613513554]
[2020-10-16 11:19:48,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:48,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:48,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:48,473 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613513554]
[2020-10-16 11:19:48,473 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:48,473 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:19:48,474 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897825926]
[2020-10-16 11:19:48,474 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:19:48,474 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:48,474 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:19:48,475 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:48,475 INFO  L87              Difference]: Start difference. First operand 394 states and 1106 transitions. Second operand 6 states.
[2020-10-16 11:19:48,654 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:48,655 INFO  L93              Difference]: Finished difference Result 470 states and 1303 transitions.
[2020-10-16 11:19:48,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:19:48,656 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 13
[2020-10-16 11:19:48,656 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:48,659 INFO  L225             Difference]: With dead ends: 470
[2020-10-16 11:19:48,659 INFO  L226             Difference]: Without dead ends: 446
[2020-10-16 11:19:48,660 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:19:48,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 446 states.
[2020-10-16 11:19:48,672 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440.
[2020-10-16 11:19:48,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 440 states.
[2020-10-16 11:19:48,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1226 transitions.
[2020-10-16 11:19:48,675 INFO  L78                 Accepts]: Start accepts. Automaton has 440 states and 1226 transitions. Word has length 13
[2020-10-16 11:19:48,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:48,675 INFO  L481      AbstractCegarLoop]: Abstraction has 440 states and 1226 transitions.
[2020-10-16 11:19:48,675 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:19:48,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 440 states and 1226 transitions.
[2020-10-16 11:19:48,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:19:48,676 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:48,677 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:48,677 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:19:48,677 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:48,677 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:48,677 INFO  L82        PathProgramCache]: Analyzing trace with hash 1393638489, now seen corresponding path program 1 times
[2020-10-16 11:19:48,677 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:48,678 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976262065]
[2020-10-16 11:19:48,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:48,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:48,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:48,800 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976262065]
[2020-10-16 11:19:48,801 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:48,801 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:19:48,801 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468338216]
[2020-10-16 11:19:48,801 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:19:48,801 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:48,802 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:19:48,802 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:19:48,802 INFO  L87              Difference]: Start difference. First operand 440 states and 1226 transitions. Second operand 4 states.
[2020-10-16 11:19:48,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:48,839 INFO  L93              Difference]: Finished difference Result 432 states and 1062 transitions.
[2020-10-16 11:19:48,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:19:48,840 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 11:19:48,840 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:48,842 INFO  L225             Difference]: With dead ends: 432
[2020-10-16 11:19:48,842 INFO  L226             Difference]: Without dead ends: 316
[2020-10-16 11:19:48,843 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:48,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 316 states.
[2020-10-16 11:19:48,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316.
[2020-10-16 11:19:48,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 316 states.
[2020-10-16 11:19:48,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 754 transitions.
[2020-10-16 11:19:48,853 INFO  L78                 Accepts]: Start accepts. Automaton has 316 states and 754 transitions. Word has length 14
[2020-10-16 11:19:48,854 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:48,855 INFO  L481      AbstractCegarLoop]: Abstraction has 316 states and 754 transitions.
[2020-10-16 11:19:48,855 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:19:48,855 INFO  L276                IsEmpty]: Start isEmpty. Operand 316 states and 754 transitions.
[2020-10-16 11:19:48,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:19:48,856 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:48,856 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:48,856 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 11:19:48,856 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:48,857 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:48,857 INFO  L82        PathProgramCache]: Analyzing trace with hash 211902524, now seen corresponding path program 1 times
[2020-10-16 11:19:48,857 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:48,857 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397758658]
[2020-10-16 11:19:48,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:48,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:49,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:49,001 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397758658]
[2020-10-16 11:19:49,001 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:49,001 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:19:49,002 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722760587]
[2020-10-16 11:19:49,004 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:19:49,004 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:49,005 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:19:49,005 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:19:49,005 INFO  L87              Difference]: Start difference. First operand 316 states and 754 transitions. Second operand 5 states.
[2020-10-16 11:19:49,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:49,057 INFO  L93              Difference]: Finished difference Result 261 states and 573 transitions.
[2020-10-16 11:19:49,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:19:49,057 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:19:49,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:49,059 INFO  L225             Difference]: With dead ends: 261
[2020-10-16 11:19:49,059 INFO  L226             Difference]: Without dead ends: 201
[2020-10-16 11:19:49,060 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:49,061 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2020-10-16 11:19:49,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 185.
[2020-10-16 11:19:49,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 185 states.
[2020-10-16 11:19:49,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 393 transitions.
[2020-10-16 11:19:49,067 INFO  L78                 Accepts]: Start accepts. Automaton has 185 states and 393 transitions. Word has length 15
[2020-10-16 11:19:49,067 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:49,067 INFO  L481      AbstractCegarLoop]: Abstraction has 185 states and 393 transitions.
[2020-10-16 11:19:49,067 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:19:49,067 INFO  L276                IsEmpty]: Start isEmpty. Operand 185 states and 393 transitions.
[2020-10-16 11:19:49,068 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:19:49,068 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:49,068 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:49,068 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 11:19:49,068 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:49,069 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:49,069 INFO  L82        PathProgramCache]: Analyzing trace with hash 1129550295, now seen corresponding path program 1 times
[2020-10-16 11:19:49,070 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:49,070 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515724740]
[2020-10-16 11:19:49,070 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:49,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:49,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:49,186 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515724740]
[2020-10-16 11:19:49,186 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:49,186 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:19:49,186 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2385405]
[2020-10-16 11:19:49,187 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:19:49,187 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:49,187 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:19:49,188 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:19:49,188 INFO  L87              Difference]: Start difference. First operand 185 states and 393 transitions. Second operand 6 states.
[2020-10-16 11:19:49,273 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:49,273 INFO  L93              Difference]: Finished difference Result 167 states and 356 transitions.
[2020-10-16 11:19:49,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:19:49,274 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-16 11:19:49,274 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:49,275 INFO  L225             Difference]: With dead ends: 167
[2020-10-16 11:19:49,275 INFO  L226             Difference]: Without dead ends: 117
[2020-10-16 11:19:49,275 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:19:49,276 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2020-10-16 11:19:49,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113.
[2020-10-16 11:19:49,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2020-10-16 11:19:49,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 240 transitions.
[2020-10-16 11:19:49,279 INFO  L78                 Accepts]: Start accepts. Automaton has 113 states and 240 transitions. Word has length 17
[2020-10-16 11:19:49,280 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:49,280 INFO  L481      AbstractCegarLoop]: Abstraction has 113 states and 240 transitions.
[2020-10-16 11:19:49,280 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:19:49,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 113 states and 240 transitions.
[2020-10-16 11:19:49,281 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:49,281 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:49,281 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:49,281 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 11:19:49,281 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:49,282 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:49,282 INFO  L82        PathProgramCache]: Analyzing trace with hash 444947368, now seen corresponding path program 1 times
[2020-10-16 11:19:49,282 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:49,282 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718783686]
[2020-10-16 11:19:49,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:49,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:49,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:49,881 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718783686]
[2020-10-16 11:19:49,882 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:49,882 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 11:19:49,882 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129764858]
[2020-10-16 11:19:49,883 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 11:19:49,883 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:49,883 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 11:19:49,883 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:19:49,884 INFO  L87              Difference]: Start difference. First operand 113 states and 240 transitions. Second operand 8 states.
[2020-10-16 11:19:50,194 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:50,194 INFO  L93              Difference]: Finished difference Result 183 states and 365 transitions.
[2020-10-16 11:19:50,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 11:19:50,195 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 20
[2020-10-16 11:19:50,195 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:50,196 INFO  L225             Difference]: With dead ends: 183
[2020-10-16 11:19:50,196 INFO  L226             Difference]: Without dead ends: 108
[2020-10-16 11:19:50,196 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2020-10-16 11:19:50,197 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2020-10-16 11:19:50,201 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93.
[2020-10-16 11:19:50,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2020-10-16 11:19:50,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 184 transitions.
[2020-10-16 11:19:50,201 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 184 transitions. Word has length 20
[2020-10-16 11:19:50,201 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:50,202 INFO  L481      AbstractCegarLoop]: Abstraction has 93 states and 184 transitions.
[2020-10-16 11:19:50,202 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 11:19:50,202 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 184 transitions.
[2020-10-16 11:19:50,202 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:50,202 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:50,203 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:50,203 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 11:19:50,203 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:50,203 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:50,203 INFO  L82        PathProgramCache]: Analyzing trace with hash -418142052, now seen corresponding path program 2 times
[2020-10-16 11:19:50,203 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:50,204 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467108885]
[2020-10-16 11:19:50,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:50,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:19:50,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:19:50,706 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467108885]
[2020-10-16 11:19:50,709 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:19:50,710 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 11:19:50,710 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085957740]
[2020-10-16 11:19:50,710 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 11:19:50,710 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:19:50,710 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 11:19:50,711 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:19:50,711 INFO  L87              Difference]: Start difference. First operand 93 states and 184 transitions. Second operand 9 states.
[2020-10-16 11:19:51,039 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:19:51,039 INFO  L93              Difference]: Finished difference Result 136 states and 258 transitions.
[2020-10-16 11:19:51,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 11:19:51,042 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 20
[2020-10-16 11:19:51,042 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:19:51,042 INFO  L225             Difference]: With dead ends: 136
[2020-10-16 11:19:51,043 INFO  L226             Difference]: Without dead ends: 106
[2020-10-16 11:19:51,043 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2020-10-16 11:19:51,044 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2020-10-16 11:19:51,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 77.
[2020-10-16 11:19:51,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2020-10-16 11:19:51,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 144 transitions.
[2020-10-16 11:19:51,047 INFO  L78                 Accepts]: Start accepts. Automaton has 77 states and 144 transitions. Word has length 20
[2020-10-16 11:19:51,047 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:19:51,047 INFO  L481      AbstractCegarLoop]: Abstraction has 77 states and 144 transitions.
[2020-10-16 11:19:51,047 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 11:19:51,047 INFO  L276                IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions.
[2020-10-16 11:19:51,048 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:19:51,048 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:19:51,048 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:19:51,048 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 11:19:51,048 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:19:51,048 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:19:51,049 INFO  L82        PathProgramCache]: Analyzing trace with hash 1467741448, now seen corresponding path program 3 times
[2020-10-16 11:19:51,049 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:19:51,049 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941612513]
[2020-10-16 11:19:51,049 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:19:51,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:19:51,092 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:19:51,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:19:51,152 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:19:51,190 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:19:51,190 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:19:51,191 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 11:19:51,192 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:19:51,205 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In-193774252 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In-193774252 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-193774252 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-193774252 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-193774252 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-193774252|) (or (and (= ~y$w_buff1_used~0_Out-193774252 ~y$w_buff1_used~0_In-193774252) .cse0) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-193774252 0))) (= ~y$r_buff1_thd0~0_Out-193774252 ~y$r_buff1_thd0~0_In-193774252) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-193774252 0)) (or (and (or (and .cse0 (= ~y~0_Out-193774252 ~y~0_In-193774252)) (and .cse1 (= ~y~0_Out-193774252 ~y$w_buff1~0_In-193774252) .cse2)) .cse3) (and .cse4 .cse5 (= ~y~0_Out-193774252 ~y$w_buff0~0_In-193774252))) (= ~y$r_buff0_thd0~0_In-193774252 ~y$r_buff0_thd0~0_Out-193774252) (or (and .cse3 (= ~y$w_buff0_used~0_Out-193774252 ~y$w_buff0_used~0_In-193774252)) (and (= ~y$w_buff0_used~0_Out-193774252 0) .cse4 .cse5)))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-193774252|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-193774252, ~y$w_buff1~0=~y$w_buff1~0_In-193774252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-193774252, ~y$w_buff0~0=~y$w_buff0~0_In-193774252, ~y~0=~y~0_In-193774252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-193774252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-193774252}  OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-193774252|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-193774252, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-193774252|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-193774252|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-193774252|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-193774252|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-193774252|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-193774252|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-193774252, ~y$w_buff1~0=~y$w_buff1~0_In-193774252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-193774252, ~y$w_buff0~0=~y$w_buff0~0_In-193774252, ~y~0=~y~0_Out-193774252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-193774252, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-193774252}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 11:19:51,211 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,211 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,212 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,213 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,213 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,213 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,213 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,213 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,213 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,214 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,214 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,214 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,215 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,216 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,216 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,216 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,216 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,216 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,217 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,217 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,217 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,217 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,218 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,218 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,218 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,219 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,219 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,219 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,219 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,219 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,220 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,220 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,220 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,220 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,221 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,221 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,222 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,222 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,222 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,222 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,222 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,222 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,223 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,223 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,223 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,223 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,223 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,223 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,224 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,224 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,224 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,224 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,224 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,224 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,224 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,225 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,225 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,225 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,225 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,225 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,226 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,226 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,226 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:19:51,226 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:19:51,279 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:19:51 BasicIcfg
[2020-10-16 11:19:51,279 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:19:51,281 INFO  L168              Benchmark]: Toolchain (without parser) took 18751.82 ms. Allocated memory was 147.8 MB in the beginning and 403.7 MB in the end (delta: 255.9 MB). Free memory was 102.4 MB in the beginning and 95.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 263.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:51,282 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
[2020-10-16 11:19:51,283 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 805.76 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 158.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:51,283 INFO  L168              Benchmark]: Boogie Procedure Inliner took 104.96 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:51,284 INFO  L168              Benchmark]: Boogie Preprocessor took 60.04 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:51,285 INFO  L168              Benchmark]: RCFGBuilder took 2151.13 ms. Allocated memory was 204.5 MB in the beginning and 245.4 MB in the end (delta: 40.9 MB). Free memory was 152.5 MB in the beginning and 161.5 MB in the end (delta: -9.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:51,285 INFO  L168              Benchmark]: TraceAbstraction took 15624.07 ms. Allocated memory was 245.4 MB in the beginning and 403.7 MB in the end (delta: 158.3 MB). Free memory was 161.5 MB in the beginning and 95.3 MB in the end (delta: 66.2 MB). Peak memory consumption was 224.5 MB. Max. memory is 7.1 GB.
[2020-10-16 11:19:51,289 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 805.76 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 158.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 104.96 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 60.04 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2151.13 ms. Allocated memory was 204.5 MB in the beginning and 245.4 MB in the end (delta: 40.9 MB). Free memory was 152.5 MB in the beginning and 161.5 MB in the end (delta: -9.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 15624.07 ms. Allocated memory was 245.4 MB in the beginning and 403.7 MB in the end (delta: 158.3 MB). Free memory was 161.5 MB in the beginning and 95.3 MB in the end (delta: 66.2 MB). Peak memory consumption was 224.5 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    896 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 73 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.6s, 98 PlacesBefore, 35 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 4070 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;
[L701]               0  _Bool main$tmp_guard0;
[L702]               0  _Bool main$tmp_guard1;
[L704]               0  int x = 0;
[L706]               0  int y = 0;
[L707]               0  _Bool y$flush_delayed;
[L708]               0  int y$mem_tmp;
[L709]               0  _Bool y$r_buff0_thd0;
[L710]               0  _Bool y$r_buff0_thd1;
[L711]               0  _Bool y$r_buff0_thd2;
[L712]               0  _Bool y$r_buff0_thd3;
[L713]               0  _Bool y$r_buff1_thd0;
[L714]               0  _Bool y$r_buff1_thd1;
[L715]               0  _Bool y$r_buff1_thd2;
[L716]               0  _Bool y$r_buff1_thd3;
[L717]               0  _Bool y$read_delayed;
[L718]               0  int *y$read_delayed_var;
[L719]               0  int y$w_buff0;
[L720]               0  _Bool y$w_buff0_used;
[L721]               0  int y$w_buff1;
[L722]               0  _Bool y$w_buff1_used;
[L723]               0  _Bool weak$$choice0;
[L724]               0  _Bool weak$$choice2;
[L802]               0  pthread_t t2180;
[L803]  FCALL, FORK  0  pthread_create(&t2180, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L804]               0  pthread_t t2181;
[L728]               1  y$w_buff1 = y$w_buff0
[L729]               1  y$w_buff0 = 2
[L730]               1  y$w_buff1_used = y$w_buff0_used
[L731]               1  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    1  !expression
[L7]                 1  __VERIFIER_error()
[L733]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L734]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L735]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L736]               1  y$r_buff1_thd3 = y$r_buff0_thd3
[L737]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L740]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L805]  FCALL, FORK  0  pthread_create(&t2181, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L757]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L760]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L760]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L761]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L762]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L763]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L763]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L767]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L769]               2  return 0;
[L806]               0  pthread_t t2182;
[L807]  FCALL, FORK  0  pthread_create(&t2182, ((void *)0), P2, ((void *)0))
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L774]               3  __unbuffered_p2_EAX = x
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L777]               3  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L780]  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)
[L780]               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)
[L781]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L781]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L782]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L782]               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
[L783]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L783]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L784]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L784]               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
[L787]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L789]               3  return 0;
[L743]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L743]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L743]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L743]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L744]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L744]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L745]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L745]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L746]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L746]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L747]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L750]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L752]               1  return 0;
[L809]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L820]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L821]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L822]               0  y$flush_delayed = weak$$choice2
[L823]               0  y$mem_tmp = y
[L824]  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)
[L824]               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)
[L825]  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))
[L825]  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)
[L825]  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))
[L825]               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))
[L826]  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))
[L826]  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)
[L826]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1
[L826]  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)
[L826]  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))
[L826]               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))
[L827]  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))
[L827]               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))
[L828]  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))
[L828]               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))
[L829]  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))
[L829]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L829]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L829]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L829]  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))
[L829]               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))
[L830]  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))
[L830]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L830]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L830]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L830]  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))
[L830]               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))
[L831]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2)
[L832]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L832]               0  y = y$flush_delayed ? y$mem_tmp : y
[L833]               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=2, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 322 SDtfs, 398 SDslu, 665 SDs, 0 SdLazy, 456 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred 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, 16 MinimizatonAttempts, 143 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 33163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...