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


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-15 18:16:44,513 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-15 18:16:44,516 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-15 18:16:44,541 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-15 18:16:44,541 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-15 18:16:44,542 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-15 18:16:44,544 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-15 18:16:44,546 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-15 18:16:44,547 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-15 18:16:44,548 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-15 18:16:44,549 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-15 18:16:44,550 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-15 18:16:44,550 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-15 18:16:44,551 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-15 18:16:44,552 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-15 18:16:44,553 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-15 18:16:44,554 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-15 18:16:44,555 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-15 18:16:44,556 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-15 18:16:44,558 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-15 18:16:44,560 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-15 18:16:44,561 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-15 18:16:44,562 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-15 18:16:44,563 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-15 18:16:44,565 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-15 18:16:44,565 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-15 18:16:44,566 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-15 18:16:44,567 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-15 18:16:44,567 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-15 18:16:44,568 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-15 18:16:44,568 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-15 18:16:44,569 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-15 18:16:44,569 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-15 18:16:44,570 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-15 18:16:44,571 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-15 18:16:44,571 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-15 18:16:44,572 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-15 18:16:44,572 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-15 18:16:44,572 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-15 18:16:44,573 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-15 18:16:44,574 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-15 18:16:44,575 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-15 18:16:44,597 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-15 18:16:44,597 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-15 18:16:44,598 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-15 18:16:44,599 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-15 18:16:44,599 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-15 18:16:44,599 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-15 18:16:44,599 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-15 18:16:44,599 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-15 18:16:44,600 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-15 18:16:44,600 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-15 18:16:44,600 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-15 18:16:44,600 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-15 18:16:44,600 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-15 18:16:44,601 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-15 18:16:44,601 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-15 18:16:44,601 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-15 18:16:44,601 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-15 18:16:44,601 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-15 18:16:44,602 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-15 18:16:44,602 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-15 18:16:44,602 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-15 18:16:44,602 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-15 18:16:44,602 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-15 18:16:44,602 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-15 18:16:44,603 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-15 18:16:44,603 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-15 18:16:44,603 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-15 18:16:44,603 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-15 18:16:44,603 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-15 18:16:44,604 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-15 18:16:44,883 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-15 18:16:44,899 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-15 18:16:44,903 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-15 18:16:44,904 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-15 18:16:44,904 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-15 18:16:44,905 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i
[2020-10-15 18:16:44,967 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca08ed036/8038723d4ee24946950201f1ea7334c9/FLAG39fb1ab68
[2020-10-15 18:16:45,522 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-15 18:16:45,523 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i
[2020-10-15 18:16:45,538 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca08ed036/8038723d4ee24946950201f1ea7334c9/FLAG39fb1ab68
[2020-10-15 18:16:45,848 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca08ed036/8038723d4ee24946950201f1ea7334c9
[2020-10-15 18:16:45,856 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-15 18:16:45,859 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-15 18:16:45,860 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-15 18:16:45,860 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-15 18:16:45,864 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-15 18:16:45,865 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:16:45" (1/1) ...
[2020-10-15 18:16:45,870 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c33e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:45, skipping insertion in model container
[2020-10-15 18:16:45,871 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:16:45" (1/1) ...
[2020-10-15 18:16:45,881 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-15 18:16:45,947 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-15 18:16:46,484 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-15 18:16:46,496 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-15 18:16:46,555 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-15 18:16:46,645 INFO  L208         MainTranslator]: Completed translation
[2020-10-15 18:16:46,646 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46 WrapperNode
[2020-10-15 18:16:46,647 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-15 18:16:46,648 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-15 18:16:46,648 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-15 18:16:46,649 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-15 18:16:46,657 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,678 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,713 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-15 18:16:46,714 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-15 18:16:46,714 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-15 18:16:46,714 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-15 18:16:46,722 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,723 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,728 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,729 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,740 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,744 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,748 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
[2020-10-15 18:16:46,753 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-15 18:16:46,754 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-15 18:16:46,754 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-15 18:16:46,754 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-15 18:16:46,755 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-15 18:16:46,846 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-15 18:16:46,847 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-15 18:16:46,847 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-15 18:16:46,847 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-15 18:16:46,848 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-15 18:16:46,848 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-15 18:16:46,848 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-15 18:16:46,849 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-15 18:16:46,850 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-15 18:16:46,850 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-15 18:16:46,851 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-15 18:16:46,851 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-15 18:16:46,851 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-15 18:16:46,851 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-15 18:16:46,851 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-15 18:16:46,854 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-15 18:16:49,034 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-15 18:16:49,034 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-15 18:16:49,036 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:16:49 BoogieIcfgContainer
[2020-10-15 18:16:49,037 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-15 18:16:49,038 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-15 18:16:49,038 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-15 18:16:49,042 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-15 18:16:49,042 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:16:45" (1/3) ...
[2020-10-15 18:16:49,043 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540ade39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:16:49, skipping insertion in model container
[2020-10-15 18:16:49,043 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:46" (2/3) ...
[2020-10-15 18:16:49,043 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540ade39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:16:49, skipping insertion in model container
[2020-10-15 18:16:49,044 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:16:49" (3/3) ...
[2020-10-15 18:16:49,045 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix029_rmo.opt.i
[2020-10-15 18:16:49,057 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-15 18:16:49,058 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-15 18:16:49,066 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-15 18:16:49,067 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-15 18:16:49,101 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,101 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,101 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,102 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,102 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,102 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,103 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,103 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,103 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,104 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,104 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,104 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,104 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,105 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,105 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,105 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,105 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,106 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,106 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,107 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,107 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,107 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,108 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,108 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,108 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,109 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,109 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,109 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,109 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,109 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,110 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,110 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,110 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,110 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,111 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,111 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,112 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,112 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,112 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,112 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,113 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,113 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,113 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,113 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,114 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,114 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,114 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,114 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,115 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,119 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,119 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,120 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,120 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,120 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,120 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,121 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,121 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,121 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,121 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,124 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,124 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,124 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,124 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,130 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,131 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,131 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,131 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,132 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,132 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,132 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,132 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,132 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,133 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,135 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,135 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,135 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,135 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,136 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,136 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,136 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,136 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,137 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,137 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,137 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,137 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:16:49,153 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-15 18:16:49,176 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-15 18:16:49,176 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-15 18:16:49,176 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-15 18:16:49,176 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-15 18:16:49,176 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-15 18:16:49,177 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-15 18:16:49,177 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-15 18:16:49,177 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-15 18:16:49,192 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-15 18:16:49,195 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-15 18:16:49,199 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-15 18:16:49,201 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-15 18:16:49,259 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-15 18:16:49,260 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-15 18:16:49,265 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-15 18:16:49,271 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2572
[2020-10-15 18:16:49,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,502 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,504 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:49,505 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,531 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,531 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,533 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:49,534 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,601 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,601 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:49,626 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,627 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,628 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,633 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:49,636 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,636 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:49,639 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,640 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:49,643 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:49,643 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,645 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,646 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,650 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,707 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,707 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,708 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:49,709 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,712 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:49,713 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:16:49,716 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:49,717 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,831 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,832 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,833 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:49,833 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,836 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:49,837 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:16:49,840 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:49,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,874 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:16:49,874 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:49,890 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,891 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,892 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,892 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,895 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,896 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:49,897 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,898 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:49,899 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:49,900 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:49,903 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:49,903 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,906 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,907 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,908 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,909 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:49,986 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,987 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:49,988 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:49,990 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:49,991 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:16:49,994 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:49,994 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,038 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:50,038 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:50,040 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:50,041 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:50,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,045 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:50,045 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:50,048 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:50,048 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:50,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:50,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:50,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:50,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,055 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,055 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,056 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,057 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,172 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,174 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,174 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,195 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,198 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,287 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,318 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,319 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,343 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,344 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,345 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,345 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,368 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,368 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,369 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,393 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,395 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,395 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,415 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,416 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,447 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,447 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,448 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,448 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,466 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,466 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,467 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,467 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,826 WARN  L193               SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-15 18:16:50,944 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,944 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:50,945 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-15 18:16:50,946 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:50,974 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:50,975 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:50,976 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:50,976 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:51,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:51,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,065 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:51,065 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,066 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:51,066 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,098 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:16:51,098 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:51,112 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:51,112 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:51,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,116 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:51,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:51,119 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:51,119 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:51,121 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:51,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:51,124 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:51,124 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,127 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:51,127 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,128 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:51,129 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,173 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:51,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,174 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:51,175 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:51,177 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:51,177 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:16:51,180 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:51,180 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:52,574 WARN  L193               SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-15 18:16:52,585 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-15 18:16:52,585 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:52,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:52,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,493 WARN  L193               SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-15 18:16:53,509 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:53,509 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,510 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:53,510 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,522 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:53,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:53,523 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-15 18:16:53,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:53,575 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:53,575 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:53,577 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:53,578 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,579 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:53,579 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,581 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:53,582 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:53,583 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:53,583 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:53,585 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:53,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:53,587 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:53,588 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,590 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:53,590 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,591 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:53,592 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,649 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 18:16:53,649 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 18:16:53,651 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,654 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:53,654 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:16:53,657 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 18:16:53,657 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:53,891 WARN  L193               SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45
[2020-10-15 18:16:54,057 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,058 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,059 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-15 18:16:54,059 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,060 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,060 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,061 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,061 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,063 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,063 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,064 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,064 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,066 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,067 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,068 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,068 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,070 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,113 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,113 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:54,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,116 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,206 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,207 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:54,208 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,209 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,224 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,225 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,226 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-15 18:16:54,226 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,227 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,227 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,228 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,228 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,229 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,230 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,231 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,231 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,233 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,233 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,234 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,234 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,236 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,236 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,449 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,449 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:54,451 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,452 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,466 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,467 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-15 18:16:54,468 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,469 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,469 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,470 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,470 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,471 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,472 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,473 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,474 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,475 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,475 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,476 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,477 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,478 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,561 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,562 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-15 18:16:54,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,563 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,563 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,564 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,564 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,566 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,566 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,567 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,568 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,569 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,569 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,571 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,571 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,572 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,572 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,591 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,592 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:54,594 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,594 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,745 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,745 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,746 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-15 18:16:54,747 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,748 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,748 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,749 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,749 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:54,750 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,751 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,752 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,752 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,753 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,754 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,755 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,755 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,757 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:54,757 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:54,774 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,775 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:54,777 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:54,777 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:55,238 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:55,238 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:16:55,240 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:55,240 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:55,259 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:55,260 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:55,260 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-15 18:16:55,261 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:55,261 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:55,262 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:55,262 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:55,263 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:55,264 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:55,265 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:55,266 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:55,267 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:55,268 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 18:16:55,268 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:55,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:55,270 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:55,271 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:55,271 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:56,547 WARN  L193               SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110
[2020-10-15 18:16:56,845 WARN  L193               SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 107
[2020-10-15 18:16:57,204 WARN  L193               SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-15 18:16:57,309 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-15 18:16:58,007 WARN  L193               SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 137
[2020-10-15 18:16:58,343 WARN  L193               SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-15 18:16:58,354 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 18:16:58,354 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,397 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 18:16:58,398 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,471 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,472 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,472 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,473 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,474 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,475 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:58,476 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:16:58,476 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:58,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,491 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,493 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:16:58,496 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:16:58,496 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:16:58,521 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 18:16:58,522 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,552 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:16:58,553 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,553 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,554 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,555 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,556 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:16:58,557 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:16:58,557 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:16:58,568 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:16:58,569 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,569 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,570 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:58,571 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:16:58,571 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:58,573 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:16:58,573 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:16:58,589 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 18:16:58,589 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:16:59,042 WARN  L193               SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-15 18:16:59,221 WARN  L193               SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-15 18:16:59,348 INFO  L132        LiptonReduction]: Checked pairs total: 7948
[2020-10-15 18:16:59,348 INFO  L134        LiptonReduction]: Total number of compositions: 91
[2020-10-15 18:16:59,374 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow
[2020-10-15 18:16:59,667 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states.
[2020-10-15 18:16:59,669 INFO  L276                IsEmpty]: Start isEmpty. Operand 3890 states.
[2020-10-15 18:16:59,679 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-15 18:16:59,679 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:16:59,680 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:16:59,680 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:16:59,686 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:16:59,686 INFO  L82        PathProgramCache]: Analyzing trace with hash 51217073, now seen corresponding path program 1 times
[2020-10-15 18:16:59,697 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:16:59,698 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456021858]
[2020-10-15 18:16:59,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:16:59,899 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:16:59,994 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-15 18:16:59,994 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456021858]
[2020-10-15 18:16:59,995 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:16:59,996 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-15 18:16:59,996 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820561471]
[2020-10-15 18:17:00,002 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 18:17:00,002 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:00,018 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 18:17:00,019 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:17:00,021 INFO  L87              Difference]: Start difference. First operand 3890 states. Second operand 3 states.
[2020-10-15 18:17:00,171 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:00,171 INFO  L93              Difference]: Finished difference Result 3250 states and 12738 transitions.
[2020-10-15 18:17:00,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:17:00,174 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-15 18:17:00,174 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:00,219 INFO  L225             Difference]: With dead ends: 3250
[2020-10-15 18:17:00,219 INFO  L226             Difference]: Without dead ends: 2650
[2020-10-15 18:17:00,221 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-15 18:17:00,268 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2650 states.
[2020-10-15 18:17:00,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650.
[2020-10-15 18:17:00,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2650 states.
[2020-10-15 18:17:00,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions.
[2020-10-15 18:17:00,418 INFO  L78                 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7
[2020-10-15 18:17:00,419 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:00,419 INFO  L481      AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions.
[2020-10-15 18:17:00,420 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 18:17:00,420 INFO  L276                IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions.
[2020-10-15 18:17:00,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-15 18:17:00,423 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:00,423 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:00,423 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-15 18:17:00,423 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:00,424 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:00,424 INFO  L82        PathProgramCache]: Analyzing trace with hash -386244636, now seen corresponding path program 1 times
[2020-10-15 18:17:00,424 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:00,424 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728622424]
[2020-10-15 18:17:00,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:00,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:00,585 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-15 18:17:00,586 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728622424]
[2020-10-15 18:17:00,586 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:00,586 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-15 18:17:00,587 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723003662]
[2020-10-15 18:17:00,588 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 18:17:00,589 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:00,589 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 18:17:00,589 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:17:00,589 INFO  L87              Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states.
[2020-10-15 18:17:00,651 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:00,651 INFO  L93              Difference]: Finished difference Result 2630 states and 10137 transitions.
[2020-10-15 18:17:00,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:17:00,653 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-15 18:17:00,653 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:00,675 INFO  L225             Difference]: With dead ends: 2630
[2020-10-15 18:17:00,676 INFO  L226             Difference]: Without dead ends: 2630
[2020-10-15 18:17:00,677 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-15 18:17:00,695 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2630 states.
[2020-10-15 18:17:00,771 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630.
[2020-10-15 18:17:00,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2630 states.
[2020-10-15 18:17:00,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 10137 transitions.
[2020-10-15 18:17:00,787 INFO  L78                 Accepts]: Start accepts. Automaton has 2630 states and 10137 transitions. Word has length 11
[2020-10-15 18:17:00,787 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:00,787 INFO  L481      AbstractCegarLoop]: Abstraction has 2630 states and 10137 transitions.
[2020-10-15 18:17:00,787 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 18:17:00,788 INFO  L276                IsEmpty]: Start isEmpty. Operand 2630 states and 10137 transitions.
[2020-10-15 18:17:00,791 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-15 18:17:00,791 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:00,791 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:00,791 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-15 18:17:00,791 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:00,792 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:00,792 INFO  L82        PathProgramCache]: Analyzing trace with hash 951098663, now seen corresponding path program 1 times
[2020-10-15 18:17:00,792 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:00,792 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693864474]
[2020-10-15 18:17:00,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:00,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:01,044 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-15 18:17:01,046 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693864474]
[2020-10-15 18:17:01,046 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:01,047 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 18:17:01,047 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327330904]
[2020-10-15 18:17:01,047 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:17:01,048 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:01,048 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:17:01,048 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:17:01,048 INFO  L87              Difference]: Start difference. First operand 2630 states and 10137 transitions. Second operand 5 states.
[2020-10-15 18:17:01,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:01,145 INFO  L93              Difference]: Finished difference Result 2622 states and 10099 transitions.
[2020-10-15 18:17:01,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:17:01,145 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-15 18:17:01,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:01,168 INFO  L225             Difference]: With dead ends: 2622
[2020-10-15 18:17:01,168 INFO  L226             Difference]: Without dead ends: 2622
[2020-10-15 18:17:01,169 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:17:01,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2622 states.
[2020-10-15 18:17:01,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2622.
[2020-10-15 18:17:01,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2622 states.
[2020-10-15 18:17:01,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 10099 transitions.
[2020-10-15 18:17:01,265 INFO  L78                 Accepts]: Start accepts. Automaton has 2622 states and 10099 transitions. Word has length 12
[2020-10-15 18:17:01,266 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:01,266 INFO  L481      AbstractCegarLoop]: Abstraction has 2622 states and 10099 transitions.
[2020-10-15 18:17:01,266 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:17:01,266 INFO  L276                IsEmpty]: Start isEmpty. Operand 2622 states and 10099 transitions.
[2020-10-15 18:17:01,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-15 18:17:01,268 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:01,269 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:01,269 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-15 18:17:01,269 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:01,269 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:01,269 INFO  L82        PathProgramCache]: Analyzing trace with hash 910702067, now seen corresponding path program 1 times
[2020-10-15 18:17:01,270 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:01,270 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31712601]
[2020-10-15 18:17:01,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:01,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:01,325 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-15 18:17:01,325 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31712601]
[2020-10-15 18:17:01,326 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:01,326 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-15 18:17:01,326 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11990109]
[2020-10-15 18:17:01,327 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 18:17:01,327 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:01,327 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 18:17:01,327 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:17:01,327 INFO  L87              Difference]: Start difference. First operand 2622 states and 10099 transitions. Second operand 3 states.
[2020-10-15 18:17:01,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:01,379 INFO  L93              Difference]: Finished difference Result 2602 states and 10008 transitions.
[2020-10-15 18:17:01,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:17:01,380 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-15 18:17:01,380 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:01,404 INFO  L225             Difference]: With dead ends: 2602
[2020-10-15 18:17:01,405 INFO  L226             Difference]: Without dead ends: 2602
[2020-10-15 18:17:01,405 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-15 18:17:01,423 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2602 states.
[2020-10-15 18:17:01,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602.
[2020-10-15 18:17:01,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2602 states.
[2020-10-15 18:17:01,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10008 transitions.
[2020-10-15 18:17:01,509 INFO  L78                 Accepts]: Start accepts. Automaton has 2602 states and 10008 transitions. Word has length 12
[2020-10-15 18:17:01,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:01,510 INFO  L481      AbstractCegarLoop]: Abstraction has 2602 states and 10008 transitions.
[2020-10-15 18:17:01,510 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 18:17:01,510 INFO  L276                IsEmpty]: Start isEmpty. Operand 2602 states and 10008 transitions.
[2020-10-15 18:17:01,512 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-15 18:17:01,512 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:01,513 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:01,513 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-15 18:17:01,513 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:01,513 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:01,514 INFO  L82        PathProgramCache]: Analyzing trace with hash -581328624, now seen corresponding path program 1 times
[2020-10-15 18:17:01,514 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:01,514 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497628199]
[2020-10-15 18:17:01,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:01,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:01,694 WARN  L193               SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12
[2020-10-15 18:17:01,738 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-15 18:17:01,739 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497628199]
[2020-10-15 18:17:01,739 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:01,739 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 18:17:01,739 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653595130]
[2020-10-15 18:17:01,740 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:17:01,740 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:01,740 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:17:01,740 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:17:01,740 INFO  L87              Difference]: Start difference. First operand 2602 states and 10008 transitions. Second operand 5 states.
[2020-10-15 18:17:01,805 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:01,805 INFO  L93              Difference]: Finished difference Result 2578 states and 9894 transitions.
[2020-10-15 18:17:01,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:17:01,807 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-15 18:17:01,807 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:01,829 INFO  L225             Difference]: With dead ends: 2578
[2020-10-15 18:17:01,829 INFO  L226             Difference]: Without dead ends: 2578
[2020-10-15 18:17:01,830 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:17:01,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2578 states.
[2020-10-15 18:17:01,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2578.
[2020-10-15 18:17:01,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2578 states.
[2020-10-15 18:17:01,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 9894 transitions.
[2020-10-15 18:17:01,913 INFO  L78                 Accepts]: Start accepts. Automaton has 2578 states and 9894 transitions. Word has length 13
[2020-10-15 18:17:01,913 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:01,913 INFO  L481      AbstractCegarLoop]: Abstraction has 2578 states and 9894 transitions.
[2020-10-15 18:17:01,913 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:17:01,913 INFO  L276                IsEmpty]: Start isEmpty. Operand 2578 states and 9894 transitions.
[2020-10-15 18:17:01,915 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-15 18:17:01,915 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:01,916 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:01,916 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-15 18:17:01,916 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:01,916 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:01,916 INFO  L82        PathProgramCache]: Analyzing trace with hash -1834993486, now seen corresponding path program 1 times
[2020-10-15 18:17:01,917 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:01,917 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073476686]
[2020-10-15 18:17:01,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:01,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:02,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:17:02,029 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073476686]
[2020-10-15 18:17:02,030 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:02,030 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-15 18:17:02,030 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794536953]
[2020-10-15 18:17:02,030 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 18:17:02,030 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:02,031 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 18:17:02,031 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-15 18:17:02,031 INFO  L87              Difference]: Start difference. First operand 2578 states and 9894 transitions. Second operand 4 states.
[2020-10-15 18:17:02,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:02,092 INFO  L93              Difference]: Finished difference Result 2498 states and 9550 transitions.
[2020-10-15 18:17:02,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:17:02,093 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-15 18:17:02,094 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:02,105 INFO  L225             Difference]: With dead ends: 2498
[2020-10-15 18:17:02,105 INFO  L226             Difference]: Without dead ends: 2498
[2020-10-15 18:17:02,105 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-15 18:17:02,118 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2498 states.
[2020-10-15 18:17:02,170 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2498.
[2020-10-15 18:17:02,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2498 states.
[2020-10-15 18:17:02,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 9550 transitions.
[2020-10-15 18:17:02,180 INFO  L78                 Accepts]: Start accepts. Automaton has 2498 states and 9550 transitions. Word has length 13
[2020-10-15 18:17:02,181 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:02,181 INFO  L481      AbstractCegarLoop]: Abstraction has 2498 states and 9550 transitions.
[2020-10-15 18:17:02,181 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 18:17:02,181 INFO  L276                IsEmpty]: Start isEmpty. Operand 2498 states and 9550 transitions.
[2020-10-15 18:17:02,183 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-15 18:17:02,184 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:02,184 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:02,184 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-15 18:17:02,184 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:02,184 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:02,185 INFO  L82        PathProgramCache]: Analyzing trace with hash 1889202603, now seen corresponding path program 1 times
[2020-10-15 18:17:02,185 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:02,185 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777542892]
[2020-10-15 18:17:02,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:02,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:02,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-15 18:17:02,223 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777542892]
[2020-10-15 18:17:02,223 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:02,223 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-15 18:17:02,224 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290677606]
[2020-10-15 18:17:02,224 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 18:17:02,224 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:02,224 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 18:17:02,225 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:17:02,225 INFO  L87              Difference]: Start difference. First operand 2498 states and 9550 transitions. Second operand 3 states.
[2020-10-15 18:17:02,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:02,247 INFO  L93              Difference]: Finished difference Result 2486 states and 9497 transitions.
[2020-10-15 18:17:02,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:17:02,248 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-10-15 18:17:02,248 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:02,259 INFO  L225             Difference]: With dead ends: 2486
[2020-10-15 18:17:02,259 INFO  L226             Difference]: Without dead ends: 2486
[2020-10-15 18:17:02,260 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-15 18:17:02,272 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2486 states.
[2020-10-15 18:17:02,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486.
[2020-10-15 18:17:02,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2486 states.
[2020-10-15 18:17:02,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 9497 transitions.
[2020-10-15 18:17:02,333 INFO  L78                 Accepts]: Start accepts. Automaton has 2486 states and 9497 transitions. Word has length 14
[2020-10-15 18:17:02,334 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:02,334 INFO  L481      AbstractCegarLoop]: Abstraction has 2486 states and 9497 transitions.
[2020-10-15 18:17:02,334 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 18:17:02,334 INFO  L276                IsEmpty]: Start isEmpty. Operand 2486 states and 9497 transitions.
[2020-10-15 18:17:02,336 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-15 18:17:02,336 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:02,336 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:02,337 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-15 18:17:02,337 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:02,337 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:02,337 INFO  L82        PathProgramCache]: Analyzing trace with hash -843304651, now seen corresponding path program 1 times
[2020-10-15 18:17:02,337 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:02,338 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928752338]
[2020-10-15 18:17:02,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:02,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:02,488 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-15 18:17:02,491 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928752338]
[2020-10-15 18:17:02,491 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:02,491 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 18:17:02,492 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949557620]
[2020-10-15 18:17:02,492 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:17:02,493 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:02,493 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:17:02,493 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:17:02,493 INFO  L87              Difference]: Start difference. First operand 2486 states and 9497 transitions. Second operand 5 states.
[2020-10-15 18:17:02,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:02,588 INFO  L93              Difference]: Finished difference Result 2550 states and 9721 transitions.
[2020-10-15 18:17:02,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-15 18:17:02,589 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-15 18:17:02,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:02,599 INFO  L225             Difference]: With dead ends: 2550
[2020-10-15 18:17:02,599 INFO  L226             Difference]: Without dead ends: 2550
[2020-10-15 18:17:02,599 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:02,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2550 states.
[2020-10-15 18:17:02,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2550.
[2020-10-15 18:17:02,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2550 states.
[2020-10-15 18:17:02,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 9721 transitions.
[2020-10-15 18:17:02,680 INFO  L78                 Accepts]: Start accepts. Automaton has 2550 states and 9721 transitions. Word has length 14
[2020-10-15 18:17:02,680 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:02,680 INFO  L481      AbstractCegarLoop]: Abstraction has 2550 states and 9721 transitions.
[2020-10-15 18:17:02,681 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:17:02,681 INFO  L276                IsEmpty]: Start isEmpty. Operand 2550 states and 9721 transitions.
[2020-10-15 18:17:02,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-15 18:17:02,683 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:02,683 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:02,683 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-15 18:17:02,684 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:02,684 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:02,684 INFO  L82        PathProgramCache]: Analyzing trace with hash -822285690, now seen corresponding path program 1 times
[2020-10-15 18:17:02,684 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:02,685 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448894844]
[2020-10-15 18:17:02,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:02,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:02,719 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-15 18:17:02,720 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448894844]
[2020-10-15 18:17:02,720 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:02,720 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-15 18:17:02,720 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111951278]
[2020-10-15 18:17:02,721 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 18:17:02,721 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:02,721 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 18:17:02,721 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:17:02,721 INFO  L87              Difference]: Start difference. First operand 2550 states and 9721 transitions. Second operand 3 states.
[2020-10-15 18:17:02,753 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:02,753 INFO  L93              Difference]: Finished difference Result 3626 states and 13480 transitions.
[2020-10-15 18:17:02,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:17:02,754 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-10-15 18:17:02,755 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:02,765 INFO  L225             Difference]: With dead ends: 3626
[2020-10-15 18:17:02,765 INFO  L226             Difference]: Without dead ends: 2678
[2020-10-15 18:17:02,765 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:17:02,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2678 states.
[2020-10-15 18:17:02,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2450.
[2020-10-15 18:17:02,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2450 states.
[2020-10-15 18:17:02,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 8970 transitions.
[2020-10-15 18:17:02,841 INFO  L78                 Accepts]: Start accepts. Automaton has 2450 states and 8970 transitions. Word has length 14
[2020-10-15 18:17:02,842 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:02,842 INFO  L481      AbstractCegarLoop]: Abstraction has 2450 states and 8970 transitions.
[2020-10-15 18:17:02,842 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 18:17:02,842 INFO  L276                IsEmpty]: Start isEmpty. Operand 2450 states and 8970 transitions.
[2020-10-15 18:17:02,845 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-15 18:17:02,845 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:02,845 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:02,845 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-15 18:17:02,845 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:02,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:02,846 INFO  L82        PathProgramCache]: Analyzing trace with hash -1564877556, now seen corresponding path program 1 times
[2020-10-15 18:17:02,846 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:02,846 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608219923]
[2020-10-15 18:17:02,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:02,861 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:02,992 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-15 18:17:02,992 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608219923]
[2020-10-15 18:17:02,993 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:02,993 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:17:02,993 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017735047]
[2020-10-15 18:17:02,993 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:17:02,994 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:02,994 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:17:02,994 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:02,994 INFO  L87              Difference]: Start difference. First operand 2450 states and 8970 transitions. Second operand 6 states.
[2020-10-15 18:17:03,128 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:03,128 INFO  L93              Difference]: Finished difference Result 2538 states and 9288 transitions.
[2020-10-15 18:17:03,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:17:03,130 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-15 18:17:03,130 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:03,141 INFO  L225             Difference]: With dead ends: 2538
[2020-10-15 18:17:03,142 INFO  L226             Difference]: Without dead ends: 2538
[2020-10-15 18:17:03,142 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:03,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2538 states.
[2020-10-15 18:17:03,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2386.
[2020-10-15 18:17:03,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2386 states.
[2020-10-15 18:17:03,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 8702 transitions.
[2020-10-15 18:17:03,230 INFO  L78                 Accepts]: Start accepts. Automaton has 2386 states and 8702 transitions. Word has length 15
[2020-10-15 18:17:03,231 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:03,231 INFO  L481      AbstractCegarLoop]: Abstraction has 2386 states and 8702 transitions.
[2020-10-15 18:17:03,231 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:17:03,231 INFO  L276                IsEmpty]: Start isEmpty. Operand 2386 states and 8702 transitions.
[2020-10-15 18:17:03,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-15 18:17:03,235 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:03,235 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:03,235 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-15 18:17:03,235 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:03,236 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:03,236 INFO  L82        PathProgramCache]: Analyzing trace with hash -1268550471, now seen corresponding path program 1 times
[2020-10-15 18:17:03,236 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:03,236 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980102818]
[2020-10-15 18:17:03,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:03,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:03,461 WARN  L193               SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10
[2020-10-15 18:17:03,527 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-15 18:17:03,527 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980102818]
[2020-10-15 18:17:03,528 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:03,528 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:17:03,528 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393580383]
[2020-10-15 18:17:03,528 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:17:03,528 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:03,529 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:17:03,529 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:03,529 INFO  L87              Difference]: Start difference. First operand 2386 states and 8702 transitions. Second operand 6 states.
[2020-10-15 18:17:03,659 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:03,659 INFO  L93              Difference]: Finished difference Result 2562 states and 9374 transitions.
[2020-10-15 18:17:03,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:17:03,660 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-15 18:17:03,660 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:03,672 INFO  L225             Difference]: With dead ends: 2562
[2020-10-15 18:17:03,672 INFO  L226             Difference]: Without dead ends: 2562
[2020-10-15 18:17:03,672 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:03,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2562 states.
[2020-10-15 18:17:03,737 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2562.
[2020-10-15 18:17:03,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2562 states.
[2020-10-15 18:17:03,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 9374 transitions.
[2020-10-15 18:17:03,748 INFO  L78                 Accepts]: Start accepts. Automaton has 2562 states and 9374 transitions. Word has length 16
[2020-10-15 18:17:03,749 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:03,749 INFO  L481      AbstractCegarLoop]: Abstraction has 2562 states and 9374 transitions.
[2020-10-15 18:17:03,749 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:17:03,749 INFO  L276                IsEmpty]: Start isEmpty. Operand 2562 states and 9374 transitions.
[2020-10-15 18:17:03,753 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-15 18:17:03,753 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:03,754 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:03,754 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-15 18:17:03,754 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:03,754 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:03,754 INFO  L82        PathProgramCache]: Analyzing trace with hash -1475469297, now seen corresponding path program 2 times
[2020-10-15 18:17:03,755 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:03,755 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169330204]
[2020-10-15 18:17:03,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:03,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:03,903 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-15 18:17:03,904 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169330204]
[2020-10-15 18:17:03,905 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:03,905 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:17:03,905 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149290140]
[2020-10-15 18:17:03,905 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:17:03,905 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:03,906 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:17:03,906 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:03,906 INFO  L87              Difference]: Start difference. First operand 2562 states and 9374 transitions. Second operand 6 states.
[2020-10-15 18:17:04,019 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:04,019 INFO  L93              Difference]: Finished difference Result 2890 states and 10452 transitions.
[2020-10-15 18:17:04,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:17:04,020 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-15 18:17:04,020 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:04,030 INFO  L225             Difference]: With dead ends: 2890
[2020-10-15 18:17:04,030 INFO  L226             Difference]: Without dead ends: 2794
[2020-10-15 18:17:04,031 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:04,047 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2794 states.
[2020-10-15 18:17:04,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2698.
[2020-10-15 18:17:04,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2698 states.
[2020-10-15 18:17:04,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 9792 transitions.
[2020-10-15 18:17:04,117 INFO  L78                 Accepts]: Start accepts. Automaton has 2698 states and 9792 transitions. Word has length 16
[2020-10-15 18:17:04,117 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:04,117 INFO  L481      AbstractCegarLoop]: Abstraction has 2698 states and 9792 transitions.
[2020-10-15 18:17:04,117 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:17:04,117 INFO  L276                IsEmpty]: Start isEmpty. Operand 2698 states and 9792 transitions.
[2020-10-15 18:17:04,122 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-15 18:17:04,122 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:04,122 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:04,122 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-15 18:17:04,123 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:04,123 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:04,123 INFO  L82        PathProgramCache]: Analyzing trace with hash -1547901303, now seen corresponding path program 3 times
[2020-10-15 18:17:04,126 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:04,126 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449685290]
[2020-10-15 18:17:04,127 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:04,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:04,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:17:04,324 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449685290]
[2020-10-15 18:17:04,324 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:04,324 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:17:04,324 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242473879]
[2020-10-15 18:17:04,325 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:17:04,325 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:04,325 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:17:04,325 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:04,325 INFO  L87              Difference]: Start difference. First operand 2698 states and 9792 transitions. Second operand 6 states.
[2020-10-15 18:17:04,486 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:04,486 INFO  L93              Difference]: Finished difference Result 2986 states and 10760 transitions.
[2020-10-15 18:17:04,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 18:17:04,487 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-15 18:17:04,487 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:04,495 INFO  L225             Difference]: With dead ends: 2986
[2020-10-15 18:17:04,496 INFO  L226             Difference]: Without dead ends: 2986
[2020-10-15 18:17:04,496 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2020-10-15 18:17:04,508 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2986 states.
[2020-10-15 18:17:04,569 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2754.
[2020-10-15 18:17:04,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2754 states.
[2020-10-15 18:17:04,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 9954 transitions.
[2020-10-15 18:17:04,582 INFO  L78                 Accepts]: Start accepts. Automaton has 2754 states and 9954 transitions. Word has length 16
[2020-10-15 18:17:04,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:04,582 INFO  L481      AbstractCegarLoop]: Abstraction has 2754 states and 9954 transitions.
[2020-10-15 18:17:04,582 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:17:04,582 INFO  L276                IsEmpty]: Start isEmpty. Operand 2754 states and 9954 transitions.
[2020-10-15 18:17:04,589 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-15 18:17:04,589 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:04,589 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:04,589 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-15 18:17:04,589 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:04,589 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:04,590 INFO  L82        PathProgramCache]: Analyzing trace with hash 1272309844, now seen corresponding path program 1 times
[2020-10-15 18:17:04,590 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:04,590 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409188678]
[2020-10-15 18:17:04,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:04,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:04,876 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-15 18:17:04,877 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409188678]
[2020-10-15 18:17:04,877 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:04,877 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:17:04,877 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199341726]
[2020-10-15 18:17:04,878 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:17:04,878 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:04,878 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:17:04,878 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:04,878 INFO  L87              Difference]: Start difference. First operand 2754 states and 9954 transitions. Second operand 6 states.
[2020-10-15 18:17:04,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:04,981 INFO  L93              Difference]: Finished difference Result 2930 states and 10506 transitions.
[2020-10-15 18:17:04,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-15 18:17:04,982 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-15 18:17:04,982 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:04,991 INFO  L225             Difference]: With dead ends: 2930
[2020-10-15 18:17:04,992 INFO  L226             Difference]: Without dead ends: 2930
[2020-10-15 18:17:04,993 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:05,003 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2930 states.
[2020-10-15 18:17:05,062 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2802.
[2020-10-15 18:17:05,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2802 states.
[2020-10-15 18:17:05,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 10106 transitions.
[2020-10-15 18:17:05,073 INFO  L78                 Accepts]: Start accepts. Automaton has 2802 states and 10106 transitions. Word has length 16
[2020-10-15 18:17:05,073 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:05,073 INFO  L481      AbstractCegarLoop]: Abstraction has 2802 states and 10106 transitions.
[2020-10-15 18:17:05,073 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:17:05,073 INFO  L276                IsEmpty]: Start isEmpty. Operand 2802 states and 10106 transitions.
[2020-10-15 18:17:05,078 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-15 18:17:05,078 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:05,078 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:05,078 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-15 18:17:05,078 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:05,079 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:05,079 INFO  L82        PathProgramCache]: Analyzing trace with hash 58923448, now seen corresponding path program 1 times
[2020-10-15 18:17:05,079 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:05,079 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152933812]
[2020-10-15 18:17:05,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:05,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:05,175 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-15 18:17:05,175 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152933812]
[2020-10-15 18:17:05,175 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:05,175 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 18:17:05,176 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22997986]
[2020-10-15 18:17:05,176 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 18:17:05,176 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:05,177 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 18:17:05,177 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 18:17:05,177 INFO  L87              Difference]: Start difference. First operand 2802 states and 10106 transitions. Second operand 4 states.
[2020-10-15 18:17:05,220 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:05,221 INFO  L93              Difference]: Finished difference Result 2748 states and 9029 transitions.
[2020-10-15 18:17:05,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:17:05,221 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-15 18:17:05,222 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:05,225 INFO  L225             Difference]: With dead ends: 2748
[2020-10-15 18:17:05,225 INFO  L226             Difference]: Without dead ends: 2052
[2020-10-15 18:17:05,226 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-15 18:17:05,232 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2052 states.
[2020-10-15 18:17:05,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2052.
[2020-10-15 18:17:05,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2052 states.
[2020-10-15 18:17:05,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 6671 transitions.
[2020-10-15 18:17:05,273 INFO  L78                 Accepts]: Start accepts. Automaton has 2052 states and 6671 transitions. Word has length 16
[2020-10-15 18:17:05,273 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:05,273 INFO  L481      AbstractCegarLoop]: Abstraction has 2052 states and 6671 transitions.
[2020-10-15 18:17:05,273 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 18:17:05,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 2052 states and 6671 transitions.
[2020-10-15 18:17:05,276 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-15 18:17:05,276 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:05,277 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:05,277 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-15 18:17:05,277 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:05,277 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:05,277 INFO  L82        PathProgramCache]: Analyzing trace with hash 689820000, now seen corresponding path program 1 times
[2020-10-15 18:17:05,277 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:05,278 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291585026]
[2020-10-15 18:17:05,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:05,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:05,346 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-15 18:17:05,346 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291585026]
[2020-10-15 18:17:05,346 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:05,346 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:17:05,346 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561116241]
[2020-10-15 18:17:05,347 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:17:05,347 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:05,348 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:17:05,348 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:17:05,348 INFO  L87              Difference]: Start difference. First operand 2052 states and 6671 transitions. Second operand 5 states.
[2020-10-15 18:17:05,406 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:05,406 INFO  L93              Difference]: Finished difference Result 1733 states and 5235 transitions.
[2020-10-15 18:17:05,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 18:17:05,407 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-15 18:17:05,407 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:05,410 INFO  L225             Difference]: With dead ends: 1733
[2020-10-15 18:17:05,410 INFO  L226             Difference]: Without dead ends: 1313
[2020-10-15 18:17:05,411 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-15 18:17:05,415 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1313 states.
[2020-10-15 18:17:05,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313.
[2020-10-15 18:17:05,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1313 states.
[2020-10-15 18:17:05,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 3898 transitions.
[2020-10-15 18:17:05,438 INFO  L78                 Accepts]: Start accepts. Automaton has 1313 states and 3898 transitions. Word has length 17
[2020-10-15 18:17:05,438 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:05,438 INFO  L481      AbstractCegarLoop]: Abstraction has 1313 states and 3898 transitions.
[2020-10-15 18:17:05,438 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:17:05,439 INFO  L276                IsEmpty]: Start isEmpty. Operand 1313 states and 3898 transitions.
[2020-10-15 18:17:05,442 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-15 18:17:05,442 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:05,442 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-15 18:17:05,442 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-15 18:17:05,442 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:05,442 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:05,442 INFO  L82        PathProgramCache]: Analyzing trace with hash -1602746911, now seen corresponding path program 1 times
[2020-10-15 18:17:05,443 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:05,443 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332380625]
[2020-10-15 18:17:05,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:05,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:05,570 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-15 18:17:05,571 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332380625]
[2020-10-15 18:17:05,571 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:05,571 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-15 18:17:05,571 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489688593]
[2020-10-15 18:17:05,572 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:17:05,574 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:05,575 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:17:05,575 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:05,575 INFO  L87              Difference]: Start difference. First operand 1313 states and 3898 transitions. Second operand 6 states.
[2020-10-15 18:17:05,642 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:05,642 INFO  L93              Difference]: Finished difference Result 1166 states and 3437 transitions.
[2020-10-15 18:17:05,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-15 18:17:05,646 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2020-10-15 18:17:05,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:05,648 INFO  L225             Difference]: With dead ends: 1166
[2020-10-15 18:17:05,648 INFO  L226             Difference]: Without dead ends: 1042
[2020-10-15 18:17:05,649 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-15 18:17:05,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1042 states.
[2020-10-15 18:17:05,666 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 898.
[2020-10-15 18:17:05,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 898 states.
[2020-10-15 18:17:05,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 2673 transitions.
[2020-10-15 18:17:05,670 INFO  L78                 Accepts]: Start accepts. Automaton has 898 states and 2673 transitions. Word has length 20
[2020-10-15 18:17:05,670 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:05,670 INFO  L481      AbstractCegarLoop]: Abstraction has 898 states and 2673 transitions.
[2020-10-15 18:17:05,670 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:17:05,670 INFO  L276                IsEmpty]: Start isEmpty. Operand 898 states and 2673 transitions.
[2020-10-15 18:17:05,673 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-15 18:17:05,673 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:05,673 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:05,674 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-15 18:17:05,674 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:05,674 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:05,674 INFO  L82        PathProgramCache]: Analyzing trace with hash 1246512088, now seen corresponding path program 1 times
[2020-10-15 18:17:05,675 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:05,675 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604666866]
[2020-10-15 18:17:05,675 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:05,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:05,748 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-15 18:17:05,748 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604666866]
[2020-10-15 18:17:05,748 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:05,749 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:17:05,749 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004231388]
[2020-10-15 18:17:05,749 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:17:05,749 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:05,750 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:17:05,750 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:17:05,750 INFO  L87              Difference]: Start difference. First operand 898 states and 2673 transitions. Second operand 6 states.
[2020-10-15 18:17:05,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:05,987 INFO  L93              Difference]: Finished difference Result 1477 states and 4280 transitions.
[2020-10-15 18:17:05,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 18:17:05,988 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 23
[2020-10-15 18:17:05,988 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:05,990 INFO  L225             Difference]: With dead ends: 1477
[2020-10-15 18:17:05,990 INFO  L226             Difference]: Without dead ends: 1229
[2020-10-15 18:17:05,991 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-15 18:17:05,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1229 states.
[2020-10-15 18:17:06,009 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1174.
[2020-10-15 18:17:06,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1174 states.
[2020-10-15 18:17:06,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 3455 transitions.
[2020-10-15 18:17:06,013 INFO  L78                 Accepts]: Start accepts. Automaton has 1174 states and 3455 transitions. Word has length 23
[2020-10-15 18:17:06,013 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:06,014 INFO  L481      AbstractCegarLoop]: Abstraction has 1174 states and 3455 transitions.
[2020-10-15 18:17:06,014 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:17:06,014 INFO  L276                IsEmpty]: Start isEmpty. Operand 1174 states and 3455 transitions.
[2020-10-15 18:17:06,017 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-15 18:17:06,017 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:06,017 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:06,017 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-15 18:17:06,018 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:06,018 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:06,018 INFO  L82        PathProgramCache]: Analyzing trace with hash 736320564, now seen corresponding path program 2 times
[2020-10-15 18:17:06,018 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:06,018 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142514832]
[2020-10-15 18:17:06,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:06,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:06,060 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-15 18:17:06,060 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142514832]
[2020-10-15 18:17:06,061 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:06,061 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 18:17:06,061 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032760617]
[2020-10-15 18:17:06,061 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 18:17:06,061 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:06,062 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 18:17:06,062 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 18:17:06,062 INFO  L87              Difference]: Start difference. First operand 1174 states and 3455 transitions. Second operand 4 states.
[2020-10-15 18:17:06,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:06,084 INFO  L93              Difference]: Finished difference Result 1428 states and 4108 transitions.
[2020-10-15 18:17:06,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-15 18:17:06,085 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 23
[2020-10-15 18:17:06,086 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:06,088 INFO  L225             Difference]: With dead ends: 1428
[2020-10-15 18:17:06,088 INFO  L226             Difference]: Without dead ends: 1117
[2020-10-15 18:17:06,088 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:17:06,092 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1117 states.
[2020-10-15 18:17:06,105 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 838.
[2020-10-15 18:17:06,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 838 states.
[2020-10-15 18:17:06,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2398 transitions.
[2020-10-15 18:17:06,107 INFO  L78                 Accepts]: Start accepts. Automaton has 838 states and 2398 transitions. Word has length 23
[2020-10-15 18:17:06,109 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:06,109 INFO  L481      AbstractCegarLoop]: Abstraction has 838 states and 2398 transitions.
[2020-10-15 18:17:06,109 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 18:17:06,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 838 states and 2398 transitions.
[2020-10-15 18:17:06,111 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2020-10-15 18:17:06,112 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:06,112 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:06,112 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-15 18:17:06,112 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:06,112 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:06,112 INFO  L82        PathProgramCache]: Analyzing trace with hash 669029708, now seen corresponding path program 3 times
[2020-10-15 18:17:06,113 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:06,113 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55276109]
[2020-10-15 18:17:06,113 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:06,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:06,242 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-15 18:17:06,242 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55276109]
[2020-10-15 18:17:06,243 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:06,243 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-15 18:17:06,243 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016073596]
[2020-10-15 18:17:06,243 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-15 18:17:06,243 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:06,244 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-15 18:17:06,244 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-15 18:17:06,244 INFO  L87              Difference]: Start difference. First operand 838 states and 2398 transitions. Second operand 7 states.
[2020-10-15 18:17:06,315 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:06,316 INFO  L93              Difference]: Finished difference Result 810 states and 2342 transitions.
[2020-10-15 18:17:06,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-15 18:17:06,316 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 23
[2020-10-15 18:17:06,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:06,317 INFO  L225             Difference]: With dead ends: 810
[2020-10-15 18:17:06,317 INFO  L226             Difference]: Without dead ends: 318
[2020-10-15 18:17:06,318 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-15 18:17:06,319 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2020-10-15 18:17:06,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 302.
[2020-10-15 18:17:06,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 302 states.
[2020-10-15 18:17:06,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 803 transitions.
[2020-10-15 18:17:06,324 INFO  L78                 Accepts]: Start accepts. Automaton has 302 states and 803 transitions. Word has length 23
[2020-10-15 18:17:06,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:06,324 INFO  L481      AbstractCegarLoop]: Abstraction has 302 states and 803 transitions.
[2020-10-15 18:17:06,324 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-15 18:17:06,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 302 states and 803 transitions.
[2020-10-15 18:17:06,325 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-15 18:17:06,325 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:06,325 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:06,326 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-15 18:17:06,326 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:06,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:06,326 INFO  L82        PathProgramCache]: Analyzing trace with hash -1639471165, now seen corresponding path program 1 times
[2020-10-15 18:17:06,326 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:06,326 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740564081]
[2020-10-15 18:17:06,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:06,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:06,411 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-15 18:17:06,411 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740564081]
[2020-10-15 18:17:06,411 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:06,411 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 18:17:06,412 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960916424]
[2020-10-15 18:17:06,412 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 18:17:06,412 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:06,412 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 18:17:06,412 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 18:17:06,413 INFO  L87              Difference]: Start difference. First operand 302 states and 803 transitions. Second operand 4 states.
[2020-10-15 18:17:06,430 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:06,430 INFO  L93              Difference]: Finished difference Result 376 states and 991 transitions.
[2020-10-15 18:17:06,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-15 18:17:06,431 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 27
[2020-10-15 18:17:06,431 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:06,432 INFO  L225             Difference]: With dead ends: 376
[2020-10-15 18:17:06,432 INFO  L226             Difference]: Without dead ends: 138
[2020-10-15 18:17:06,432 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-15 18:17:06,433 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2020-10-15 18:17:06,435 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138.
[2020-10-15 18:17:06,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 138 states.
[2020-10-15 18:17:06,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions.
[2020-10-15 18:17:06,436 INFO  L78                 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 27
[2020-10-15 18:17:06,437 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:06,437 INFO  L481      AbstractCegarLoop]: Abstraction has 138 states and 323 transitions.
[2020-10-15 18:17:06,437 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 18:17:06,437 INFO  L276                IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions.
[2020-10-15 18:17:06,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-15 18:17:06,439 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:06,439 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:06,439 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-15 18:17:06,439 INFO  L429      AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:06,440 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:06,440 INFO  L82        PathProgramCache]: Analyzing trace with hash 1076556023, now seen corresponding path program 2 times
[2020-10-15 18:17:06,440 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:06,440 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955560580]
[2020-10-15 18:17:06,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:06,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:17:07,052 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-15 18:17:07,053 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955560580]
[2020-10-15 18:17:07,054 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:17:07,054 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-15 18:17:07,054 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228417536]
[2020-10-15 18:17:07,056 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-15 18:17:07,056 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:17:07,056 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-15 18:17:07,056 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2020-10-15 18:17:07,056 INFO  L87              Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 9 states.
[2020-10-15 18:17:07,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:17:07,205 INFO  L93              Difference]: Finished difference Result 176 states and 409 transitions.
[2020-10-15 18:17:07,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 18:17:07,206 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 27
[2020-10-15 18:17:07,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:17:07,206 INFO  L225             Difference]: With dead ends: 176
[2020-10-15 18:17:07,206 INFO  L226             Difference]: Without dead ends: 92
[2020-10-15 18:17:07,207 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2020-10-15 18:17:07,207 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2020-10-15 18:17:07,208 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2020-10-15 18:17:07,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2020-10-15 18:17:07,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 195 transitions.
[2020-10-15 18:17:07,209 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 195 transitions. Word has length 27
[2020-10-15 18:17:07,209 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:17:07,209 INFO  L481      AbstractCegarLoop]: Abstraction has 92 states and 195 transitions.
[2020-10-15 18:17:07,209 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-15 18:17:07,209 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 195 transitions.
[2020-10-15 18:17:07,209 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-15 18:17:07,210 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:17:07,210 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:17:07,210 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-10-15 18:17:07,210 INFO  L429      AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:17:07,210 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:17:07,210 INFO  L82        PathProgramCache]: Analyzing trace with hash 1976359869, now seen corresponding path program 3 times
[2020-10-15 18:17:07,211 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:17:07,211 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546074197]
[2020-10-15 18:17:07,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:17:07,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-15 18:17:07,254 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-15 18:17:07,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-15 18:17:07,300 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-15 18:17:07,339 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-15 18:17:07,339 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-15 18:17:07,340 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2020-10-15 18:17:07,341 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-15 18:17:07,357 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-302171534 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-302171534 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-302171534 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-302171534 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and (= ~y$w_buff1_used~0_Out-302171534 0) .cse0 .cse1) (and (= ~y$w_buff1_used~0_Out-302171534 ~y$w_buff1_used~0_In-302171534) .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-302171534 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-302171534|) (or (and .cse3 .cse4 (= ~y$w_buff0_used~0_Out-302171534 0)) (and (= ~y$w_buff0_used~0_Out-302171534 ~y$w_buff0_used~0_In-302171534) .cse5)) (= ~y$r_buff0_thd0~0_In-302171534 ~y$r_buff0_thd0~0_Out-302171534) (= ~y$r_buff1_thd0~0_Out-302171534 ~y$r_buff1_thd0~0_In-302171534) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-302171534 0)) (or (and (or (and .cse0 (= ~y~0_Out-302171534 ~y$w_buff1~0_In-302171534) .cse1) (and .cse2 (= ~y~0_Out-302171534 ~y~0_In-302171534))) .cse5) (and .cse3 .cse4 (= ~y~0_Out-302171534 ~y$w_buff0~0_In-302171534))))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-302171534|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-302171534, ~y$w_buff1~0=~y$w_buff1~0_In-302171534, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-302171534, ~y$w_buff0~0=~y$w_buff0~0_In-302171534, ~y~0=~y~0_In-302171534, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-302171534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-302171534}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-302171534, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-302171534|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-302171534|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-302171534|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-302171534|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-302171534|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-302171534|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-302171534|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-302171534, ~y$w_buff1~0=~y$w_buff1~0_In-302171534, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-302171534, ~y$w_buff0~0=~y$w_buff0~0_In-302171534, ~y~0=~y~0_Out-302171534, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-302171534, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-302171534}  AuxVars[]  AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-15 18:17:07,363 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-15 18:17:07,364 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,365 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-15 18:17:07,365 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,365 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-15 18:17:07,365 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,366 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-15 18:17:07,366 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,366 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-15 18:17:07,366 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,367 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-15 18:17:07,367 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,367 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-15 18:17:07,367 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,368 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-15 18:17:07,368 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,368 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-15 18:17:07,369 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,369 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-15 18:17:07,369 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,369 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-15 18:17:07,369 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,369 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-15 18:17:07,370 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,370 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-15 18:17:07,370 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,370 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-15 18:17:07,371 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,371 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-15 18:17:07,371 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,371 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-15 18:17:07,371 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,371 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-15 18:17:07,372 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,372 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-15 18:17:07,373 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,373 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-15 18:17:07,373 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,373 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-15 18:17:07,373 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,373 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-15 18:17:07,374 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,374 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-15 18:17:07,374 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,374 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-15 18:17:07,374 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,374 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-15 18:17:07,375 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,375 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-15 18:17:07,375 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,375 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-15 18:17:07,375 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,375 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-15 18:17:07,375 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,376 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-15 18:17:07,376 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:17:07,449 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:17:07 BasicIcfg
[2020-10-15 18:17:07,449 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-15 18:17:07,451 INFO  L168              Benchmark]: Toolchain (without parser) took 21592.86 ms. Allocated memory was 249.0 MB in the beginning and 701.5 MB in the end (delta: 452.5 MB). Free memory was 205.0 MB in the beginning and 371.7 MB in the end (delta: -166.7 MB). Peak memory consumption was 285.8 MB. Max. memory is 14.2 GB.
[2020-10-15 18:17:07,451 INFO  L168              Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-15 18:17:07,451 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 787.57 ms. Allocated memory was 249.0 MB in the beginning and 307.8 MB in the end (delta: 58.7 MB). Free memory was 205.0 MB in the beginning and 256.0 MB in the end (delta: -51.0 MB). Peak memory consumption was 32.6 MB. Max. memory is 14.2 GB.
[2020-10-15 18:17:07,452 INFO  L168              Benchmark]: Boogie Procedure Inliner took 65.09 ms. Allocated memory is still 307.8 MB. Free memory was 256.0 MB in the beginning and 253.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-15 18:17:07,452 INFO  L168              Benchmark]: Boogie Preprocessor took 40.13 ms. Allocated memory is still 307.8 MB. Free memory was 253.5 MB in the beginning and 251.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-15 18:17:07,456 INFO  L168              Benchmark]: RCFGBuilder took 2282.57 ms. Allocated memory was 307.8 MB in the beginning and 355.5 MB in the end (delta: 47.7 MB). Free memory was 251.0 MB in the beginning and 181.3 MB in the end (delta: 69.7 MB). Peak memory consumption was 117.4 MB. Max. memory is 14.2 GB.
[2020-10-15 18:17:07,457 INFO  L168              Benchmark]: TraceAbstraction took 18411.17 ms. Allocated memory was 355.5 MB in the beginning and 701.5 MB in the end (delta: 346.0 MB). Free memory was 181.3 MB in the beginning and 371.7 MB in the end (delta: -190.4 MB). Peak memory consumption was 155.6 MB. Max. memory is 14.2 GB.
[2020-10-15 18:17:07,463 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.23 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 787.57 ms. Allocated memory was 249.0 MB in the beginning and 307.8 MB in the end (delta: 58.7 MB). Free memory was 205.0 MB in the beginning and 256.0 MB in the end (delta: -51.0 MB). Peak memory consumption was 32.6 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 65.09 ms. Allocated memory is still 307.8 MB. Free memory was 256.0 MB in the beginning and 253.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 40.13 ms. Allocated memory is still 307.8 MB. Free memory was 253.5 MB in the beginning and 251.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2282.57 ms. Allocated memory was 307.8 MB in the beginning and 355.5 MB in the end (delta: 47.7 MB). Free memory was 251.0 MB in the beginning and 181.3 MB in the end (delta: 69.7 MB). Peak memory consumption was 117.4 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 18411.17 ms. Allocated memory was 355.5 MB in the beginning and 701.5 MB in the end (delta: 346.0 MB). Free memory was 181.3 MB in the beginning and 371.7 MB in the end (delta: -190.4 MB). Peak memory consumption was 155.6 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1773 VarBasedMoverChecksPositive, 103 VarBasedMoverChecksNegative, 33 SemBasedMoverChecksPositive, 70 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 224 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7948 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L708]               0  _Bool main$tmp_guard0;
[L709]               0  _Bool main$tmp_guard1;
[L711]               0  int x = 0;
[L713]               0  int y = 0;
[L714]               0  _Bool y$flush_delayed;
[L715]               0  int y$mem_tmp;
[L716]               0  _Bool y$r_buff0_thd0;
[L717]               0  _Bool y$r_buff0_thd1;
[L718]               0  _Bool y$r_buff0_thd2;
[L719]               0  _Bool y$r_buff0_thd3;
[L720]               0  _Bool y$r_buff0_thd4;
[L721]               0  _Bool y$r_buff1_thd0;
[L722]               0  _Bool y$r_buff1_thd1;
[L723]               0  _Bool y$r_buff1_thd2;
[L724]               0  _Bool y$r_buff1_thd3;
[L725]               0  _Bool y$r_buff1_thd4;
[L726]               0  _Bool y$read_delayed;
[L727]               0  int *y$read_delayed_var;
[L728]               0  int y$w_buff0;
[L729]               0  _Bool y$w_buff0_used;
[L730]               0  int y$w_buff1;
[L731]               0  _Bool y$w_buff1_used;
[L733]               0  int z = 0;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L835]               0  pthread_t t789;
[L836]  FCALL, FORK  0  pthread_create(&t789, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L837]               0  pthread_t t790;
[L838]  FCALL, FORK  0  pthread_create(&t790, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L839]               0  pthread_t t791;
[L840]  FCALL, FORK  0  pthread_create(&t791, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L841]               0  pthread_t t792;
[L774]               3  y$w_buff1 = y$w_buff0
[L775]               3  y$w_buff0 = 2
[L776]               3  y$w_buff1_used = y$w_buff0_used
[L777]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L779]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L780]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L781]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L782]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L783]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L784]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L842]  FCALL, FORK  0  pthread_create(&t792, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L787]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L804]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L807]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L810]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L739]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L813]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L813]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L814]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L814]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L815]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L815]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L816]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L816]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L817]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L817]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L820]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L822]               4  return 0;
[L742]               1  __unbuffered_p0_EAX = x
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L754]               2  x = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L757]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[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;
[L790]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L790]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L794]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L749]               1  return 0;
[L844]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L855]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L856]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L857]               0  y$flush_delayed = weak$$choice2
[L858]               0  y$mem_tmp = y
[L859]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1
[L859]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L859]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L860]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L860]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L861]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L861]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L862]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L862]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L863]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L863]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L864]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L865]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L865]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L866]               0  main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L867]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L867]               0  y = y$flush_delayed ? y$mem_tmp : y
[L868]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 759 SDtfs, 838 SDslu, 1261 SDs, 0 SdLazy, 588 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 1330 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 61673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...